# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492349 | vuavisao | Trobojnica (COCI19_trobojnica) | C++17 | 49 ms | 7604 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 N = 2e5 + 10;
int n, nxt[N], col[N], cnt[3], x[N], y[N], z[N];
string s;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> s;
for(int i = 0; i < n; i++)
{
int C = s[i] - '1';
col[i] = C;
cnt[C]++;
nxt[i] = (i + 1) % n;
}
int X = 0;
for(int i = 0; i < n - 3; i++)
{
if(max({cnt[0], cnt[1], cnt[2]}) == n - i)
{
cout << "NE";
return 0;
}
while(col[X] == col[nxt[X]] || (cnt[col[X]] == 1 && cnt[col[nxt[X]]] == 1)) X = 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... |