oj.uz

Submission #105632

# Submission time Handle Problem Language Result Execution time Memory
105632 2019-04-13T18:46:32 Z pamaj Three Friends (BOI14_friends) C++14
35 / 100
 500 ms 8188 KB 
#include <bits/stdc++.h>
using namespace std;

int main()
{
	int n;
	
	cin >> n;
	
	string s;
	
	cin >> s;

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

	else
	{
		int cnt[30];
		memset(cnt, 0, sizeof(cnt));

		int sz = n/2;

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

			cnt[s[i] - 'A']++;
		}

		int lt = -1;

		for(int i = 0; i < 26; i++)
		{
			if(cnt[i]%2)
			{
				if(lt == -1) lt = i;
				else
				{
					cout << "NOT POSSIBLE\n";
					return 0;
				}
			}
		}
		//cout << lt << "\n";
		if(lt == -1)
		{
			cout << "NOT POSSIBLE\n";
			return 0;	
		}

		string temp;
		bool already = false;

		for(int i = 0; i < s.size(); i++)
		{
			if(s[i] - 'A' == lt)
			{
				string tmp;
				string pass;
				bool ok = true;

				for(int j = 0; j < n; j++)
				{
					if(j == i) continue;

					tmp += s[j];
				}
				for(int j = 0; j < sz; j++)
				{
					if(tmp[j] == tmp[j + sz])
					{
						pass += tmp[j];
					}
					else ok = false;
				}
				if(ok)
				{
					if(already)
					{
						bool eh = true;

						for(int i = 0; i < temp.size(); i++)
						{
							if(temp[i] != pass[i]) eh = false;
						}

						if(!eh)
						{
							cout << "NOT UNIQUE\n";
							return 0;
						}
						
					}
					else temp = pass, already = true;
				}
			}
		
		}

		if(already) cout << temp << "\n";
		else cout << "NOT POSSIBLE\n";
	}
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:53:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < s.size(); i++)
                  ~~^~~~~~~~~~
friends.cpp:81:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 0; i < temp.size(); i++)
                      ~~^~~~~~~~~~~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 256 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 276 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 428 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 3 ms 356 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 3 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 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 256 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 256 KB Output is correct
40 Correct 3 ms 384 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 2 ms 256 KB Output is correct
44 Correct 3 ms 256 KB Output is correct
45 Correct 3 ms 256 KB Output is correct
46 Correct 3 ms 384 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 3 ms 256 KB Output is correct
50 Correct 30 ms 384 KB Output is correct
51 Correct 8 ms 256 KB Output is correct
52 Correct 7 ms 256 KB Output is correct
53 Correct 11 ms 256 KB Output is correct
54 Correct 7 ms 256 KB Output is correct

Subtask #2
0 / 65.0

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