# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
938388 | ezzzay | Three Friends (BOI14_friends) | C++14 | 3185 ms | 262144 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;
#define ff first
#define ss second
const int N=4e3+2;
char arr[N][N];
int n;
string s;
signed main(){
cin>>n;
cin>>s;
map<char,int>mp;
for(int i=0;i<n;i++){
mp[s[i]]++;
}
int k=0;
char x;
for(auto it=mp.begin();it!=mp.end();it++){
if(it->ss%2){
k++;
x=it->ff;
}
}
if(k!=1){
cout<<"NOT POSSIBLE";
return 0;
}
int cnt=0;
string ans;
for(int idx=0;idx<n;idx++){
if(s[idx]==x ){
string a,b;
for(int i=0;i<s.size();i++){
if(i==idx)continue;
if(a.size()<n/2)a+=s[i];
else b+=s[i];
}
cout<<a<<" "<<b<<endl;
if(a==b){
cnt++;
ans=a;
}
}
}
if(cnt==0){
cout<<"NOT POSSIBLE";
return 0;
}
if(cnt==1){
cout<<ans;
}
else{
cout<<"NOT UNIQUE";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |