Submission #21848

# Submission time Handle Problem Language Result Execution time Memory
21848 2017-04-26T10:58:19 Z iletavcioski Three Friends (BOI14_friends) C++
100 / 100
89 ms 13144 KB
#include<iostream>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	cin>>n;
	if(n%2==0||n==1)
	{
		cout<<"NOT POSSIBLE"<<endl;
		return 0;
	}
	string ss;
	cin>>ss;
	int j=ss.size()/2;
	set<string> s;
	int i=0;
	string s1="";
	string s2;
	while(i<ss.size()/2&&j<ss.size())
	{
		if(ss[i]==ss[j])
		{
			s1+=ss[i];
			j++,i++;
		}
		else
			j++;
		if(s1.size()==ss.size()/2)
		{
			s.insert(s1);
			break;
		}

	}
	 i=ss.size()-1;
	 j=ss.size()/2;
	while(i>=0&&j>=0)
	{
		if(ss[i]==ss[j])
		{
			s2+=ss[i];
			j--,i--;
		}
		else
			j--;
		if(s2.size()==ss.size()/2)
		{
			reverse(s2.begin(),s2.end());
			s.insert(s2);
			break;
		}

	}
	if(s.size()==1)
		cout<<*s.begin()<<endl;
	else if(s.size()==0)
		cout<<"NOT POSSIBLE"<<endl;
	else
		cout<<"NOT UNIQUE"<<endl;
    return 0;
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:24:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(i<ss.size()/2&&j<ss.size())
         ^
friends.cpp:24:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(i<ss.size()/2&&j<ss.size())
                        ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2024 KB Output is correct
2 Correct 0 ms 2024 KB Output is correct
3 Correct 0 ms 2024 KB Output is correct
4 Correct 0 ms 2024 KB Output is correct
5 Correct 0 ms 2024 KB Output is correct
6 Correct 0 ms 2024 KB Output is correct
7 Correct 0 ms 2024 KB Output is correct
8 Correct 0 ms 2024 KB Output is correct
9 Correct 0 ms 2024 KB Output is correct
10 Correct 0 ms 2024 KB Output is correct
11 Correct 0 ms 2024 KB Output is correct
12 Correct 0 ms 2024 KB Output is correct
13 Correct 0 ms 2024 KB Output is correct
14 Correct 0 ms 2024 KB Output is correct
15 Correct 0 ms 2024 KB Output is correct
16 Correct 0 ms 2024 KB Output is correct
17 Correct 0 ms 2024 KB Output is correct
18 Correct 0 ms 2024 KB Output is correct
19 Correct 0 ms 2024 KB Output is correct
20 Correct 0 ms 2024 KB Output is correct
21 Correct 0 ms 2024 KB Output is correct
22 Correct 0 ms 2024 KB Output is correct
23 Correct 0 ms 2024 KB Output is correct
24 Correct 0 ms 2024 KB Output is correct
25 Correct 0 ms 2024 KB Output is correct
26 Correct 0 ms 2024 KB Output is correct
27 Correct 0 ms 2024 KB Output is correct
28 Correct 0 ms 2024 KB Output is correct
29 Correct 0 ms 2024 KB Output is correct
30 Correct 0 ms 2024 KB Output is correct
31 Correct 0 ms 2024 KB Output is correct
32 Correct 0 ms 2024 KB Output is correct
33 Correct 0 ms 2024 KB Output is correct
34 Correct 0 ms 2024 KB Output is correct
35 Correct 0 ms 2024 KB Output is correct
36 Correct 0 ms 2024 KB Output is correct
37 Correct 0 ms 2024 KB Output is correct
38 Correct 0 ms 2024 KB Output is correct
39 Correct 0 ms 2024 KB Output is correct
40 Correct 0 ms 2024 KB Output is correct
41 Correct 0 ms 2024 KB Output is correct
42 Correct 0 ms 2024 KB Output is correct
43 Correct 0 ms 2024 KB Output is correct
44 Correct 0 ms 2024 KB Output is correct
45 Correct 0 ms 2024 KB Output is correct
46 Correct 0 ms 2024 KB Output is correct
47 Correct 0 ms 2024 KB Output is correct
48 Correct 0 ms 2024 KB Output is correct
49 Correct 0 ms 2024 KB Output is correct
50 Correct 0 ms 2024 KB Output is correct
51 Correct 0 ms 2024 KB Output is correct
52 Correct 0 ms 2024 KB Output is correct
53 Correct 0 ms 2024 KB Output is correct
54 Correct 0 ms 2024 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 89 ms 11720 KB Output is correct
2 Correct 69 ms 10024 KB Output is correct
3 Correct 79 ms 9904 KB Output is correct
4 Correct 83 ms 10264 KB Output is correct
5 Correct 86 ms 10264 KB Output is correct
6 Correct 0 ms 2024 KB Output is correct
7 Correct 73 ms 13144 KB Output is correct
8 Correct 69 ms 7804 KB Output is correct
9 Correct 66 ms 7804 KB Output is correct
10 Correct 73 ms 6904 KB Output is correct
11 Correct 66 ms 6904 KB Output is correct
12 Correct 0 ms 2024 KB Output is correct
13 Correct 0 ms 2024 KB Output is correct
14 Correct 0 ms 2024 KB Output is correct
15 Correct 0 ms 2024 KB Output is correct
16 Correct 0 ms 2024 KB Output is correct
17 Correct 0 ms 2024 KB Output is correct
18 Correct 0 ms 2024 KB Output is correct
19 Correct 0 ms 2024 KB Output is correct
20 Correct 0 ms 2024 KB Output is correct
21 Correct 0 ms 2024 KB Output is correct
22 Correct 0 ms 2024 KB Output is correct
23 Correct 0 ms 2024 KB Output is correct
24 Correct 0 ms 2024 KB Output is correct
25 Correct 0 ms 2024 KB Output is correct
26 Correct 0 ms 2024 KB Output is correct
27 Correct 0 ms 2024 KB Output is correct
28 Correct 0 ms 2024 KB Output is correct
29 Correct 0 ms 2024 KB Output is correct
30 Correct 0 ms 2024 KB Output is correct
31 Correct 0 ms 2024 KB Output is correct
32 Correct 0 ms 2024 KB Output is correct
33 Correct 0 ms 2024 KB Output is correct
34 Correct 0 ms 2024 KB Output is correct
35 Correct 0 ms 2024 KB Output is correct
36 Correct 0 ms 2024 KB Output is correct
37 Correct 0 ms 2024 KB Output is correct
38 Correct 0 ms 2024 KB Output is correct
39 Correct 0 ms 2024 KB Output is correct
40 Correct 0 ms 2024 KB Output is correct
41 Correct 0 ms 2024 KB Output is correct
42 Correct 0 ms 2024 KB Output is correct
43 Correct 0 ms 2024 KB Output is correct
44 Correct 0 ms 2024 KB Output is correct
45 Correct 0 ms 2024 KB Output is correct
46 Correct 0 ms 2024 KB Output is correct
47 Correct 0 ms 2024 KB Output is correct
48 Correct 0 ms 2024 KB Output is correct
49 Correct 0 ms 2024 KB Output is correct
50 Correct 0 ms 2024 KB Output is correct
51 Correct 0 ms 2024 KB Output is correct
52 Correct 0 ms 2024 KB Output is correct
53 Correct 0 ms 2024 KB Output is correct
54 Correct 0 ms 2024 KB Output is correct