# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198066 | model_code | Trobojnica (COCI19_trobojnica) | C++17 | 89 ms | 7708 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 namespace std;
const int MaxN = 2e5 + 10;
int nxt[MaxN], color[MaxN], cnt[3];
int sol_x[MaxN], sol_y[MaxN], sol_c[MaxN];
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
color[i] = s[i] - '1';
cnt[s[i] - '1']++;
nxt[i] = (i + 1) % n;
}
int x = 0;
for (int i = 0; i < n - 3; i++) {
if (max(cnt[0], max(cnt[1], cnt[2])) == n - i) {
cout << "NE\n";
return 0;
}
while (color[x] == color[nxt[x]] ||
(cnt[color[x]] == 1 && cnt[color[nxt[x]]] == 1))
x = nxt[x];
int y = nxt[x];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |