#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
#define N 2000001
int n, cnt;
string a, x, y;
void input()
{
char temp[N + 2];
scanf("%d", &n);
scanf("%s", temp);
a = temp;
a = "-" + a;
}
bool check(int s1, int e1, int s2, int e2)
{
int sig = 0;
for(int i = 0; i <= e1 - s1; i++)
{
//printf("------ %d %c %c\n", i, a[s1 + i], a[s2 + i + sig]);
if(a[s1 + i] != a[s2 + i + sig])
{
if(sig)
{
return false;
}
sig++;
}
}
return true;
}
void core()
{
if(n % 2 == 0)
{
printf("NOT POSSIBLE");
return;
}
if(check(1, n / 2, n / 2 + 1, n))
{
//printf("----------------------1\n");
x = '-';
for(int i = 1; i <= n / 2; i++)
{
x = x + a[i];
}
cnt++;
}
if(check(n / 2 + 2, n, 1, n / 2 + 1))
{
//printf("----------------------2\n");
y = '-';
for(int i = n / 2 + 2; i <= n; i++)
{
y = y + a[i];
}
cnt += 3;
}
//printf("-jsalkdak\n");
if(cnt == 0)
{
printf("NOT POSSIBLE");
}
else if(cnt % 2)
{
if(cnt == 1)
{
printf("%s", &x.c_str()[1]);
}
else
{
printf("%s", &y.c_str()[1]);
}
}
else
{
if(x == y)
{
printf("%s", &x.c_str()[1]);
}
else
{
printf("NOT UNIQUE");
}
}
//printf("%s\n", a.c_str());
//printf("%d", check(1, n / 2, n / 2 + 1, n));
}
int main()
{
input();
core();
return 0;
}
Compilation message
friends.cpp: In function 'void input()':
friends.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
17 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
friends.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
18 | scanf("%s", temp);
| ~~~~~^~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2132 KB |
Output is correct |
2 |
Correct |
1 ms |
2244 KB |
Output is correct |
3 |
Correct |
1 ms |
2132 KB |
Output is correct |
4 |
Correct |
2 ms |
2176 KB |
Output is correct |
5 |
Correct |
1 ms |
2132 KB |
Output is correct |
6 |
Correct |
1 ms |
2252 KB |
Output is correct |
7 |
Correct |
1 ms |
2248 KB |
Output is correct |
8 |
Correct |
1 ms |
2132 KB |
Output is correct |
9 |
Correct |
1 ms |
2132 KB |
Output is correct |
10 |
Correct |
2 ms |
2196 KB |
Output is correct |
11 |
Correct |
1 ms |
2132 KB |
Output is correct |
12 |
Correct |
2 ms |
2248 KB |
Output is correct |
13 |
Correct |
1 ms |
2132 KB |
Output is correct |
14 |
Correct |
2 ms |
2252 KB |
Output is correct |
15 |
Correct |
1 ms |
2132 KB |
Output is correct |
16 |
Correct |
2 ms |
2132 KB |
Output is correct |
17 |
Correct |
2 ms |
2132 KB |
Output is correct |
18 |
Correct |
2 ms |
2132 KB |
Output is correct |
19 |
Correct |
2 ms |
2176 KB |
Output is correct |
20 |
Correct |
2 ms |
2132 KB |
Output is correct |
21 |
Correct |
1 ms |
2132 KB |
Output is correct |
22 |
Correct |
2 ms |
2132 KB |
Output is correct |
23 |
Correct |
2 ms |
2132 KB |
Output is correct |
24 |
Correct |
1 ms |
2132 KB |
Output is correct |
25 |
Correct |
1 ms |
2244 KB |
Output is correct |
26 |
Correct |
2 ms |
2132 KB |
Output is correct |
27 |
Correct |
1 ms |
2140 KB |
Output is correct |
28 |
Correct |
2 ms |
2252 KB |
Output is correct |
29 |
Incorrect |
1 ms |
2140 KB |
Output isn't correct |
30 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1076 ms |
8012 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |