oj.uz

Submission #11764

# Submission time Handle Problem Language Result Execution time Memory
11764 2014-12-09T03:43:35 Z gs12117 Three Friends (BOI14_friends) C++
100 / 100
 16 ms 4996 KB 
#include<stdio.h>
int n;
char a[2001000];
char b[2001000];
int main(){
	int i,t,flag;
	scanf("%d",&n);
	scanf("%s",a);
	if(n%2==0){
		puts("NOT POSSIBLE");
		return 0;
	}
	for(i=0;i<n/2;i++){
		if(a[i]!=a[i+n/2])break;
	}
	t=i;
	for(i=n/2-1;i>=0;i--){
		if(a[i]!=a[i+n/2+1])break;
	}
	if(t>i)flag=1;
	else flag=0;
	for(i=0;i<n/2+1;i++){
		if(a[i]!=a[i+n/2+1])break;
	}
	t=i;
	for(i=n/2;i>=0;i--){
		if(a[i]!=a[i+n/2])break;
	}
	if(t>=i){
		if(flag==1){
			for(i=0;i<n/2;i++){
				if(a[i]!=a[i+n/2+1])break;
			}
			if(i==n/2){
				for(i=0;i<n/2;i++){
					b[i]=a[i];
				}
				puts(b);
			}
			else{
				puts("NOT UNIQUE");
			}
		}
		else{
			for(i=0;i<n/2;i++){
				b[i]=a[i+n/2+1];
			}
			puts(b);
		}
	}
	else{
		if(flag==1){
			for(i=0;i<n/2;i++){
				b[i]=a[i];
			}
			puts(b);
		}
		else{
			puts("NOT POSSIBLE");
		}
	}
}

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

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