제출 #262100

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
262100		Hehehe	세 명의 친구들 (BOI14_friends)	C++14	100 / 100	17 ms	7204 KiB

friends

#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<long double, long double>
#define sz(x) (int)((x).size())
//#define int long long

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 2e6 + 11;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);

//ifstream in(".in");
//ofstream out(".out");

int n;
string s;

void solve(){

    cin >> n >> s;

    vector<string>v;

    if(n % 2 == 0){
        cout << "NOT POSSIBLE" << '\n';
        return;
    }

    int mid = n/2, x = n/2 + 1;
    for(int i =  0;  i <= mid; i++){
        if(x < n && s[i] == s[x])x++;
    }

    if(x == n){
        v.push_back(s.substr(mid + 1, mid));
    }

    x = 0;
    for(int i = mid; i < n; i++){
        if(x < mid && s[i] == s[x])x++;
    }

    if(x == mid){
        v.push_back(s.substr(0, mid));
    }

    if(sz(v) > 1 && v[0] != v[1]){
        cout << "NOT UNIQUE" << '\n';
    }else
    if(sz(v) >= 1){
        cout << v[0] << '\n';
    }else{
        cout << "NOT POSSIBLE" << '\n';
    }

}



int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);

    //cout << setprecision(6) << fixed;

    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
}

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