QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#372307 | #8516. LED Matrix | YeongTree | WA | 0ms | 3680kb | C++17 | 962b | 2024-03-31 11:00:06 | 2024-03-31 11:00:08 |
Judging History
answer
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <set>
#include <map>
#include <random>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define piii pair<int, pii>
#define plll pair<long long, pll>
#define tiii array<int, 3>
#define tiiii array<int, 4>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
typedef long long ll;
const int INF = (int)1e9 + 7;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m, k; cin >> n >> m >> k;
int A[n];
for(int i = 0; i < n; ++i)
{
char c;
bool f1 = false, f2 = false;
for(int j = 0; j < m; ++j)
{
cin >> c;
if(c == '_') f1 = true;
}
cin >> c;
for(int j = 0; j < k; ++j)
{
cin >> c;
if(c == '*') f2 = true;
}
if(f1 && f2) return !(cout << "N");
}
cout << "Y";
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3680kb
input:
6 6 6 ****** --*--- ****** -**--- ****** ****** ****** ****** ****** -**--- *****- --*---
output:
Y
result:
wrong answer 1st words differ - expected: 'N', found: 'Y'