oj.uz

Submission #724712

# Submission time Handle Problem Language Result Execution time Memory
724712 2023-04-15T18:13:02 Z gagik_2007 A Difficult(y) Choice (BOI21_books) C++17
100 / 100
 248 ms 1080 KB 
#include "books.h"
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <limits>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef ll itn;

#define ff first
#define ss second

const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 32768;
const ll NNN = 100007;
ll n, k, a, s;
ll p[100007];

void ansfrom(ll st) {
	vector<int>v;
	for (ll i = st; i < st + k; i++) {
		v.push_back(i + 1);
	}
	answer(v);
	exit(0);
}

void check(ll sum, ll st) {
	if (sum >= a && sum <= 2 * a)ansfrom(st);
}

ll skimm(ll ind) {
	if (p[ind] != -1)return p[ind];
	return p[ind] = skim(ind);
}

ll sum_from(ll ind) {
	ll res = 0;
	for (ll i = ind; i < ind + k; i++) {
		res += skimm(i);
	}
	return res;
}

void solve(int N, int K, ll A, int S) {
	n = N;
	k = K;
	a = A;
	s = S;
	if (n == s) {
		ll sum = 0;
		ll least = -1;
		for (ll i = 0; i < n; i++) {
			p[i] = skim(i + 1);
			if (i < k - 1)sum += p[i];
			else if (p[i] > a && least == -1)least = i;
		}
		if (least != -1 && sum + p[least] >= a && sum + p[least] <= 2 * a) {
			vector<int>v;
			for (ll i = 0; i < k - 1; i++) {
				v.push_back(i + 1);
			}
			v.push_back(least + 1);
			answer(v);
			return;
		}
		else {
			sum += p[k - 1];
			check(sum, 0);
			for (ll i = k; i < n; i++) {
				sum -= p[i - k];
				sum += p[i];
				check(sum, i - k + 1);
			}
			impossible();
			return;
		}
	}
	else {
		ll sum = 0;
		vector<int>v;
		for (ll i = 1; i <= n; i++) {
			p[i] = -1;
		}
		for (ll i = 0; i < k - 1; i++) {
			sum += skimm(i + 1);
			v.push_back(i + 1);
		}
		if (sum + skimm(k) > 2 * a) {
			impossible();
			return;
		}
		ll l = k, r = n + 1;
		while (l < r) {
			ll m = (l + r) / 2;
			if (skimm(m) >= a) {
				r = m;
			}
			else {
				l = m + 1;
			}
		}
		int ind = l;
		//cout << "ind: " << ind << endl;
		if (ind <= n) {
			ll val = sum + skimm(l);
			if (val >= a && val <= 2 * a) {
				v.push_back(l);
				answer(v);
				return;
			}
		}
		if (2 * k >= ind) {
			l = 1, r = ind - k + 1;
			while (l < r) {
				ll mid = (l + r) / 2;
				sum = sum_from(mid);
				//cout << mid << ": " << sum << ": " << sum - a << endl;
				if (a <= sum && sum <= 2 * a) {
					ansfrom(mid - 1);
				}
				else if (a > sum) {
					l = mid + 1;
				}
				else {
					r = mid;
				}
			}
			sum = sum_from(l);
			//cout << l << ": " << sum << ": " << sum - a << endl;
			if (a <= sum && sum <= 2 * a) {
				ansfrom(l - 1);
			}
			impossible();
			return;
		}
		else {
			sum = 0;
			for (int i = 1; i <= k; i++) {
				sum += skimm(i);
			}
			//cout << "sum: " << sum << endl;
			int i = 1;
			int j = ind - k;
			if (a <= sum && sum <= 2 * a) {
				v.clear();
				for (int p = i; p <= k; p++) {
					v.push_back(p);
				}
				for (int p = ind - k; p < j; p++) {
					v.push_back(p);
				}
				answer(v);
				return;
			}
			while (j < ind) {
				sum -= skimm(i);
				i++;
				sum += skimm(j);
				j++;
				//cout << "sum: " << sum << endl;
				//cout << i << " " << j << endl;
				if (a <= sum && sum <= 2 * a) {
					v.clear();
					for (int p = i; p <= k; p++) {
						v.push_back(p);
					}
					for (int p = ind - k; p < j; p++) {
						v.push_back(p);
					}
					answer(v);
					return;
				}
			}
			impossible();
			return;
		}
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 10 ms 208 KB Output is correct
3 Correct 8 ms 208 KB Output is correct
4 Correct 8 ms 208 KB Output is correct
5 Correct 11 ms 208 KB Output is correct
6 Correct 7 ms 312 KB Output is correct
7 Correct 10 ms 312 KB Output is correct
8 Correct 8 ms 312 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 208 KB Output is correct
2 Correct 9 ms 320 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 11 ms 208 KB Output is correct
5 Correct 8 ms 208 KB Output is correct
6 Correct 9 ms 316 KB Output is correct
7 Correct 13 ms 316 KB Output is correct
8 Correct 11 ms 320 KB Output is correct
9 Correct 208 ms 484 KB Output is correct
10 Correct 135 ms 484 KB Output is correct
11 Correct 219 ms 428 KB Output is correct
12 Correct 210 ms 692 KB Output is correct
13 Correct 212 ms 436 KB Output is correct
14 Correct 201 ms 512 KB Output is correct
15 Correct 148 ms 604 KB Output is correct
16 Correct 248 ms 396 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 1 ms 976 KB Output is correct
12 Correct 1 ms 976 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 976 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 1 ms 976 KB Output is correct
12 Correct 1 ms 976 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 976 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct
26 Correct 1 ms 976 KB Output is correct
27 Correct 1 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 976 KB Output is correct
32 Correct 1 ms 976 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 2 ms 976 KB Output is correct
35 Correct 1 ms 976 KB Output is correct
36 Correct 1 ms 976 KB Output is correct
37 Correct 1 ms 976 KB Output is correct
38 Correct 1 ms 976 KB Output is correct
39 Correct 1 ms 976 KB Output is correct
40 Correct 1 ms 976 KB Output is correct
41 Correct 1 ms 976 KB Output is correct
42 Correct 1 ms 976 KB Output is correct
43 Correct 1 ms 976 KB Output is correct
44 Correct 1 ms 976 KB Output is correct
45 Correct 1 ms 976 KB Output is correct
46 Correct 1 ms 976 KB Output is correct
47 Correct 1 ms 976 KB Output is correct
48 Correct 1 ms 976 KB Output is correct
49 Correct 1 ms 976 KB Output is correct
50 Correct 2 ms 976 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 1 ms 976 KB Output is correct
12 Correct 1 ms 976 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 976 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct
26 Correct 1 ms 976 KB Output is correct
27 Correct 1 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 976 KB Output is correct
32 Correct 1 ms 976 KB Output is correct
33 Correct 2 ms 976 KB Output is correct
34 Correct 1 ms 1076 KB Output is correct
35 Correct 1 ms 976 KB Output is correct
36 Correct 1 ms 976 KB Output is correct
37 Correct 1 ms 976 KB Output is correct
38 Correct 1 ms 976 KB Output is correct
39 Correct 1 ms 976 KB Output is correct
40 Correct 1 ms 976 KB Output is correct
41 Correct 1 ms 976 KB Output is correct
42 Correct 1 ms 976 KB Output is correct
43 Correct 1 ms 976 KB Output is correct
44 Correct 1 ms 1072 KB Output is correct
45 Correct 1 ms 976 KB Output is correct
46 Correct 1 ms 1072 KB Output is correct
47 Correct 1 ms 1068 KB Output is correct
48 Correct 2 ms 976 KB Output is correct
49 Correct 2 ms 1068 KB Output is correct
50 Correct 1 ms 1072 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 1 ms 976 KB Output is correct
12 Correct 1 ms 976 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 976 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct
26 Correct 1 ms 976 KB Output is correct
27 Correct 1 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 976 KB Output is correct
32 Correct 1 ms 976 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 2 ms 976 KB Output is correct
35 Correct 1 ms 976 KB Output is correct
36 Correct 1 ms 976 KB Output is correct
37 Correct 1 ms 976 KB Output is correct
38 Correct 1 ms 976 KB Output is correct
39 Correct 1 ms 976 KB Output is correct
40 Correct 1 ms 976 KB Output is correct
41 Correct 1 ms 976 KB Output is correct
42 Correct 1 ms 976 KB Output is correct
43 Correct 1 ms 976 KB Output is correct
44 Correct 1 ms 976 KB Output is correct
45 Correct 1 ms 976 KB Output is correct
46 Correct 1 ms 976 KB Output is correct
47 Correct 1 ms 976 KB Output is correct
48 Correct 1 ms 976 KB Output is correct
49 Correct 1 ms 976 KB Output is correct
50 Correct 2 ms 976 KB Output is correct
51 Correct 1 ms 976 KB Output is correct
52 Correct 1 ms 976 KB Output is correct
53 Correct 1 ms 976 KB Output is correct
54 Correct 1 ms 976 KB Output is correct
55 Correct 1 ms 976 KB Output is correct
56 Correct 1 ms 976 KB Output is correct
57 Correct 1 ms 976 KB Output is correct
58 Correct 2 ms 976 KB Output is correct
59 Correct 1 ms 1076 KB Output is correct
60 Correct 1 ms 976 KB Output is correct
61 Correct 1 ms 976 KB Output is correct
62 Correct 1 ms 976 KB Output is correct
63 Correct 1 ms 976 KB Output is correct
64 Correct 1 ms 976 KB Output is correct
65 Correct 1 ms 976 KB Output is correct
66 Correct 1 ms 976 KB Output is correct
67 Correct 1 ms 976 KB Output is correct
68 Correct 1 ms 976 KB Output is correct
69 Correct 1 ms 1072 KB Output is correct
70 Correct 1 ms 976 KB Output is correct
71 Correct 1 ms 1072 KB Output is correct
72 Correct 1 ms 1068 KB Output is correct
73 Correct 2 ms 976 KB Output is correct
74 Correct 2 ms 1068 KB Output is correct
75 Correct 1 ms 1072 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 9 ms 208 KB Output is correct
78 Correct 6 ms 208 KB Output is correct
79 Correct 10 ms 208 KB Output is correct
80 Correct 14 ms 208 KB Output is correct
81 Correct 9 ms 316 KB Output is correct
82 Correct 11 ms 308 KB Output is correct
83 Correct 8 ms 208 KB Output is correct
84 Correct 218 ms 624 KB Output is correct
85 Correct 94 ms 480 KB Output is correct
86 Correct 227 ms 472 KB Output is correct
87 Correct 173 ms 480 KB Output is correct
88 Correct 190 ms 456 KB Output is correct
89 Correct 214 ms 484 KB Output is correct
90 Correct 199 ms 460 KB Output is correct
91 Correct 140 ms 480 KB Output is correct
92 Correct 1 ms 976 KB Output is correct
93 Correct 1 ms 976 KB Output is correct
94 Correct 1 ms 976 KB Output is correct
95 Correct 1 ms 976 KB Output is correct
96 Correct 1 ms 976 KB Output is correct
97 Correct 1 ms 1072 KB Output is correct
98 Correct 1 ms 1064 KB Output is correct
99 Correct 1 ms 1072 KB Output is correct
100 Correct 1 ms 976 KB Output is correct
101 Correct 1 ms 968 KB Output is correct
102 Correct 1 ms 1064 KB Output is correct
103 Correct 1 ms 976 KB Output is correct
104 Correct 1 ms 976 KB Output is correct
105 Correct 1 ms 1072 KB Output is correct
106 Correct 1 ms 1072 KB Output is correct
107 Correct 1 ms 1072 KB Output is correct
108 Correct 1 ms 976 KB Output is correct
109 Correct 1 ms 1080 KB Output is correct
110 Correct 1 ms 976 KB Output is correct
111 Correct 1 ms 968 KB Output is correct
112 Correct 1 ms 1060 KB Output is correct
113 Correct 1 ms 976 KB Output is correct
114 Correct 1 ms 976 KB Output is correct
115 Correct 1 ms 1076 KB Output is correct
116 Correct 1 ms 1072 KB Output is correct
117 Correct 1 ms 1068 KB Output is correct
118 Correct 1 ms 976 KB Output is correct
119 Correct 1 ms 1068 KB Output is correct
120 Correct 1 ms 1076 KB Output is correct
121 Correct 1 ms 1068 KB Output is correct
122 Correct 1 ms 976 KB Output is correct
123 Correct 1 ms 976 KB Output is correct
124 Correct 1 ms 1068 KB Output is correct
125 Correct 1 ms 1072 KB Output is correct
126 Correct 1 ms 976 KB Output is correct
127 Correct 1 ms 976 KB Output is correct
128 Correct 1 ms 1072 KB Output is correct
129 Correct 1 ms 976 KB Output is correct
130 Correct 1 ms 968 KB Output is correct
131 Correct 2 ms 1072 KB Output is correct
132 Correct 1 ms 1072 KB Output is correct
133 Correct 1 ms 976 KB Output is correct
134 Correct 1 ms 1072 KB Output is correct
135 Correct 1 ms 1076 KB Output is correct