제출 #528949

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
528949		perchuts	세 명의 친구들 (BOI14_friends)	C++17	0 / 100	27 ms	5340 KiB

friends

#include <bits/stdc++.h>
#define maxn (int)(1e5+51)
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define ll long long
#define pb push_back
#define ull unsigned long long
#define ii pair<int,int>
#define iii tuple<int,int,int>
#define inf 2000000001
#define mod 1000000007 //998244353
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;

template<typename X, typename Y> bool ckmin(X& x, const Y& y) { return (y < x) ? (x=y,1):0; }
template<typename X, typename Y> bool ckmax(X& x, const Y& y) { return (x < y) ? (x=y,1):0; }

string s;
int main(){_
    int n;cin>>n;
    if(!(n&1)){
        cout<<"NOT POSSIBLE"<<endl;
        return 0;
    }
    cin>>s;    
    int pr=0,suf=n/2,ans1=-1,ans2=-2;
    while(pr<n/2&&s[pr]==s[pr+(n+1)/2])pr++;
    while(suf>0&&s[suf]==s[suf+n/2])suf--;
    suf = max(0,suf), pr = min(n/2-1,pr);
    // cout<<suf<<" "<<pr<<endl;
    if(suf<pr){
        cout<<"NOT UNIQUE"<<endl;
        return 0;
    }else if(suf==pr)ans1 = suf;
    pr = 0, suf = n/2-1;
    while(pr<n/2&&s[pr]==s[pr+n/2])pr++;
    while(suf>=0&&s[suf]==s[suf+(n+1)/2])suf--;
    suf = max(0,suf), pr = min(n/2-1,pr);
    // cout<<suf<<" "<<pr<<endl;
    if(suf<pr){
        cout<<"NOT UNIQUE"<<endl;
        return 0;
    }else if(suf==pr)ans2=suf;

    if(ans1==ans2)for(int i=0;i<n/2;++i)cout<<s[i];
    else if(ans1!=-1&&ans2!=-2)cout<<"NOT UNIQUE"<<endl;
    else if(ans1!=-1)for(int i=n/2+1;i<n;++i)cout<<s[i];
    else if(ans2!=-2)for(int i=0;i<n/2;++i)cout<<s[i];
    else cout<<"NOT POSSIBLE"<<endl;
}

• Subtask 1: 0 / 35
• Subtask 2: 0 / 65