Submission #203290

# Submission time Handle Problem Language Result Execution time Memory
203290 2020-02-20T06:41:18 Z blacktulip Three Friends (BOI14_friends) C++17
100 / 100
39 ms 7576 KB
#include <bits/stdc++.h>
 
using namespace std;
 
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
 
int n,m,b[200005],a[200005],k,flag,t,mpp[50],one,cev;
char c;
string s,ss,yaz,s1,s2;
vector<int> v;
 
int main(void){
	fio();
	cin>>n>>s;
	if(n%2==0){cout<<"NOT POSSIBLE\n";return 0;}
	for(int i=0;i<n;i++){
		mpp[s[i]-'A']++;
	}
	for(int i=0;i<=25;i++){
		if(mpp[i]%2){
			cev++;
			c=i+'A';
		}
	}
	for(int i=0;i<n/2;i++)s1+=s[i];
	for(int i=n/2+1;i<n;i++)s2+=s[i];
	if(cev!=1){cout<<"NOT POSSIBLE\n";return 0;}
	int bas=0;
	int son=n/2;
	cev=0;
	while(son<n){
		if(s[bas]!=s[son] && s[son]==c && flag==0){
			son++;
			flag=1;
		}
		else if(s[bas]!=s[son]){flag=2;break;}
		else{bas++;son++;}
	}
	if(flag!=2){
		cev++;
		one=1;
	}
	flag=0;
	bas=n/2;
	son=n-1;
	if(s1!=s2){
		while(bas>=0){
			//~ cout<<s[bas]<<" ;; "<<s[son]<<endl;
			if(s[bas]!=s[son] && s[bas]==c && flag==0){
				bas--;
				flag=1;
			}
			else if(s[bas]!=s[son]){flag=2;break;}
			else{bas--;son--;}
		}
		if(flag!=2)cev++;
	}
	
	if(cev==2){cout<<"NOT UNIQUE\n";return 0;}
	if(cev==0){cout<<"NOT POSSIBLE\n";return 0;}
	if(one==1){
		cout<<s1<<endl;
		return 0;
	}
	cout<<s2<<endl;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 380 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 280 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 6 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 5 ms 380 KB Output is correct
40 Correct 5 ms 376 KB Output is correct
41 Correct 5 ms 376 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 5 ms 376 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 376 KB Output is correct
46 Correct 5 ms 376 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 4 ms 376 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 5 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 36 ms 6164 KB Output is correct
2 Correct 37 ms 6168 KB Output is correct
3 Correct 39 ms 6212 KB Output is correct
4 Correct 35 ms 6160 KB Output is correct
5 Correct 35 ms 6164 KB Output is correct
6 Correct 9 ms 2452 KB Output is correct
7 Correct 36 ms 6164 KB Output is correct
8 Correct 32 ms 6552 KB Output is correct
9 Correct 32 ms 7448 KB Output is correct
10 Correct 33 ms 7576 KB Output is correct
11 Correct 28 ms 6168 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 380 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 5 ms 372 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 5 ms 376 KB Output is correct
41 Correct 5 ms 376 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 5 ms 376 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 376 KB Output is correct
46 Correct 5 ms 376 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 5 ms 380 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 380 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 248 KB Output is correct
54 Correct 4 ms 376 KB Output is correct