#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first
#define ll long long
#define ss second
using namespace std;
const int N=5*1e5+1;
ll t[N], x[N], y[N], v[N];
ll dar(ll a, ll b){
ll res=1;
for (int i=1;i<=b;i++) res*=a;
return res;
}
int main()
{
int n, ans=0;
cin >> n;
string s, ans1;
cin >> s;
if (n % 2 == 0){
cout << "NOT POSSIBLE";
return 0;
}
for (int i=0;i<n;i++){
string s1=s, s2=s;
s1.erase(i, 1); s2.erase(i, 1);
s1.erase(n/2, n);
s2.erase(0, n/2);
if (s1 == s2 and ans1 != "" and ans1 != s1){
cout << "NOT UNIQUE";
return 0;
}
if (s1 == s2){
ans++;
ans1=s1;
}
}
if (ans == 0) cout << "NOT POSSIBLE";
else cout << ans1;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| 10 |
Correct |
0 ms |
204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
204 KB |
Output is correct |
| 13 |
Correct |
0 ms |
204 KB |
Output is correct |
| 14 |
Correct |
0 ms |
204 KB |
Output is correct |
| 15 |
Correct |
0 ms |
204 KB |
Output is correct |
| 16 |
Correct |
0 ms |
204 KB |
Output is correct |
| 17 |
Correct |
0 ms |
204 KB |
Output is correct |
| 18 |
Correct |
0 ms |
204 KB |
Output is correct |
| 19 |
Correct |
0 ms |
204 KB |
Output is correct |
| 20 |
Correct |
0 ms |
204 KB |
Output is correct |
| 21 |
Correct |
0 ms |
204 KB |
Output is correct |
| 22 |
Correct |
0 ms |
224 KB |
Output is correct |
| 23 |
Correct |
0 ms |
204 KB |
Output is correct |
| 24 |
Correct |
1 ms |
204 KB |
Output is correct |
| 25 |
Correct |
0 ms |
204 KB |
Output is correct |
| 26 |
Correct |
0 ms |
204 KB |
Output is correct |
| 27 |
Correct |
0 ms |
204 KB |
Output is correct |
| 28 |
Correct |
0 ms |
204 KB |
Output is correct |
| 29 |
Correct |
0 ms |
204 KB |
Output is correct |
| 30 |
Correct |
0 ms |
204 KB |
Output is correct |
| 31 |
Correct |
0 ms |
204 KB |
Output is correct |
| 32 |
Correct |
0 ms |
204 KB |
Output is correct |
| 33 |
Correct |
0 ms |
204 KB |
Output is correct |
| 34 |
Correct |
0 ms |
204 KB |
Output is correct |
| 35 |
Correct |
0 ms |
204 KB |
Output is correct |
| 36 |
Correct |
0 ms |
204 KB |
Output is correct |
| 37 |
Correct |
0 ms |
204 KB |
Output is correct |
| 38 |
Correct |
0 ms |
204 KB |
Output is correct |
| 39 |
Correct |
0 ms |
204 KB |
Output is correct |
| 40 |
Correct |
0 ms |
204 KB |
Output is correct |
| 41 |
Correct |
0 ms |
204 KB |
Output is correct |
| 42 |
Correct |
0 ms |
204 KB |
Output is correct |
| 43 |
Correct |
0 ms |
204 KB |
Output is correct |
| 44 |
Correct |
1 ms |
204 KB |
Output is correct |
| 45 |
Correct |
1 ms |
204 KB |
Output is correct |
| 46 |
Correct |
1 ms |
204 KB |
Output is correct |
| 47 |
Correct |
1 ms |
204 KB |
Output is correct |
| 48 |
Correct |
1 ms |
204 KB |
Output is correct |
| 49 |
Correct |
0 ms |
204 KB |
Output is correct |
| 50 |
Correct |
1 ms |
204 KB |
Output is correct |
| 51 |
Correct |
1 ms |
204 KB |
Output is correct |
| 52 |
Correct |
1 ms |
272 KB |
Output is correct |
| 53 |
Correct |
1 ms |
300 KB |
Output is correct |
| 54 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
1099 ms |
6340 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
