#include <bits/stdc++.h>
#define subs(a, b) substr(a, b-a+1)
using namespace std;
int main() {
int n;
cin >> n;
if(n%2 == 0){
cout << "NOT POSSIBLE\n";
return 0;
}
string str;
cin >> str;
string resp = "NOT POSSIBLE";
for(int i=0;i<n;i++){
string x;
for(int j=0;j<n;j++)
if(j != i) x += str[j];
int k = x.size();
if(x.subs(0, k/2 - 1) == x.subs(k/2, k-1)){
if(resp != "NOT POSSIBLE" && resp != x.subs(0, k/2 - 1)){
cout << "NOT UNIQUE\n";
return 0;
}
resp = x.subs(0, k/2 - 1);
}
}
cout << resp << "\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
256 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
2 ms |
256 KB |
Output is correct |
| 5 |
Correct |
2 ms |
256 KB |
Output is correct |
| 6 |
Correct |
3 ms |
256 KB |
Output is correct |
| 7 |
Correct |
2 ms |
256 KB |
Output is correct |
| 8 |
Correct |
3 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
256 KB |
Output is correct |
| 10 |
Correct |
2 ms |
384 KB |
Output is correct |
| 11 |
Correct |
2 ms |
256 KB |
Output is correct |
| 12 |
Correct |
2 ms |
256 KB |
Output is correct |
| 13 |
Correct |
3 ms |
384 KB |
Output is correct |
| 14 |
Correct |
2 ms |
256 KB |
Output is correct |
| 15 |
Correct |
2 ms |
384 KB |
Output is correct |
| 16 |
Correct |
2 ms |
256 KB |
Output is correct |
| 17 |
Correct |
2 ms |
384 KB |
Output is correct |
| 18 |
Correct |
2 ms |
256 KB |
Output is correct |
| 19 |
Correct |
2 ms |
384 KB |
Output is correct |
| 20 |
Correct |
2 ms |
384 KB |
Output is correct |
| 21 |
Correct |
2 ms |
256 KB |
Output is correct |
| 22 |
Correct |
3 ms |
384 KB |
Output is correct |
| 23 |
Correct |
3 ms |
384 KB |
Output is correct |
| 24 |
Correct |
2 ms |
256 KB |
Output is correct |
| 25 |
Correct |
3 ms |
280 KB |
Output is correct |
| 26 |
Correct |
3 ms |
256 KB |
Output is correct |
| 27 |
Correct |
2 ms |
256 KB |
Output is correct |
| 28 |
Correct |
2 ms |
256 KB |
Output is correct |
| 29 |
Correct |
2 ms |
384 KB |
Output is correct |
| 30 |
Correct |
2 ms |
256 KB |
Output is correct |
| 31 |
Correct |
3 ms |
384 KB |
Output is correct |
| 32 |
Correct |
2 ms |
256 KB |
Output is correct |
| 33 |
Correct |
2 ms |
256 KB |
Output is correct |
| 34 |
Correct |
3 ms |
256 KB |
Output is correct |
| 35 |
Correct |
2 ms |
384 KB |
Output is correct |
| 36 |
Correct |
2 ms |
256 KB |
Output is correct |
| 37 |
Correct |
2 ms |
256 KB |
Output is correct |
| 38 |
Correct |
2 ms |
256 KB |
Output is correct |
| 39 |
Correct |
3 ms |
384 KB |
Output is correct |
| 40 |
Correct |
2 ms |
384 KB |
Output is correct |
| 41 |
Correct |
2 ms |
384 KB |
Output is correct |
| 42 |
Correct |
2 ms |
384 KB |
Output is correct |
| 43 |
Correct |
2 ms |
256 KB |
Output is correct |
| 44 |
Correct |
14 ms |
256 KB |
Output is correct |
| 45 |
Correct |
17 ms |
384 KB |
Output is correct |
| 46 |
Correct |
15 ms |
384 KB |
Output is correct |
| 47 |
Correct |
16 ms |
384 KB |
Output is correct |
| 48 |
Correct |
16 ms |
384 KB |
Output is correct |
| 49 |
Correct |
2 ms |
256 KB |
Output is correct |
| 50 |
Correct |
17 ms |
256 KB |
Output is correct |
| 51 |
Correct |
12 ms |
384 KB |
Output is correct |
| 52 |
Correct |
12 ms |
384 KB |
Output is correct |
| 53 |
Correct |
13 ms |
384 KB |
Output is correct |
| 54 |
Correct |
11 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1063 ms |
8360 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
