제출 #1126587

#제출 시각아이디문제언어결과실행 시간메모리
1126587Halym2007세 명의 친구들 (BOI14_friends)C++17
0 / 100
1095 ms8204 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define sz size() #define ff first #define ss second #define pb push_back #define pii pair <int, int> #define dur exit(0) #define dur1 return(0) const int N = 2e5 + 5; int main () { // freopen ("input.txt", "r", stdin); ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); int n; string s; cin >> n >> s; if (n % 2 == 0) { cout << "NOT POSSIBLE\n"; return 0; } s = " " + s; int san = 0; string idx; for (int i = 1; i <= n; ++i) { int ok = 0; string t; for (int j = 1; j <= n; ++j) { if (j == i) continue; t += s[j]; } for (int j = 0; j + (n / 2) < (int)t.sz; ++j) { if (t[j] != t[j + (n / 2)]) { ok = 1; } } if (!ok) { san++; idx = t; } } if (!san) { cout << "NOT POSSIBLE\n"; } else if (san == 1) { int git = n / 2; for (int i = 0; i < (n / 2); ++i) { cout << idx[i]; } return 0; } else { cout << "NOT UNIQUE\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...