# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
728776 | 2023-04-23T05:20:12 Z | rominanafu | 세 명의 친구들 (BOI14_friends) | C++11 | 500 ms | 6116 KB |
#include <bits/stdc++.h> using namespace std; int n, len; string s; string r1, r2; bool unico = true; bool posible(int x) { int ini = 0, fin = len; if (x < fin) fin++; int cont=0; while (cont < len) { if (ini == x) ini++; if (fin == x) fin++; if (fin == n) { break; } if (s[ini] != s[fin]) return false; ini++; fin++; cont++; } return true; } int main() { ios_base::sync_with_stdio(); cin.tie(); cin >> n >> s; len = n/2; for(int i=0; i<n; i++) { if (posible(i)) { r2 = r1; if (i <= len) r1 = s.substr(len+1, len); else r1 = s.substr(0, len); if (r2.size() == len && r1 != r2) { unico = false; break; } } } if (r1.length() != len || (n&1) == 0) cout << "NOT POSSIBLE\n"; else if (!unico) cout << "NOT UNIQUE\n"; else cout << r1 << '\n'; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 296 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 304 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 1 ms | 212 KB | Output is correct |
12 | Correct | 1 ms | 304 KB | Output is correct |
13 | Correct | 1 ms | 212 KB | Output is correct |
14 | Correct | 0 ms | 212 KB | Output is correct |
15 | Correct | 1 ms | 212 KB | Output is correct |
16 | Correct | 0 ms | 212 KB | Output is correct |
17 | Correct | 0 ms | 304 KB | Output is correct |
18 | Correct | 0 ms | 212 KB | Output is correct |
19 | Correct | 1 ms | 212 KB | Output is correct |
20 | Correct | 0 ms | 212 KB | Output is correct |
21 | Correct | 1 ms | 212 KB | Output is correct |
22 | Correct | 1 ms | 212 KB | Output is correct |
23 | Correct | 1 ms | 300 KB | Output is correct |
24 | Correct | 1 ms | 300 KB | Output is correct |
25 | Correct | 0 ms | 212 KB | Output is correct |
26 | Correct | 1 ms | 300 KB | Output is correct |
27 | Correct | 0 ms | 212 KB | Output is correct |
28 | Correct | 1 ms | 212 KB | Output is correct |
29 | Correct | 1 ms | 212 KB | Output is correct |
30 | Correct | 0 ms | 212 KB | Output is correct |
31 | Correct | 1 ms | 212 KB | Output is correct |
32 | Correct | 0 ms | 212 KB | Output is correct |
33 | Correct | 1 ms | 212 KB | Output is correct |
34 | Correct | 1 ms | 212 KB | Output is correct |
35 | Correct | 0 ms | 312 KB | Output is correct |
36 | Correct | 0 ms | 216 KB | Output is correct |
37 | Correct | 1 ms | 300 KB | Output is correct |
38 | Correct | 1 ms | 212 KB | Output is correct |
39 | Correct | 1 ms | 212 KB | Output is correct |
40 | Correct | 0 ms | 212 KB | Output is correct |
41 | Correct | 0 ms | 212 KB | Output is correct |
42 | Correct | 0 ms | 212 KB | Output is correct |
43 | Correct | 1 ms | 212 KB | Output is correct |
44 | Correct | 1 ms | 212 KB | Output is correct |
45 | Correct | 1 ms | 212 KB | Output is correct |
46 | Correct | 1 ms | 224 KB | Output is correct |
47 | Correct | 1 ms | 212 KB | Output is correct |
48 | Correct | 1 ms | 212 KB | Output is correct |
49 | Correct | 4 ms | 212 KB | Output is correct |
50 | Correct | 4 ms | 272 KB | Output is correct |
51 | Correct | 1 ms | 212 KB | Output is correct |
52 | Correct | 1 ms | 216 KB | Output is correct |
53 | Correct | 1 ms | 220 KB | Output is correct |
54 | Correct | 1 ms | 284 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1074 ms | 6116 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |