답안 #58761 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58761	2018-07-19T09:03:27 Z	Sherazin	세 명의 친구들 (BOI14_friends)	C++14	100 / 100	186 ms	50676 KB

friends

#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 2e6 + 5;

pii add(pii a, pii b) { return pii(a.x + b.x, a.y + b.y); }
pii sub(pii a, pii b) { return pii(a.x - b.x, a.y - b.y); }
pii mul(pii a, pii b) { return pii(a.x * b.x, a.y * b.y); }

pii prm(69, 1337);
pii pwr[N];

int n, mid;
pii dp[N];
char A[N];
map<pii, pii> ans;

int main() {
	pwr[0] = pii(1, 1);
	for(int i = 1; i < N; i++) pwr[i] = mul(pwr[i - 1], prm);

	scanf("%d", &n);
	if(!(n & 1)) return !printf("NOT POSSIBLE");
	mid = n >> 1;
	scanf("%s", A + 1);

	for(int i = 1; i <= n; i++) dp[i] = add(mul(dp[i - 1], prm), pii(A[i], A[i]));
	for(int i = 1; i <= n; i++) {
		pii lhs, rhs;
		if(i <= mid) {
			lhs = add(mul(dp[i - 1], pwr[mid - i + 1]), sub(dp[mid + 1], mul(dp[i], pwr[mid - i + 1])));
			rhs = sub(dp[n], mul(dp[mid + 1], pwr[mid]));
			if(lhs == rhs && !ans.count(lhs)) ans[lhs] = pii(mid + 2, n);
		} else {
			lhs = dp[mid];
			rhs = add(mul(sub(dp[i - 1], mul(dp[mid], pwr[i - mid - 1])), pwr[n - i]), sub(dp[n], mul(dp[i], pwr[n - i])));
			if(lhs == rhs && !ans.count(lhs)) ans[lhs] = pii(1, mid);
		}
	}

	if(!ans.size()) return !printf("NOT POSSIBLE");
	else if(ans.size() == 1) for(int i = ans.begin()->y.x; i <= ans.begin()->y.y; i++) printf("%c", A[i]);
	else if(ans.size() > 1) return !printf("NOT UNIQUE");

	return 0;
}

Compilation message

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

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

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

답안 #58761

Compilation message

Subtask #1 35.0 / 35.0

Subtask #2 65.0 / 65.0

Subtask #1
35.0 / 35.0

Subtask #2
65.0 / 65.0