답안 #399535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
399535	2021-05-06T02:28:40 Z	Temmie	A Difficult(y) Choice (BOI21_books)	C++17	45 / 100	2 ms	1096 KB

books

#include "books.h"
#include <bits/stdc++.h>

typedef long long ll;

void solve(int n, int k, ll a, int s) {
	
	std::vector <ll> vals(n + 1, -1);
	ll sumfirst = 0;
	for (int i = 1; i <= k - 1; i++) {
		vals[i] = skim(i);
		sumfirst += vals[i];
	}
	int l = k + 1, r = n;
	int best = k;
	while (l <= r) {
		int mid = (l + r) >> 1;
		ll now = skim(mid);
		vals[mid] = now;
		ll total = now + sumfirst;
		if (total >= a + a) {
			r = mid - 1;
		} else {
			l = mid + 1;
			best = mid;
		}
	}
	if (best == k && sumfirst + vals[best] > a + a) {
		impossible();
		return;
	}
	if (sumfirst + vals[best] >= a) {
		std::vector <int> ans;
		for (int i = 1; i <= k - 1; i++) ans.push_back(i);
		ans.push_back(best);
		answer(ans);
		return;
	}
	std::vector <int> ans;
	for (int i = 1; i <= k - 1; i++) ans.push_back(i);
	ans.push_back(best);
	std::set <int> have;
	for (int x : ans) have.insert(x);
	ll sum = sumfirst + vals[best];
	int cur = best;
	for (int i = 1 - 1; i <= k - 1 - 1; i++) {
		sum -= vals[ans[i]];
		have.erase(ans[i]);
		int nw = --cur;
		if (have.count(nw)) {
			impossible();
			return;
		}
		have.insert(nw);
		if (vals[nw] == -1LL) vals[nw] = skim(nw);
		sum += vals[nw];
		if (sum >= a) break;
	}
	std::vector <int> put;
	for (int x : have) put.push_back(x);
	answer(put);
	
}

Subtask #1
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	200 KB	Output is correct
2	Correct	1 ms	200 KB	Output is correct
3	Correct	1 ms	200 KB	Output is correct
4	Correct	1 ms	200 KB	Output is correct
5	Incorrect	1 ms	200 KB	Incorrect
6	Halted	0 ms	0 KB	-

Subtask #2
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	200 KB	Output is correct
2	Correct	1 ms	200 KB	Output is correct
3	Correct	1 ms	200 KB	Output is correct
4	Correct	1 ms	200 KB	Output is correct
5	Incorrect	1 ms	200 KB	Incorrect
6	Halted	0 ms	0 KB	-

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	968 KB	Output is correct
2	Correct	2 ms	968 KB	Output is correct
3	Correct	2 ms	968 KB	Output is correct
4	Correct	2 ms	972 KB	Output is correct
5	Correct	1 ms	968 KB	Output is correct
6	Correct	1 ms	968 KB	Output is correct
7	Correct	1 ms	968 KB	Output is correct
8	Correct	2 ms	968 KB	Output is correct
9	Correct	2 ms	968 KB	Output is correct

Subtask #4
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	968 KB	Output is correct
2	Correct	2 ms	968 KB	Output is correct
3	Correct	2 ms	968 KB	Output is correct
4	Correct	2 ms	972 KB	Output is correct
5	Correct	1 ms	968 KB	Output is correct
6	Correct	1 ms	968 KB	Output is correct
7	Correct	1 ms	968 KB	Output is correct
8	Correct	2 ms	968 KB	Output is correct
9	Correct	2 ms	968 KB	Output is correct
10	Correct	1 ms	968 KB	Output is correct
11	Correct	1 ms	968 KB	Output is correct
12	Correct	2 ms	968 KB	Output is correct
13	Correct	2 ms	968 KB	Output is correct
14	Correct	1 ms	968 KB	Output is correct
15	Correct	1 ms	968 KB	Output is correct
16	Correct	1 ms	968 KB	Output is correct
17	Correct	2 ms	968 KB	Output is correct
18	Correct	1 ms	968 KB	Output is correct
19	Correct	2 ms	968 KB	Output is correct
20	Correct	2 ms	968 KB	Output is correct
21	Correct	1 ms	968 KB	Output is correct
22	Correct	1 ms	968 KB	Output is correct
23	Correct	1 ms	968 KB	Output is correct
24	Correct	1 ms	968 KB	Output is correct
25	Correct	2 ms	1016 KB	Output is correct

Subtask #5
0 / 15.0

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

Subtask #6
20.0 / 20.0

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

Subtask #7
0 / 20.0

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

답안 #399535

Compilation message

Subtask #1 0 / 5.0

Subtask #2 0 / 15.0

Subtask #3 10.0 / 10.0

Subtask #4 15.0 / 15.0

Subtask #5 0 / 15.0

Subtask #6 20.0 / 20.0

Subtask #7 0 / 20.0

Subtask #1
0 / 5.0

Subtask #2
0 / 15.0

Subtask #3
10.0 / 10.0

Subtask #4
15.0 / 15.0

Subtask #5
0 / 15.0

Subtask #6
20.0 / 20.0

Subtask #7
0 / 20.0