답안 #520693

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
520693	2022-01-30T20:47:08 Z	sidon	세 명의 친구들 (BOI14_friends)	C++17	100 / 100	57 ms	4612 KB

friends

#include <bits/stdc++.h>
using namespace std;

string s;
int n, p;

bool match(int i, int j) {
	for(int 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 = match(0, n/=2), R = match(n+1, 0);

	if((!L && !R) || size(s) & 1) return !(cout << "NOT POSSIBLE");

	if(L && R && !match(0, n+1)) cout << "NOT UNIQUE";
	else cout << s.substr(R*(n+1), n);
}

Subtask #1

35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	288 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	292 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	0 ms	296 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	0 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	1 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	0 ms	204 KB	Output is correct
38	Correct	0 ms	204 KB	Output is correct
39	Correct	0 ms	204 KB	Output is correct
40	Correct	0 ms	204 KB	Output is correct
41	Correct	1 ms	204 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	0 ms	204 KB	Output is correct
45	Correct	1 ms	204 KB	Output is correct
46	Correct	0 ms	204 KB	Output is correct
47	Correct	0 ms	204 KB	Output is correct
48	Correct	0 ms	204 KB	Output is correct
49	Correct	0 ms	204 KB	Output is correct
50	Correct	0 ms	204 KB	Output is correct
51	Correct	1 ms	204 KB	Output is correct
52	Correct	0 ms	292 KB	Output is correct
53	Correct	0 ms	204 KB	Output is correct
54	Correct	0 ms	204 KB	Output is correct

Subtask #2

65.0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	49 ms	4532 KB	Output is correct
2	Correct	48 ms	4604 KB	Output is correct
3	Correct	49 ms	4612 KB	Output is correct
4	Correct	48 ms	4596 KB	Output is correct
5	Correct	48 ms	4548 KB	Output is correct
6	Correct	48 ms	4600 KB	Output is correct
7	Correct	57 ms	4592 KB	Output is correct
8	Correct	45 ms	2688 KB	Output is correct
9	Correct	43 ms	4152 KB	Output is correct
10	Correct	43 ms	4200 KB	Output is correct
11	Correct	40 ms	2732 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	0 ms	288 KB	Output is correct
26	Correct	1 ms	288 KB	Output is correct
27	Correct	0 ms	204 KB	Output is correct
28	Correct	1 ms	252 KB	Output is correct
29	Correct	1 ms	292 KB	Output is correct
30	Correct	0 ms	292 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	0 ms	204 KB	Output is correct
38	Correct	0 ms	204 KB	Output is correct
39	Correct	0 ms	204 KB	Output is correct
40	Correct	0 ms	204 KB	Output is correct
41	Correct	0 ms	204 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	0 ms	288 KB	Output is correct
45	Correct	1 ms	204 KB	Output is correct
46	Correct	1 ms	204 KB	Output is correct
47	Correct	0 ms	204 KB	Output is correct
48	Correct	0 ms	204 KB	Output is correct
49	Correct	0 ms	204 KB	Output is correct
50	Correct	0 ms	204 KB	Output is correct
51	Correct	0 ms	288 KB	Output is correct
52	Correct	0 ms	204 KB	Output is correct
53	Correct	0 ms	292 KB	Output is correct
54	Correct	1 ms	204 KB	Output is correct