Submission #742006

# Submission time Handle Problem Language Result Execution time Memory
742006 2023-05-15T10:51:32 Z MODDI Three Friends (BOI14_friends) C++14
100 / 100
53 ms 6164 KB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
int n;
string str;
int main(){
	cin>>n>>str;
	string one, two;
	int i, t;
	if(n%2 == 0){
		cout<<"NOT POSSIBLE"<<endl;
		return 0;
	}
	for(i = 0; i < n/2; i++)
		if(str[i] != str[i+n/2])	break;
	t = i;
	for(i = n/2-1; i>= 0; i--)
		if(str[i] != str[i+n/2+1])	break;
	
	int flag;
	if(t > i)	flag = 1;
	else flag = 0;
	for(i = 0; i < n/2+1; i++)
		if(str[i] != str[i+n/2+1])	break;
	t = i;
	for(i = n/2; i >= 0; i--)
		if(str[i] != str[i+n/2])	break;
	if(t >= i){
		if(flag){
			for(i = 0; i < n/2; i++)
				if(str[i] != str[i+n/2+1])	break;
				
			if(i == n/2){
				string out;
				for(i = 0; i < n/2; i++) out.pb(str[i]);
				
				cout<<out<<endl;
			}
			else
				cout<<"NOT UNIQUE"<<endl;
		}
		else{
			string out;
			for(i = 0; i <n/2; i++)	out.pb(str[i+n/2+1]);
			cout<<out<<endl;
		}
	}
	else{
		if(flag){
			string out;
				for(i = 0; i < n/2; i++) out.pb(str[i]);
				
				cout<<out<<endl;
		}
		else
			cout<<"NOT POSSIBLE"<<endl;
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 50 ms 6072 KB Output is correct
2 Correct 48 ms 6052 KB Output is correct
3 Correct 47 ms 6064 KB Output is correct
4 Correct 46 ms 6076 KB Output is correct
5 Correct 47 ms 6156 KB Output is correct
6 Correct 41 ms 4196 KB Output is correct
7 Correct 53 ms 6164 KB Output is correct
8 Correct 36 ms 2316 KB Output is correct
9 Correct 44 ms 4740 KB Output is correct
10 Correct 41 ms 4784 KB Output is correct
11 Correct 35 ms 2244 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 304 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 304 KB Output is correct
30 Correct 0 ms 304 KB Output is correct
31 Correct 1 ms 304 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 304 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct