oj.uz

Submission #13346

# Submission time Handle Problem Language Result Execution time Memory
13346 2015-02-12T14:57:14 Z woqja125 Three Friends (BOI14_friends) C++
100 / 100
 26 ms 3036 KB 
#include<stdio.h>
char s[2000010];
int main()
{
    int n, n2, cnt = 0, i;
    scanf("%d%s", &n, s);
    if(n%2 == 0)
    {
        printf("NOT POSSIBLE\n");
        return 0;
    }
    n2 = n/2;
    int ch = 0;
    for(i=n2+1; i<n; i++)
    {
        if(ch == 0 && s[i-n2-1] == s[i]) continue;
        else if(ch == 0 && s[i-n2] == s[i]) ch++;
        else if (ch == 0) break;
        else if (ch == 1 && s[i-n2] != s[i]) break;
    }
    if(i==n) cnt++;
    ch = 0;
    for(i=0; i<n2; i++)
    {
        if(ch == 0 && s[i+n2] == s[i]) continue;
        else if(ch == 0 && s[i+n2+1] == s[i]) ch++;
        else if(ch == 0) break;
        else if(ch == 1 && s[i+n2+1] != s[i]) break;
    }
    if(i==n2)
    {
        if(cnt == 0)
        {
            for(i=0; i<n2; i++) printf("%c", s[i]);
        }
        else
        {
            for(i=0; i<n2; i++) if(s[i] != s[i+n2+1]) break;
            if(i==n2) for(i=0; i<n2; i++) printf("%c", s[i]);
            else printf("NOT UNIQUE\n");
        }
    }
    else if(cnt == 1)
    {
        for(i=n2+1; i<n; i++)printf("%c", s[i]);
    }
    else printf("NOT POSSIBLE\n");
 
    return 0;
}

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3036 KB Output is correct
2 Correct 0 ms 3036 KB Output is correct
3 Correct 0 ms 3036 KB Output is correct
4 Correct 0 ms 3036 KB Output is correct
5 Correct 0 ms 3036 KB Output is correct
6 Correct 0 ms 3036 KB Output is correct
7 Correct 0 ms 3036 KB Output is correct
8 Correct 0 ms 3036 KB Output is correct
9 Correct 0 ms 3036 KB Output is correct
10 Correct 0 ms 3036 KB Output is correct
11 Correct 0 ms 3036 KB Output is correct
12 Correct 0 ms 3036 KB Output is correct
13 Correct 0 ms 3036 KB Output is correct
14 Correct 0 ms 3036 KB Output is correct
15 Correct 0 ms 3036 KB Output is correct
16 Correct 0 ms 3036 KB Output is correct
17 Correct 0 ms 3036 KB Output is correct
18 Correct 0 ms 3036 KB Output is correct
19 Correct 0 ms 3036 KB Output is correct
20 Correct 0 ms 3036 KB Output is correct
21 Correct 0 ms 3036 KB Output is correct
22 Correct 0 ms 3036 KB Output is correct
23 Correct 0 ms 3036 KB Output is correct
24 Correct 0 ms 3036 KB Output is correct
25 Correct 0 ms 3036 KB Output is correct
26 Correct 0 ms 3036 KB Output is correct
27 Correct 0 ms 3036 KB Output is correct
28 Correct 0 ms 3036 KB Output is correct
29 Correct 0 ms 3036 KB Output is correct
30 Correct 0 ms 3036 KB Output is correct
31 Correct 0 ms 3036 KB Output is correct
32 Correct 0 ms 3036 KB Output is correct
33 Correct 0 ms 3036 KB Output is correct
34 Correct 0 ms 3036 KB Output is correct
35 Correct 0 ms 3036 KB Output is correct
36 Correct 0 ms 3036 KB Output is correct
37 Correct 0 ms 3036 KB Output is correct
38 Correct 0 ms 3036 KB Output is correct
39 Correct 0 ms 3036 KB Output is correct
40 Correct 0 ms 3036 KB Output is correct
41 Correct 0 ms 3036 KB Output is correct
42 Correct 0 ms 3036 KB Output is correct
43 Correct 0 ms 3036 KB Output is correct
44 Correct 0 ms 3036 KB Output is correct
45 Correct 0 ms 3036 KB Output is correct
46 Correct 0 ms 3036 KB Output is correct
47 Correct 0 ms 3036 KB Output is correct
48 Correct 0 ms 3036 KB Output is correct
49 Correct 0 ms 3036 KB Output is correct
50 Correct 0 ms 3036 KB Output is correct
51 Correct 0 ms 3036 KB Output is correct
52 Correct 0 ms 3036 KB Output is correct
53 Correct 0 ms 3036 KB Output is correct
54 Correct 0 ms 3036 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 3036 KB Output is correct
2 Correct 20 ms 3036 KB Output is correct
3 Correct 0 ms 3036 KB Output is correct
4 Correct 24 ms 3036 KB Output is correct
5 Correct 19 ms 3036 KB Output is correct
6 Correct 14 ms 3036 KB Output is correct
7 Correct 26 ms 3036 KB Output is correct
8 Correct 23 ms 3036 KB Output is correct
9 Correct 23 ms 3036 KB Output is correct
10 Correct 16 ms 3036 KB Output is correct
11 Correct 0 ms 3036 KB Output is correct
12 Correct 0 ms 3036 KB Output is correct
13 Correct 0 ms 3036 KB Output is correct
14 Correct 0 ms 3036 KB Output is correct
15 Correct 0 ms 3036 KB Output is correct
16 Correct 0 ms 3036 KB Output is correct
17 Correct 0 ms 3036 KB Output is correct
18 Correct 0 ms 3036 KB Output is correct
19 Correct 0 ms 3036 KB Output is correct
20 Correct 0 ms 3036 KB Output is correct
21 Correct 0 ms 3036 KB Output is correct
22 Correct 0 ms 3036 KB Output is correct
23 Correct 0 ms 3036 KB Output is correct
24 Correct 0 ms 3036 KB Output is correct
25 Correct 0 ms 3036 KB Output is correct
26 Correct 0 ms 3036 KB Output is correct
27 Correct 0 ms 3036 KB Output is correct
28 Correct 0 ms 3036 KB Output is correct
29 Correct 0 ms 3036 KB Output is correct
30 Correct 0 ms 3036 KB Output is correct
31 Correct 0 ms 3036 KB Output is correct
32 Correct 0 ms 3036 KB Output is correct
33 Correct 0 ms 3036 KB Output is correct
34 Correct 0 ms 3036 KB Output is correct
35 Correct 0 ms 3036 KB Output is correct
36 Correct 0 ms 3036 KB Output is correct
37 Correct 0 ms 3036 KB Output is correct
38 Correct 0 ms 3036 KB Output is correct
39 Correct 0 ms 3036 KB Output is correct
40 Correct 0 ms 3036 KB Output is correct
41 Correct 0 ms 3036 KB Output is correct
42 Correct 0 ms 3036 KB Output is correct
43 Correct 0 ms 3036 KB Output is correct
44 Correct 0 ms 3036 KB Output is correct
45 Correct 0 ms 3036 KB Output is correct
46 Correct 0 ms 3036 KB Output is correct
47 Correct 0 ms 3036 KB Output is correct
48 Correct 0 ms 3036 KB Output is correct
49 Correct 0 ms 3036 KB Output is correct
50 Correct 0 ms 3036 KB Output is correct
51 Correct 0 ms 3036 KB Output is correct
52 Correct 0 ms 3036 KB Output is correct
53 Correct 0 ms 3036 KB Output is correct
54 Correct 0 ms 3036 KB Output is correct