# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335310 | CaroLinda | Trobojnica (COCI19_trobojnica) | C++14 | 76 ms | 8408 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 ;
int N ;
int freq[3] ;
int main()
{
scanf("%d", &N) ;
vector<int> color(N) , nxt(N) , prev(N) ;
for(int i = 0 ; i < N ; i++ )
{
char c ;
scanf(" %c", &c ) ;
color[i] = c-'1' ;
freq[ color[i] ]++ ;
nxt[i] = (i == N-1) ? 0 : (i+1) ;
prev[ nxt[i] ] = i ;
}
for(int i = 0 ; i < 3 ; i++ )
if(freq[i] > N-2 || (N-2-freq[i])&1 )
{
printf("NE\n") ;
return 0 ;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |