답안 #107068

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
107068	2019-04-21T16:34:18 Z	Pajaraja	세 명의 친구들 (BOI14_friends)	C++17	100 / 100	133 ms	6304 KB

friends

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	string s;
	cin>>n>>s;
	if(n%2==0) {cout<<"NOT POSSIBLE"; return 0;}
	int p=n/2;
	bool sm=true;
	for(int i=0;i<p;i++) if(s[i]!=s[p+1+i]) sm=false;
	int tp=0,td=0;
	for(int i=0;i<p && tp<=1;i++) while(s[i]!=s[i+p+tp] && tp<=1) tp++;
	for(int i=n-1;i>=n-p && td<=1;i--) while(s[i]!=s[i-p-td] && td<=1) td++;
	if(sm) {for(int i=0;i<p;i++) cout<<s[i]; return 0;}
	if(tp>1 && td>1) {cout<<"NOT POSSIBLE"; return 0;}
	if(tp<=1 && td<=1) {cout<<"NOT UNIQUE"; return 0;}
	if(td>1) {for(int i=0;i<p;i++) cout<<s[i]; return 0;}
	for(int i=p+1;i<n;i++) cout<<s[i];
}

Subtask #1

35.0 / 35.0

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

Subtask #2

65.0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	116 ms	6176 KB	Output is correct
2	Correct	133 ms	6296 KB	Output is correct
3	Correct	100 ms	6252 KB	Output is correct
4	Correct	110 ms	6248 KB	Output is correct
5	Correct	94 ms	6252 KB	Output is correct
6	Correct	69 ms	6304 KB	Output is correct
7	Correct	104 ms	6248 KB	Output is correct
8	Correct	65 ms	3944 KB	Output is correct
9	Correct	93 ms	4812 KB	Output is correct
10	Correct	97 ms	4844 KB	Output is correct
11	Correct	64 ms	3804 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	3 ms	256 KB	Output is correct
23	Correct	3 ms	356 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	2 ms	256 KB	Output is correct
28	Correct	2 ms	256 KB	Output is correct
29	Correct	2 ms	256 KB	Output is correct
30	Correct	2 ms	256 KB	Output is correct
31	Correct	3 ms	256 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct
33	Correct	3 ms	384 KB	Output is correct
34	Correct	2 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	2 ms	384 KB	Output is correct
37	Correct	2 ms	256 KB	Output is correct
38	Correct	3 ms	256 KB	Output is correct
39	Correct	2 ms	384 KB	Output is correct
40	Correct	2 ms	256 KB	Output is correct
41	Correct	2 ms	256 KB	Output is correct
42	Correct	2 ms	384 KB	Output is correct
43	Correct	3 ms	256 KB	Output is correct
44	Correct	3 ms	384 KB	Output is correct
45	Correct	2 ms	384 KB	Output is correct
46	Correct	2 ms	384 KB	Output is correct
47	Correct	2 ms	256 KB	Output is correct
48	Correct	3 ms	256 KB	Output is correct
49	Correct	3 ms	384 KB	Output is correct
50	Correct	2 ms	256 KB	Output is correct
51	Correct	2 ms	256 KB	Output is correct
52	Correct	3 ms	512 KB	Output is correct
53	Correct	3 ms	384 KB	Output is correct
54	Correct	3 ms	384 KB	Output is correct