#include <bits/stdc++.h>
using namespace std;
int N;
char c;
char ok[2000010];
int pt;
bool ans1, ans2;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N;
if(!N%2){
cout << "NOT POSSIBLE";
return 0;
}
int k = N/2;
for(int a=1; a<=N; a++){
cin >> ok[a];
}
ans1 = ans2 = true;
pt = k+1;
for(int a=1; a<=k; a++){
while(pt != N+1 && ok[pt] != ok[a]) {
pt++;
}
if(pt == N+1){
ans1 = false;
break;
}
pt++;
}
pt = 1;
for(int a=k+2; a<=N; a++){
while(pt != k+2 && ok[pt] != ok[a]) {
pt++;
}
if(pt == k+2){
ans2 = false;
break;
}
pt++;
}
if(ans1 && ans2){
for(int a=1; a<=k; a++){
if(ok[a] != ok[a+k+1]){
cout << "NOT UNIQUE";
return 0;
}
}
for(int a=1; a<=k; a++){
cout << ok[a];
}
}
else if(ans1){
for(int a=1; a<=k; a++){
cout << ok[a];
}
}
else if(ans2){
for(int a=k+2; a<=N; a++){
cout << ok[a];
}
}
else{
cout << "NOT POSSIBLE";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
344 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
344 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
0 ms |
348 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
0 ms |
348 KB |
Output is correct |
19 |
Correct |
0 ms |
348 KB |
Output is correct |
20 |
Correct |
1 ms |
348 KB |
Output is correct |
21 |
Correct |
0 ms |
428 KB |
Output is correct |
22 |
Correct |
1 ms |
348 KB |
Output is correct |
23 |
Correct |
0 ms |
348 KB |
Output is correct |
24 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
25 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
36 ms |
3176 KB |
Output is correct |
2 |
Correct |
35 ms |
3296 KB |
Output is correct |
3 |
Correct |
35 ms |
3156 KB |
Output is correct |
4 |
Correct |
36 ms |
3152 KB |
Output is correct |
5 |
Correct |
35 ms |
3156 KB |
Output is correct |
6 |
Incorrect |
24 ms |
2392 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |