oj.uz

답안 #127515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
127515 2019-07-09T13:31:34 Z TadijaSebez 세 명의 친구들 (BOI14_friends) C++11
100 / 100
 60 ms 5240 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=2000050;
char s[N];
int main()
{
	int n,A=0,B=0,C=0,D=0;
	scanf("%i",&n);
	scanf("%s",s+1);
	if(n%2==0) return 0*printf("NOT POSSIBLE\n");
	int x=(n+1)/2,y=x+1,z=x-1;
	while(s[A+1]==s[A+x]) A++;
	while(s[B+1]==s[B+y]) B++;
	while(s[n-C]==s[x-C]) C++;
	while(s[n-D]==s[z-D]) D++;
	//printf("%i %i %i %i\n",A,B,C,D);
	vector<int> ans;
	int hal=n/2;
	if(B>=hal)
	{
		ans.pb(x);
	}
	else
	{
		if(B+C>=hal) ans.pb(1);
		if(A+D>=hal) ans.pb(n);
		/*for(int i=1;i<x;i++)
		{
			if(B>=i-1 && C>=x-i){ ans.pb(i);break;}
		}
		for(int i=x+1;i<=n;i++)
		{
			if(A>=i-x && D>=n-i){ ans.pb(i);break;}
		}*/
	}
	if(ans.empty()) printf("NOT POSSIBLE\n");
	else if(ans.size()>1) printf("NOT UNIQUE\n");
	else
	{
		//printf("%i\n",ans[0]);
		if(ans[0]<=x) for(int i=x+1;i<=n;i++) printf("%c",s[i]);
		else for(int i=1;i<x;i++) printf("%c",s[i]);
		printf("\n");
	}
	return 0;
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
friends.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s+1);
  ~~~~~^~~~~~~~~~

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 3244 KB Output is correct
2 Correct 58 ms 3232 KB Output is correct
3 Correct 59 ms 3236 KB Output is correct
4 Correct 57 ms 3320 KB Output is correct
5 Correct 57 ms 3192 KB Output is correct
6 Correct 10 ms 2296 KB Output is correct
7 Correct 60 ms 5240 KB Output is correct
8 Correct 11 ms 3832 KB Output is correct
9 Correct 53 ms 4728 KB Output is correct
10 Correct 56 ms 4728 KB Output is correct
11 Correct 9 ms 3576 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 436 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 252 KB Output is correct
38 Correct 2 ms 380 KB Output is correct
39 Correct 2 ms 256 KB Output is correct
40 Correct 2 ms 256 KB Output is correct
41 Correct 2 ms 256 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 2 ms 256 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 256 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 256 KB Output is correct
48 Correct 2 ms 252 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 256 KB Output is correct