# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105655 | sofhiasouza | Three Friends (BOI14_friends) | C++14 | 1082 ms | 10336 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>
#define pb push_back
using namespace std;
int main()
{
int n, cont = -1, flag = 0, anteind = -1;
vector < int > vet;
cin >> n;
string s, s11 = "", s12 = "",s21 = "", s22 = "", s112 = "", s212 = "";
cin >> s;
if(n%2 == 0) flag = 0;
else
{
for(int i = n-1 ; i >= 0 ; i--)
{
if(i <= n/2) s11.pb(s[i]);
else s21.pb(s[i]);
if(i < n/2) s112.pb(s[i]);
else s212.pb(s[i]);
}
while(s11.size())
{
char k = s11[s11.size()-1];
s11.pop_back();
if(s11 == s21 and s12 == s22)
{
if(anteind == -1)
{
anteind = (n/2 - s11.size());
flag = 1;
}
else if(anteind == (n/2 - s11.size()) or s[(n/2 - s11.size())] == s[anteind]) flag = 2;
}
if(!s11.size()) continue;
s12.pb(k);
char k1 = s21[s21.size()-1];
s21.pop_back();
s22.pb(k1);
}
s11 = s112, s12 = "",s21 = s212, s22 = "";
while(s21.size())
{
char k = s21[s21.size()-1];
s21.pop_back();
if(s11 == s21 and s12 == s22)
{
if(anteind == -1)
{
anteind = (n - 1 - s21.size());
flag = 1;
}
else if(anteind == (n - 1 - s21.size()) or s[(n - 1 - s21.size())] == s[anteind]) flag = 2;
}
if(!s21.size()) continue;
s22.pb(k);
char k1 = s11[s11.size()-1];
s11.pop_back();
s12.pb(k1);
}
}
if(flag == 0) cout << "NOT POSSIBLE\n";
else if(flag == 1)
{
for(int j = 0 ; j < n/2 ; j++)
{
if(j != anteind) cout << s[j];
}
if(anteind < n/2) cout << s[n/2];
cout << endl;
}
else cout << "NOT UNIQUE\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |