oj.uz

답안 #116763

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116763 2019-06-13T17:55:23 Z roseanne_pcy 세 명의 친구들 (BOI14_friends) C++14
100 / 100
 51 ms 5368 KB 
#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector< ii > vii;
typedef long long L;
typedef vector< L > vL;
typedef vector< vL > vvL;
typedef vector< vi > vvi;
typedef vector< vii > vvii;
const int inf = 1e9;
const L inf8 = 1e18;
const int maxn = 2e6 + 5;
const int md = 1e9 + 7;
void np()
{
	puts("NOT POSSIBLE"); exit(0);
}
void nu()
{
	puts("NOT UNIQUE"); exit(0);
}
char s[maxn];
int main()
{
	int n; scanf("%d", &n);
	scanf("%s", s);
	if(n%2 == 0 || n<= 2) np();
	int a = 0, b = 0;
	int skipped = 0;
	int ptr = n/2;
	bool bad = 0;
	for(int i = 0; i< n/2; i++)
	{
		if(s[i] == s[ptr]) ptr++;
		else if(!skipped)
		{
			skipped = 1;
			i--;
			ptr++;
		}
		else
		{
			bad = 1;
			break;
		}
	}
	if(!bad) a = 1;
	skipped = 0; bad = 0; ptr = 0;
	for(int i = n/2+1; i< n; i++)
	{
		if(s[i] == s[ptr]) ptr++;
		else if(!skipped)
		{
			skipped = 1;
			i--;
			ptr++;
		}
		else
		{
			bad = 1; break;
		}
	}
	bool same = 1;
	for(int i = 0; i< n/2; i++) if(s[i] != s[n/2+i+1]) same = 0;
	if(!bad) b = 1;
	if(a&&b && !same) nu();
	if(a+b == 0) np();
	if(a) for(int i = 0; i< n/2; i++) printf("%c", s[i]);
	else for(int i = n/2+1; i< n; i++) printf("%c", s[i]);
	return 0;
}

Compilation message

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

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 5368 KB Output is correct
2 Correct 48 ms 5240 KB Output is correct
3 Correct 49 ms 5212 KB Output is correct
4 Correct 49 ms 5240 KB Output is correct
5 Correct 49 ms 5168 KB Output is correct
6 Correct 9 ms 4224 KB Output is correct
7 Correct 51 ms 5240 KB Output is correct
8 Correct 11 ms 3840 KB Output is correct
9 Correct 44 ms 4728 KB Output is correct
10 Correct 44 ms 4712 KB Output is correct
11 Correct 9 ms 3584 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 384 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 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 2 ms 356 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 2 ms 256 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 2 ms 384 KB Output is correct
43 Correct 2 ms 384 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 384 KB Output is correct
47 Correct 2 ms 256 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 2 ms 256 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 2 ms 256 KB Output is correct