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;
bool equal (int N, string & S, int extraChar) {
string a = "", b = "";
for (int i = 0; i < N; i++) {
if (i == extraChar) continue;
if ((int)a.size() < N/2) {
a += S[i];
} else {
b += S[i];
}
}
return a == b;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int N; // cin >> N;
string S; cin >> S;
N = (int)S.size();
if (N % 2 == 0) {
cout << "NOT POSSIBLE\n";
return 0;
}
int extraChar = 0, numSubstr = 0;
char left = ' ', right = ' ';
for (int i = 1; i <= N/2; i++)
left ^= S[i];
for (int i = N/2 + 1; i < N; i++)
right ^= S[i];
if (left == right && equal(N, S, extraChar)) numSubstr++;
for (int currChar = 1; currChar <= N/2; currChar++) {
left ^= S[currChar];
left ^= S[currChar - 1];
if (left == right) {
extraChar = currChar;
if (equal(N, S, extraChar)) numSubstr++;
if (numSubstr > 1) {
cout << "NOT UNIQUE\n";
return 0;
}
}
}
for (int currChar = N/2 + 1; currChar < N; currChar++) {
right ^= S[currChar];
right ^= S[currChar - 1];
if (left == right) {
extraChar = currChar;
if (equal(N, S, extraChar)) numSubstr++;
if (numSubstr > 1) {
cout << "NOT UNIQUE\n";
return 0;
}
}
}
if (numSubstr == 0) {
cout << "NOT POSSIBLE\n";
} else if (numSubstr > 1) {
cout << "NOT UNIQUE\n";
} else {
string a = "", b = "";
for (int i = 0; i < N; i++) {
if (i == extraChar) continue;
if ((int)a.size() < N/2) {
a += S[i];
} else {
b += S[i];
}
}
if (a == b) cout << a << '\n';
else cout << "NOT POSSIBLE\n";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |