#include<iostream>
#include<string>
using namespace std;
const int mod=1e9+7;
int len;
string s,a,b;
int f(int st,bool use)
{
if(st==b.size())
{
if(!use) return 1;
else return a[st]==b[st-1];
}
int res=use?0:f(st+1,true);
if(a[st]!=b[st-use]) return res;
else return f(st+1,use)+res;
}
int main()
{
cin>>len>>s;
if(!(len&1) || len==1) { cout<<"NOT POSSIBLE"; return 0; }
a=s.substr(0,len/2+1);
b=s.substr(len/2+1,len/2);
int cnt1=f(0,false);
a=s.substr(len/2,len/2+1);
b=s.substr(0,len/2);
int cnt2=f(0,false);
if(s.substr(0,len/2) == s.substr(len/2+1,len/2)) cnt2--;
if(cnt1+cnt2==0) cout<<"NOT POSSIBLE";
else if(cnt1+cnt2>=2) cout<<"NOT UNIQUE";
else cout<<(cnt1?s.substr(len/2+1,len/2):s.substr(0,len/2));
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 26 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 27 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 28 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 29 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 30 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 31 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 32 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 33 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 34 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 35 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 36 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 37 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 38 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 39 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 40 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 41 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 42 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 43 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 44 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 45 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 46 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 47 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 48 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 49 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 50 |
Incorrect |
7 ms |
1720 KB |
Output isn't correct |
| 51 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
97 ms |
54440 KB |
Output is correct |
| 2 |
Correct |
102 ms |
54440 KB |
Output is correct |
| 3 |
Correct |
82 ms |
54432 KB |
Output is correct |
| 4 |
Correct |
112 ms |
54440 KB |
Output is correct |
| 5 |
Incorrect |
110 ms |
54436 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
