Submission #113592

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
113592	2019-05-26T13:46:15 Z	derpwaffle21	Three Friends (BOI14_friends)	C++14	0 / 100	500 ms	8512 KB

friends

#include <iostream>
#include <cstring>

using namespace std;

bool isSame(string s1, string s2)
{
	for (int i = 0; i < signed(s1.size()); i++)
	{
		if (s1[i] != s2[i])
			return false;
	}

	return true;
}

int main()
{
	int n;

	cin >> n;

	/*
	while (true)
	{
		string t;

		for (int i = 0; i < n - 1; i++)
			t += char((rand() % 26) + 65);

		cout << t << endl;
		cout << t.substr(0, int((n - 1) / 2)) << endl;
		cout << t.substr(int((n - 1) / 2), n - 1) << endl;

		cin >> t;
	}*/

	if (n % 2 == 0)
	{
		cout << "NOT POSSIBLE" << endl;
		return 0;
	}

	string s;
	string res;
	int resNum = 0;

	cin >> s;

	for (int i = 0; i < n; i++)
	{
		string t = s;

		for (int j = i; j < n; j++)
		{
			t[j] = t[j + 1];
		}

		/*
		for (int j = 0; j < n - 1; j++)
			cout << t[j];

		cout << endl;*/
		/*
		cout << t.substr(0, int((n - 1) / 2)) << endl;
		cout << t.substr(int((n - 1) / 2), n - 1) << endl;*/

		if (isSame(t.substr(0, int((n - 1) / 2)), t.substr(int((n - 1) / 2), n - 1)))
		{
			resNum++;
			res = t.substr(0, int((n - 1) / 2));
		}
	}

	if (resNum == 0)
		cout << "NOT POSSIBLE" << endl;
	else if (resNum > 1)
		cout << "NOT UNIQUE" << endl;
	else
		cout << res << endl;

	return 0;
}

Subtask #1

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	512 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	256 KB	Output is correct
27	Correct	2 ms	256 KB	Output is correct
28	Correct	2 ms	384 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	2 ms	252 KB	Output is correct
32	Correct	2 ms	256 KB	Output is correct
33	Correct	2 ms	256 KB	Output is correct
34	Correct	2 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	2 ms	384 KB	Output is correct
37	Correct	2 ms	384 KB	Output is correct
38	Correct	2 ms	384 KB	Output is correct
39	Correct	2 ms	384 KB	Output is correct
40	Correct	2 ms	384 KB	Output is correct
41	Correct	2 ms	384 KB	Output is correct
42	Correct	2 ms	384 KB	Output is correct
43	Correct	2 ms	384 KB	Output is correct
44	Correct	5 ms	512 KB	Output is correct
45	Correct	4 ms	384 KB	Output is correct
46	Correct	4 ms	384 KB	Output is correct
47	Correct	4 ms	384 KB	Output is correct
48	Correct	4 ms	256 KB	Output is correct
49	Correct	2 ms	384 KB	Output is correct
50	Incorrect	5 ms	384 KB	Output isn't correct
51	Halted	0 ms	0 KB	-

Subtask #2

0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1081 ms	8512 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-