답안 #69085 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
69085	2018-08-20T02:30:46 Z	MatheusLealV	세 명의 친구들 (BOI14_friends)	C++17	100 / 100	39 ms	9516 KB

friends

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

int n;

string s, A, B, C, D;

set< pair<string, char> > resp;

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>n;

	cin>>s;

	if(n%2 == 0)
	{
		cout<<"NOT POSSIBLE\n";

		return 0;
	}

	for(int i = 0; i < n/2; i++) A.push_back(s[i]);

	for(int i = n/2; i < n; i++) B.push_back(s[i]);

	for(int i = n/2 + 1; i < n; i++) C.push_back(s[i]);

	for(int i = 0; i < n/2 + 1; i++) D.push_back(s[i]);

	int a = (int)A.size() - 1, b = (int)B.size() - 1;

	int dif = 0, t = 0;

	while(a >= 0 and b >= 0)
	{
		if(A[a] != B[b])
		{
			t = b;

			dif ++;

			b --;
		}

		else a--, b--;
	}

	if(!dif) dif = 1;

	if(dif == 1) resp.insert({A, B[t]});

	int c = (int)C.size() - 1, d = (int)D.size() - 1;

	int dif2 = 0, t2 = 0;

	while(c >= 0 and d >= 0)
	{
		if(C[c] != D[d])
		{
			t2 = d;

			dif2 ++;

			d --;
		}

		else c--, d--;
	}

	if(!dif2) dif2 = 1;

	if(dif2 == 1) resp.insert({C, D[t2]});

	if(resp.size() == 0) cout<<"NOT POSSIBLE\n";

	else if(resp.size() == 1) cout<<(*resp.begin()).first<<"\n";

	else cout<<"NOT UNIQUE\n";
}

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

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

답안 #69085

Compilation message

Subtask #1 35.0 / 35.0

Subtask #2 65.0 / 65.0

Subtask #1
35.0 / 35.0

Subtask #2
65.0 / 65.0