# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
516723 | KoD | Trobojnica (COCI19_trobojnica) | C++17 | 53 ms | 5964 KiB |
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;
std::cin >> N;
vector<int> id(N), label(N), next(N);
for (int i = 0; i < N; ++i) {
char c;
std::cin >> c;
id[i] = i;
label[i] = c - '1';
next[i] = i + 1 == N ? 0 : i + 1;
}
array<int, 3> count = {};
for (const int x : label) {
count[x] += 1;
}
for (const int x : count) {
if (x == N or x % 2 != N % 2) {
std::cout << "NE\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... |