This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using std::vector;
using std::array;
using std::pair;
using std::tuple;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int N, K;
std::cin >> N >> K;
vector<int> grid(N * N);
for (auto& x : grid) {
char c;
std::cin >> c;
x = (c == 'o');
}
const auto cell = [&](const int i, const int j) {
return i * N + j;
};
for (int i = 1; i < N; ++i) {
for (int j = 1; j < N; ++j) {
int sum = 0;
sum += grid[cell(i, j)];
sum += grid[cell(i, j - 1)];
sum += grid[cell(i - 1, j)];
sum += grid[cell(i - 1, j - 1)];
if (sum % 2 == 1) {
std::cout << "NE\n";
return 0;
}
}
}
std::cout << "DA\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |