답안 #930729

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
930729	2024-02-20T10:29:53 Z	emptypringlescan	세 명의 친구들 (BOI14_friends)	C++17	100 / 100	12 ms	8196 KB

friends

#include <bits/stdc++.h>
using namespace std;
int32_t main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int n;
    cin >> n;
    if(n%2==0||n<3){
		cout << "NOT POSSIBLE";
		return 0;
	}
    string s;
    cin >> s;
    set<string> ans;
    string a="",b="";
    int mid=n/2;
    for(int i=mid+1; i<n; i++) a+=s[i];
    int p1,p2;
    for(p1=0; p1<mid; p1++){
		if(s[p1]!=a[p1]) break;
	}
	for(p2=mid; p2>0; p2--){
		if(s[p2]!=a[p2-1]) break;
	}
	if(p1>=p2) ans.insert(a);
	for(int i=0; i<mid; i++) b+=s[i];
    for(p1=mid; p1<n-1; p1++){
		if(s[p1]!=b[p1-mid]) break;
	}
	for(p2=n-1; p2>mid; p2--){
		if(s[p2]!=b[p2-1-mid]) break;
	}
	if(p1>=p2) ans.insert(b);
	if(ans.size()>1) cout << "NOT UNIQUE";
	else if(ans.size()==1) cout << *ans.begin();
	else cout << "NOT POSSIBLE";
}

Subtask #1

35.0 / 35.0

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

Subtask #2

65.0 / 65.0

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