답안 #316023

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
316023	2020-10-24T21:20:25 Z	sofapuden	세 명의 친구들 (BOI14_friends)	C++14	100 / 100	103 ms	8336 KB

friends

#include <bits/stdc++.h>

using namespace std;

vector<string> ans;

void tr(string a, string b){
	int cn[3];
	cn[0] = cn[1] = cn[2] = 0;
	while(cn[0] < (int)a.size() && cn[1] < (int)b.size()){
		if(a[cn[0]] == b[cn[1]]){cn[0]++, cn[1]++;}
		else{cn[2]++; cn[1]++;}
	}
	if(cn[2] > 1)return;
	if(ans.empty()){ans.push_back(a);return;}
	if(ans[0] != a){ans.push_back(a);return;}
}
	

int main(){
	int n; cin >> n;
	string s; cin >> s;
	if(!(n&1)){cout << "NOT POSSIBLE\n";return 0;}
	n/=2;
	tr(s.substr(0,n),s.substr(n,n+1));
	tr(s.substr(n+1,n), s.substr(0,n+1));
	
	if(ans.empty()){cout << "NOT POSSIBLE\n";return 0;}
	if(ans.size() == 1){cout << ans[0] << "\n"; return 0;}
	cout << "NOT UNIQUE\n";
	
}

Subtask #1

35.0 / 35.0

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

Subtask #2

65.0 / 65.0

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