Submission #653142

#TimeUsernameProblemLanguageResultExecution timeMemory
653142aryan12Three Friends (BOI14_friends)C++17
0 / 100
59 ms4268 KiB
#include <iostream> using namespace std; string s; int n,p,k; bool m(int i, int j){for(k=p=0;k<=n;k++)p+=p<n&&s[i+p]==s[j+k];return p==n;} int main(){cin>>n>>s;s+='$';bool L=m(0,n/=2),R=m(n+1,0);if((!L&&!R)||size(s)&1)return !(cout<<"NOT POSSIBLE");if(L&&R&&!m(0,n-1))cout<<"NOT UNIQUE";else cout<<s.substr(R*(n+1),n);}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...