#include <cstdio>
#include <cstdlib>
int n;
char str[2000005];
long long pow[2000005], l_hash, r_hash;
int result = -1;
void input(){
scanf("%d %s",&n,str);
if(!(n&1)){
puts("NOT POSSIBLE");
exit(0);
}
pow[0] = 1;
for (int i=1; i<n; i++) {
pow[i] = pow[i-1] * 697;
}
}
void output(){
if(result == -1) puts("NOT POSSIBLE");
else{
int p = 0;
for (int i=0; i<n/2+p; i++) {
if(i == result){
p++;
continue;
}
putchar(str[i]);
}
}
}
void calc_left(long long l_hash, long long r_hash){
int piv = 0;
for (int i=n/2-1; i>=0; i--) {
l_hash -= pow[piv] *(str[i] - str[i+1]);
if(l_hash == r_hash){
if(~result){
puts("NOT UNIQUE");
exit(0);
}
else result = i;
}
piv++;
}
}
void calc_right(long long l_hash, long long r_hash){
int piv = n/2-1;
for (int i=n/2+1; i<n; i++) {
r_hash += (str[i-1] -str[i]) * pow[piv];
if(l_hash == r_hash){
if(~result){
puts("NOT UNIQUE");
exit(0);
}
else result = i;
}
piv--;
}
}
int main(){
input();
for (int i=0; i<n/2; i++) {
l_hash *= 697;
r_hash *= 697;
l_hash += str[i] - 'A';
r_hash += str[n/2 + 1 + i] - 'A';
}
if(l_hash == r_hash) result = n/2;
calc_left(l_hash,r_hash);
calc_right(l_hash,r_hash);
output();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
18664 KB |
Output is correct |
2 |
Correct |
0 ms |
18664 KB |
Output is correct |
3 |
Correct |
0 ms |
18664 KB |
Output is correct |
4 |
Correct |
0 ms |
18664 KB |
Output is correct |
5 |
Correct |
0 ms |
18664 KB |
Output is correct |
6 |
Correct |
0 ms |
18664 KB |
Output is correct |
7 |
Correct |
0 ms |
18664 KB |
Output is correct |
8 |
Correct |
0 ms |
18664 KB |
Output is correct |
9 |
Correct |
0 ms |
18664 KB |
Output is correct |
10 |
Correct |
0 ms |
18664 KB |
Output is correct |
11 |
Correct |
0 ms |
18664 KB |
Output is correct |
12 |
Correct |
0 ms |
18664 KB |
Output is correct |
13 |
Correct |
0 ms |
18664 KB |
Output is correct |
14 |
Correct |
0 ms |
18664 KB |
Output is correct |
15 |
Correct |
0 ms |
18664 KB |
Output is correct |
16 |
Correct |
0 ms |
18664 KB |
Output is correct |
17 |
Correct |
0 ms |
18664 KB |
Output is correct |
18 |
Correct |
0 ms |
18664 KB |
Output is correct |
19 |
Correct |
0 ms |
18664 KB |
Output is correct |
20 |
Correct |
0 ms |
18664 KB |
Output is correct |
21 |
Correct |
0 ms |
18664 KB |
Output is correct |
22 |
Correct |
0 ms |
18664 KB |
Output is correct |
23 |
Correct |
0 ms |
18664 KB |
Output is correct |
24 |
Correct |
0 ms |
18664 KB |
Output is correct |
25 |
Correct |
0 ms |
18664 KB |
Output is correct |
26 |
Correct |
0 ms |
18664 KB |
Output is correct |
27 |
Correct |
0 ms |
18664 KB |
Output is correct |
28 |
Correct |
0 ms |
18664 KB |
Output is correct |
29 |
Correct |
0 ms |
18664 KB |
Output is correct |
30 |
Correct |
0 ms |
18664 KB |
Output is correct |
31 |
Correct |
0 ms |
18664 KB |
Output is correct |
32 |
Correct |
0 ms |
18664 KB |
Output is correct |
33 |
Correct |
0 ms |
18664 KB |
Output is correct |
34 |
Correct |
0 ms |
18664 KB |
Output is correct |
35 |
Correct |
0 ms |
18664 KB |
Output is correct |
36 |
Correct |
0 ms |
18664 KB |
Output is correct |
37 |
Correct |
0 ms |
18664 KB |
Output is correct |
38 |
Correct |
0 ms |
18664 KB |
Output is correct |
39 |
Correct |
0 ms |
18664 KB |
Output is correct |
40 |
Correct |
0 ms |
18664 KB |
Output is correct |
41 |
Correct |
0 ms |
18664 KB |
Output is correct |
42 |
Correct |
0 ms |
18664 KB |
Output is correct |
43 |
Correct |
0 ms |
18664 KB |
Output is correct |
44 |
Correct |
0 ms |
18664 KB |
Output is correct |
45 |
Correct |
0 ms |
18664 KB |
Output is correct |
46 |
Correct |
0 ms |
18664 KB |
Output is correct |
47 |
Correct |
0 ms |
18664 KB |
Output is correct |
48 |
Correct |
0 ms |
18664 KB |
Output is correct |
49 |
Correct |
0 ms |
18664 KB |
Output is correct |
50 |
Incorrect |
0 ms |
18664 KB |
Output isn't correct |
51 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
32 ms |
18664 KB |
Output is correct |
2 |
Correct |
32 ms |
18664 KB |
Output is correct |
3 |
Correct |
28 ms |
18664 KB |
Output is correct |
4 |
Correct |
32 ms |
18664 KB |
Output is correct |
5 |
Incorrect |
12 ms |
18664 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |