Submission #62449

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
62449	2018-07-28T13:45:45 Z	RezwanArefin01	Three Friends (BOI14_friends)	C++17	100 / 100	136 ms	24524 KB

friends

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

typedef long long ll;
typedef pair<int, int> ii; 

string s; 
set<string> st; 

void match(int l1, int r1, int l2, int r2) {
	bool flag = 0; string x = ""; 
	while(l1 <= r1) {
		if(s[l1] != s[l2]) {
			if(flag) return; 
			flag = 1; --l1; 
		} else x += s[l1];  
		++l1, ++l2; 
	} 
	if(flag || (l2 <= r2 && !flag)) 
		st.insert(x); 
}
int main(int argc, char const *argv[]) {
	int n; cin >> n >> s; 
	if(~n & 1) return 0*puts("NOT POSSIBLE");
	int x = n >> 1; 
	match(0, x - 1, x, n - 1);
	match(x + 1, n - 1, 0, x); 

	if(!st.size()) puts("NOT POSSIBLE"); 
	else if(st.size() > 1) puts("NOT UNIQUE"); 
	else cout << *st.begin() << endl; 
}

Subtask #1

35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	476 KB	Output is correct
2	Correct	4 ms	624 KB	Output is correct
3	Correct	3 ms	624 KB	Output is correct
4	Correct	3 ms	624 KB	Output is correct
5	Correct	2 ms	624 KB	Output is correct
6	Correct	4 ms	624 KB	Output is correct
7	Correct	2 ms	684 KB	Output is correct
8	Correct	3 ms	684 KB	Output is correct
9	Correct	3 ms	684 KB	Output is correct
10	Correct	4 ms	684 KB	Output is correct
11	Correct	3 ms	684 KB	Output is correct
12	Correct	2 ms	684 KB	Output is correct
13	Correct	3 ms	684 KB	Output is correct
14	Correct	3 ms	740 KB	Output is correct
15	Correct	2 ms	744 KB	Output is correct
16	Correct	3 ms	744 KB	Output is correct
17	Correct	2 ms	744 KB	Output is correct
18	Correct	3 ms	744 KB	Output is correct
19	Correct	3 ms	744 KB	Output is correct
20	Correct	3 ms	744 KB	Output is correct
21	Correct	2 ms	744 KB	Output is correct
22	Correct	2 ms	744 KB	Output is correct
23	Correct	3 ms	744 KB	Output is correct
24	Correct	2 ms	744 KB	Output is correct
25	Correct	2 ms	744 KB	Output is correct
26	Correct	2 ms	744 KB	Output is correct
27	Correct	4 ms	744 KB	Output is correct
28	Correct	2 ms	744 KB	Output is correct
29	Correct	3 ms	832 KB	Output is correct
30	Correct	4 ms	832 KB	Output is correct
31	Correct	3 ms	832 KB	Output is correct
32	Correct	3 ms	832 KB	Output is correct
33	Correct	2 ms	832 KB	Output is correct
34	Correct	2 ms	832 KB	Output is correct
35	Correct	2 ms	832 KB	Output is correct
36	Correct	3 ms	832 KB	Output is correct
37	Correct	3 ms	832 KB	Output is correct
38	Correct	3 ms	832 KB	Output is correct
39	Correct	3 ms	832 KB	Output is correct
40	Correct	3 ms	832 KB	Output is correct
41	Correct	2 ms	832 KB	Output is correct
42	Correct	3 ms	884 KB	Output is correct
43	Correct	3 ms	884 KB	Output is correct
44	Correct	2 ms	908 KB	Output is correct
45	Correct	2 ms	908 KB	Output is correct
46	Correct	4 ms	908 KB	Output is correct
47	Correct	2 ms	920 KB	Output is correct
48	Correct	4 ms	920 KB	Output is correct
49	Correct	3 ms	1052 KB	Output is correct
50	Correct	4 ms	1052 KB	Output is correct
51	Correct	3 ms	1052 KB	Output is correct
52	Correct	2 ms	1052 KB	Output is correct
53	Correct	3 ms	1052 KB	Output is correct
54	Correct	3 ms	1052 KB	Output is correct

Subtask #2

65.0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	106 ms	8796 KB	Output is correct
2	Correct	99 ms	10744 KB	Output is correct
3	Correct	92 ms	12804 KB	Output is correct
4	Correct	91 ms	14756 KB	Output is correct
5	Correct	102 ms	16624 KB	Output is correct
6	Correct	136 ms	16648 KB	Output is correct
7	Correct	102 ms	20476 KB	Output is correct
8	Correct	101 ms	21004 KB	Output is correct
9	Correct	100 ms	22856 KB	Output is correct
10	Correct	113 ms	24524 KB	Output is correct
11	Correct	68 ms	24524 KB	Output is correct
12	Correct	3 ms	24524 KB	Output is correct
13	Correct	2 ms	24524 KB	Output is correct
14	Correct	4 ms	24524 KB	Output is correct
15	Correct	2 ms	24524 KB	Output is correct
16	Correct	3 ms	24524 KB	Output is correct
17	Correct	3 ms	24524 KB	Output is correct
18	Correct	4 ms	24524 KB	Output is correct
19	Correct	3 ms	24524 KB	Output is correct
20	Correct	3 ms	24524 KB	Output is correct
21	Correct	4 ms	24524 KB	Output is correct
22	Correct	2 ms	24524 KB	Output is correct
23	Correct	3 ms	24524 KB	Output is correct
24	Correct	2 ms	24524 KB	Output is correct
25	Correct	2 ms	24524 KB	Output is correct
26	Correct	2 ms	24524 KB	Output is correct
27	Correct	2 ms	24524 KB	Output is correct
28	Correct	3 ms	24524 KB	Output is correct
29	Correct	3 ms	24524 KB	Output is correct
30	Correct	4 ms	24524 KB	Output is correct
31	Correct	2 ms	24524 KB	Output is correct
32	Correct	3 ms	24524 KB	Output is correct
33	Correct	3 ms	24524 KB	Output is correct
34	Correct	2 ms	24524 KB	Output is correct
35	Correct	3 ms	24524 KB	Output is correct
36	Correct	2 ms	24524 KB	Output is correct
37	Correct	3 ms	24524 KB	Output is correct
38	Correct	3 ms	24524 KB	Output is correct
39	Correct	3 ms	24524 KB	Output is correct
40	Correct	3 ms	24524 KB	Output is correct
41	Correct	3 ms	24524 KB	Output is correct
42	Correct	3 ms	24524 KB	Output is correct
43	Correct	3 ms	24524 KB	Output is correct
44	Correct	3 ms	24524 KB	Output is correct
45	Correct	2 ms	24524 KB	Output is correct
46	Correct	3 ms	24524 KB	Output is correct
47	Correct	3 ms	24524 KB	Output is correct
48	Correct	3 ms	24524 KB	Output is correct
49	Correct	2 ms	24524 KB	Output is correct
50	Correct	3 ms	24524 KB	Output is correct
51	Correct	4 ms	24524 KB	Output is correct
52	Correct	3 ms	24524 KB	Output is correct
53	Correct	3 ms	24524 KB	Output is correct
54	Correct	3 ms	24524 KB	Output is correct