답안 #359237

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
359237	2021-01-26T13:10:38 Z	Bill_00	세 명의 친구들 (BOI14_friends)	C++14	35 / 100	500 ms	5400 KB

friends

#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define M 2000001
typedef long long ll;
const int p=53;
const int MOD=1000000007;
using namespace std;
char s[M];
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	for(int i=0;i<n;++i) cin >> s[i];
	if((n&1)==0){
		cout << "NOT POSSIBLE";
		return 0;
	}
	bool t=0;
	for(int i=1;i<n/2;i++){
		if(s[i]!=s[i+n/2]){
			t=1;
			break;
		}
	}
	if(t==0 && s[0]==s[n/2] && s[0]==s[n-1] && s[0]!=s[1]){
		cout << "NOT UNIQUE";
		return 0;
	}
	string a="",x="";
	bool flag=0,f=0;
	int zuruu=n/2;
	for(int i=0;i<n/2;i++){
		if(s[i]!=s[i+zuruu]){
			if(flag==1){
				f=1;
				break;
			}
			flag=1;
			zuruu++;
			if(s[i]!=s[i+zuruu]){
				f=1;
				break;
			}
		}
		x=x+s[i];
	}
	if(f==0){
		cout << x;
		return 0;
	}
	flag=0,f=0,zuruu=n/2+1;
	for(int i=0;i<=(n/2);i++){
		if(s[i]!=s[i+zuruu]){
			if(flag==1){
				f=1;
				break;
			}
			zuruu=n/2;
			flag=1;
			i++;
			if(s[i]!=s[i+zuruu]){
				f=1;
				break;
			}
		}
		if(i>(n/2)) break;
		a=a+s[i];
	}
	if(f==0){
		cout << a;
		return 0;
	}
	cout << "NOT POSSIBLE";
}

Subtask #1

35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	1 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	1 ms	364 KB	Output is correct
45	Correct	1 ms	364 KB	Output is correct
46	Correct	1 ms	364 KB	Output is correct
47	Correct	1 ms	364 KB	Output is correct
48	Correct	1 ms	364 KB	Output is correct
49	Correct	1 ms	364 KB	Output is correct
50	Correct	1 ms	364 KB	Output is correct
51	Correct	1 ms	364 KB	Output is correct
52	Correct	1 ms	364 KB	Output is correct
53	Correct	1 ms	364 KB	Output is correct
54	Correct	1 ms	364 KB	Output is correct

Subtask #2

0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1080 ms	5400 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-