oj.uz

Submission #16777

# Submission time Handle Problem Language Result Execution time Memory
16777 2015-09-28T15:52:38 Z kdh9949 Three Friends (BOI14_friends) C++
100 / 100
 27 ms 3144 KB 
#include<stdio.h>
#include<string.h>
char a[2111111];
int n,p,q;
int f(int pivots,int pivote,int targets,int targete)
{
    int j=pivots,i=targets,k=0;
    for(;i<=targete;i++)
    {
        if(a[i]==a[j])j++,k++;
    }
    return (k>=n/2);
}
int main()
{
    scanf("%d%s",&n,a);
    if(n%2==0)
    {
        puts("NOT POSSIBLE");
        return 0;
    }
    p=f(0,n/2-1,n/2,n-1);
    q=f(n/2+1,n-1,0,n/2);
    a[n/2]=0;
    if(p&&q)
    {
        if(strcmp(a,a+n/2+1))puts("NOT UNIQUE");
        else puts(a);
    }
    else if(p&&(!q)) puts(a);
    else if((!p)&&q) puts(a+n/2+1);
    else puts("NOT POSSIBLE");
}

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

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