#include <bits/stdc++.h>
using namespace std;
#define int long long
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
int32_t main(){
ios::sync_with_stdio(0);cin.tie(0);
int n;cin>>n;
char a[n];
for(int i=0;i<n;i++)cin>>a[i];
if(n%2==0){
cout<<"NOT POSSIBLE";
return 0;
}
int in=n/2,c=0,co=2,s=1,check=0;
for(int i=0;i<n/2;i++){
if(a[i]==a[i+in+c]);
else{
if(i==0)check=1;
i--;
if(c==1){
co--;
break;
}c++;
}
}
in++;c=0;
for(int i=0;i<n/2;i++){
if(a[i+c]==a[i+in]);
else{
i--;
if(c==1){
s=0;
co--;
break;
}c++;
}
}
if(co==2&&check==0)cout<<"NOT UNIQUE";
else if(co==0)cout<<"NOT POSSIBLE";
else{
if(s){
c=0;
for(int i=0;i<n/2;i++){
if(a[i+c]==a[i+n/2+1])cout<<a[i+c];
else {i--;c++;}
}
}else{
c=0;
for(int i=0;i<n/2;i++){
if(a[i]==a[i+n/2+c])cout<<a[i];
else {i--;c++;}
}
}
}
}
| # |
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 |
0 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 |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
348 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 |
0 ms |
348 KB |
Output is correct |
| 21 |
Correct |
0 ms |
348 KB |
Output is correct |
| 22 |
Correct |
1 ms |
348 KB |
Output is correct |
| 23 |
Correct |
0 ms |
348 KB |
Output is correct |
| 24 |
Correct |
0 ms |
456 KB |
Output is correct |
| 25 |
Correct |
1 ms |
344 KB |
Output is correct |
| 26 |
Correct |
0 ms |
348 KB |
Output is correct |
| 27 |
Correct |
0 ms |
348 KB |
Output is correct |
| 28 |
Correct |
1 ms |
348 KB |
Output is correct |
| 29 |
Correct |
0 ms |
348 KB |
Output is correct |
| 30 |
Correct |
0 ms |
348 KB |
Output is correct |
| 31 |
Correct |
1 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
| 33 |
Correct |
0 ms |
348 KB |
Output is correct |
| 34 |
Correct |
0 ms |
348 KB |
Output is correct |
| 35 |
Correct |
1 ms |
456 KB |
Output is correct |
| 36 |
Correct |
1 ms |
348 KB |
Output is correct |
| 37 |
Correct |
0 ms |
348 KB |
Output is correct |
| 38 |
Correct |
1 ms |
348 KB |
Output is correct |
| 39 |
Correct |
1 ms |
348 KB |
Output is correct |
| 40 |
Correct |
1 ms |
1012 KB |
Output is correct |
| 41 |
Correct |
0 ms |
344 KB |
Output is correct |
| 42 |
Correct |
0 ms |
348 KB |
Output is correct |
| 43 |
Correct |
0 ms |
348 KB |
Output is correct |
| 44 |
Correct |
0 ms |
348 KB |
Output is correct |
| 45 |
Correct |
0 ms |
348 KB |
Output is correct |
| 46 |
Correct |
0 ms |
348 KB |
Output is correct |
| 47 |
Correct |
0 ms |
348 KB |
Output is correct |
| 48 |
Correct |
1 ms |
348 KB |
Output is correct |
| 49 |
Correct |
0 ms |
348 KB |
Output is correct |
| 50 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 51 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
35 ms |
3156 KB |
Output is correct |
| 2 |
Correct |
35 ms |
3388 KB |
Output is correct |
| 3 |
Correct |
35 ms |
3152 KB |
Output is correct |
| 4 |
Correct |
35 ms |
3156 KB |
Output is correct |
| 5 |
Correct |
34 ms |
3156 KB |
Output is correct |
| 6 |
Correct |
17 ms |
2396 KB |
Output is correct |
| 7 |
Incorrect |
18 ms |
2396 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
