oj.uz

Submission #14813

# Submission time Handle Problem Language Result Execution time Memory
14813 2015-06-28T06:58:18 Z eaststar Three Friends (BOI14_friends) C++
100 / 100
 25 ms 3036 KB 
#include <stdio.h>
#include <string.h>
char a[2000010];
int f(int s1,int e1,int s2,int e2){
    int cnt=0;
    while(s1<=e1){
        if(a[s1]==a[s2])++s1,++s2;
        else{
            if(cnt)return 0;
            ++s2,++cnt;
        }
    }
    return 1;
}
int main()
{
    int i,n,flag=0;
    scanf("%d",&n);
    if(n%2==0){
        puts("NOT POSSIBLE");
        return 0;
    }
    scanf("%s",a+1);
    if(!strncmp(a+n/2+2,a+1,n/2)){
        for(i=1;i<=n/2;++i)printf("%c",a[i]);
        return 0;
    }
    if(f(1,n/2,n/2+1,n))flag=1;
    if(f(n/2+2,n,1,n/2+1)){
        if(flag){
            puts("NOT UNIQUE");
            return 0;
        }
        flag=2;
    }
    if(!flag)puts("NOT POSSIBLE");
    if(flag==1)for(i=1;i<=n/2;++i)printf("%c",a[i]);
    if(flag==2)for(i=n/2+2;i<=n;++i)printf("%c",a[i]);
    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 25 ms 3036 KB Output is correct
2 Correct 20 ms 3036 KB Output is correct
3 Correct 23 ms 3036 KB Output is correct
4 Correct 21 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 11 ms 3036 KB Output is correct
8 Correct 8 ms 3036 KB Output is correct
9 Correct 15 ms 3036 KB Output is correct
10 Correct 14 ms 3036 KB Output is correct
11 Correct 9 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