Submission #930637

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
930637	2024-02-20T08:38:35 Z	zyq181	Three Friends (BOI14_friends)	C++17	100 / 100	39 ms	4764 KB

friends

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

int N;
char c;
char ok[2000010];
int pt;
bool ans1, ans2;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	if(!(N%2)){
		cout << "NOT POSSIBLE";
		return 0;
	}
	int k = N/2;
	for(int a=1; a<=N; a++){
		cin >> ok[a];
	}
	ans1 = ans2 = true;
	pt = k+1;
	for(int a=1; a<=k; a++){
		while(pt != N+1 && ok[pt] != ok[a]) {
			pt++;
		}
		if(pt == N+1){
			ans1 = false;
			break;
		}
		pt++;
	}
	pt = 1;
	for(int a=k+2; a<=N; a++){
		while(pt != k+2 && ok[pt] != ok[a]) {
			pt++;
		}
		if(pt == k+2){
			ans2 = false;
			break;
		}
		pt++;
	}
	if(ans1 && ans2){
		for(int a=1; a<=k; a++){
			if(ok[a] != ok[a+k+1]){
				cout << "NOT UNIQUE";
				return 0;
			}
		}
		for(int a=1; a<=k; a++){
			cout << ok[a];
		}
	}
	else if(ans1){
		for(int a=1; a<=k; a++){
			cout << ok[a];
		}
	}
	else if(ans2){
		for(int a=k+2; a<=N; a++){
			cout << ok[a];
		}
	}
	else{
		cout << "NOT POSSIBLE";
	}
}

Subtask #1

35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	600 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 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	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	344 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	344 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	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	0 ms	344 KB	Output is correct
39	Correct	1 ms	600 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	1 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	344 KB	Output is correct
47	Correct	1 ms	344 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	1 ms	600 KB	Output is correct
53	Correct	0 ms	464 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct

Subtask #2

65.0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	39 ms	3152 KB	Output is correct
2	Correct	36 ms	3152 KB	Output is correct
3	Correct	36 ms	3368 KB	Output is correct
4	Correct	37 ms	3508 KB	Output is correct
5	Correct	36 ms	3304 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	36 ms	3324 KB	Output is correct
8	Correct	18 ms	3876 KB	Output is correct
9	Correct	33 ms	4728 KB	Output is correct
10	Correct	33 ms	4764 KB	Output is correct
11	Correct	19 ms	3740 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 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	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	348 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 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	0 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	600 KB	Output is correct
33	Correct	0 ms	464 KB	Output is correct
34	Correct	0 ms	344 KB	Output is correct
35	Correct	0 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	1 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	1 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	344 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	344 KB	Output is correct
49	Correct	0 ms	600 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct