#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() (rand() >> 3)*rand()
int n, c[2], p=-1;
string s;
int main(){
//cin.sync_with_stdio(0);
//cin.tie(0);
//cout.sync_with_stdio(0);
//cout.tie(0);
cin >> n >> s;
n=s.size();
if (n%2==0){
cout << "NOT POSSIBLE";
return 0;
}
fox(l, n/2+1){
c[s[l]==s[l+n/2]]++;
}
fox(l, n){
if (l<=n/2)
c[s[l]==s[l+n/2]]--;
else
c[s[l]==s[l-n/2-1]]--;
if (c[0]==0){
if (p!=-1){
cout << "NOT UNIQUE";
return 0;
}
p=l;
}
//cout << c[0] << endl;
if (l<n/2)
c[s[l]==s[l+n/2+1]]++;
else
c[s[l]==s[l-n/2]]++;
}
if (p==-1) cout << "NOT POSSIBLE";
else {
//if (p>=n) while(1);
s.erase(p, 1);
s.erase(0, n/2);
cout << s;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2016 KB |
Output is correct |
2 |
Correct |
0 ms |
2016 KB |
Output is correct |
3 |
Correct |
0 ms |
2016 KB |
Output is correct |
4 |
Correct |
0 ms |
2016 KB |
Output is correct |
5 |
Correct |
0 ms |
2016 KB |
Output is correct |
6 |
Correct |
0 ms |
2016 KB |
Output is correct |
7 |
Correct |
0 ms |
2016 KB |
Output is correct |
8 |
Correct |
0 ms |
2016 KB |
Output is correct |
9 |
Correct |
0 ms |
2016 KB |
Output is correct |
10 |
Correct |
0 ms |
2016 KB |
Output is correct |
11 |
Correct |
0 ms |
2016 KB |
Output is correct |
12 |
Correct |
0 ms |
2016 KB |
Output is correct |
13 |
Correct |
0 ms |
2016 KB |
Output is correct |
14 |
Correct |
0 ms |
2016 KB |
Output is correct |
15 |
Correct |
0 ms |
2016 KB |
Output is correct |
16 |
Correct |
0 ms |
2016 KB |
Output is correct |
17 |
Correct |
0 ms |
2016 KB |
Output is correct |
18 |
Correct |
0 ms |
2016 KB |
Output is correct |
19 |
Correct |
0 ms |
2016 KB |
Output is correct |
20 |
Correct |
0 ms |
2016 KB |
Output is correct |
21 |
Correct |
0 ms |
2016 KB |
Output is correct |
22 |
Correct |
0 ms |
2016 KB |
Output is correct |
23 |
Correct |
0 ms |
2016 KB |
Output is correct |
24 |
Correct |
0 ms |
2016 KB |
Output is correct |
25 |
Correct |
0 ms |
2016 KB |
Output is correct |
26 |
Correct |
0 ms |
2016 KB |
Output is correct |
27 |
Correct |
0 ms |
2016 KB |
Output is correct |
28 |
Correct |
0 ms |
2016 KB |
Output is correct |
29 |
Correct |
0 ms |
2016 KB |
Output is correct |
30 |
Correct |
0 ms |
2016 KB |
Output is correct |
31 |
Correct |
0 ms |
2016 KB |
Output is correct |
32 |
Correct |
0 ms |
2016 KB |
Output is correct |
33 |
Correct |
0 ms |
2016 KB |
Output is correct |
34 |
Correct |
0 ms |
2016 KB |
Output is correct |
35 |
Correct |
0 ms |
2016 KB |
Output is correct |
36 |
Correct |
0 ms |
2016 KB |
Output is correct |
37 |
Correct |
0 ms |
2016 KB |
Output is correct |
38 |
Correct |
0 ms |
2016 KB |
Output is correct |
39 |
Correct |
0 ms |
2016 KB |
Output is correct |
40 |
Correct |
0 ms |
2016 KB |
Output is correct |
41 |
Correct |
0 ms |
2016 KB |
Output is correct |
42 |
Correct |
0 ms |
2016 KB |
Output is correct |
43 |
Correct |
0 ms |
2016 KB |
Output is correct |
44 |
Correct |
0 ms |
2016 KB |
Output is correct |
45 |
Correct |
0 ms |
2016 KB |
Output is correct |
46 |
Correct |
0 ms |
2016 KB |
Output is correct |
47 |
Correct |
0 ms |
2016 KB |
Output is correct |
48 |
Correct |
0 ms |
2016 KB |
Output is correct |
49 |
Correct |
0 ms |
2016 KB |
Output is correct |
50 |
Incorrect |
0 ms |
2016 KB |
Output isn't correct |
51 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
73 ms |
7860 KB |
Output is correct |
2 |
Correct |
93 ms |
7860 KB |
Output is correct |
3 |
Correct |
89 ms |
7860 KB |
Output is correct |
4 |
Correct |
86 ms |
7860 KB |
Output is correct |
5 |
Incorrect |
73 ms |
7860 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |