oj.uz

Submission #17424

# Submission time Handle Problem Language Result Execution time Memory
17424 2015-12-01T12:56:25 Z choyi0521 Three Friends (BOI14_friends) C++
100 / 100
 96 ms 3676 KB 
#include<iostream>
#include<string.h>
using namespace std;
const int MAX_N=2000001;
int n;
char str[MAX_N+1];
int main(){
	cin >> n >> str;
	int i,tmp=0;
	for(i=0; i<n/2 && str[i]==str[n/2+i]; i++);
	for(; i<n/2 && str[i]==str[n/2+1+i]; i++);
	if(i==n/2) tmp+=1;
	for(i=0; i<n/2 && str[i]==str[n/2+1+i]; i++);
	for(; i<n/2 && str[i+1]==str[n/2+1+i]; i++);
	if(i==n/2) tmp+=2;
	str[n/2]=0;
	if(tmp==0 || n%2==0) cout<<"NOT POSSIBLE";
	else if(tmp==3 && strcmp(str,str+n/2+1)) cout << "NOT UNIQUE";
	else if(tmp==1) cout<<str;
	else cout<<str+n/2+1;
	return 0;
}

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

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