# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105696 | sams | Three Friends (BOI14_friends) | C++14 | 173 ms | 9816 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6+10;
int n;
char u[maxn];
string a, b, s1, s2;
int main()
{
scanf("%d", &n);
for(int i = 0 ; i < n ; ++i) scanf(" %c", &u[i]);
if(n%2 == 0)
{
printf("NOT POSSIBLE\n");
return 0;
}
int mid = (n-1)/2, p1 = -1, p2 = -1;
bool ok1 = true, ok2 = true;
for(int i = 0 ; i < mid ; ++i) a.push_back(u[i]);
for(int i = mid ; i < n ; ++i) b.push_back(u[i]);
for(int i = 0, j = 0; i < mid ; ++j, ++i)
{
if(a[i] != b[j])
{ if(p1 == -1 && a[i] == b[++j]) p1 = j;
else
{
ok1 = false;
break;
}
}
s1 += a[i];
}
a.clear(); b.clear();
for(int i = 0 ; i <= mid ; ++i) b.push_back(u[i]);
for(int i = mid + 1 ; i < n ; ++i) a.push_back(u[i]);
for(int i = 0, j = 0; i < mid ; ++j, ++i)
{
if(a[i] != b[j])
{ if(p2 == -1 && a[i] == b[++j]) p2 = j;
else
{
ok2 = false;
break;
}
}
s2 += a[i];
}
if(!ok1 && !ok2) printf("NOT POSSIBLE\n");
else
{
if(ok1 && ok2 && s1 != s2) printf("NOT UNIQUE");
else if(ok1) for(int i = 0 ; i < s1.size() ; ++i) printf(" %c", s1[i]);
else for(int i = 0 ; i < s2.size() ; ++i) printf(" %c", s2[i]);
printf("\n");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |