oj.uz

Submission #657571

# Submission time Handle Problem Language Result Execution time Memory
657571 2022-11-10T09:13:01 Z baojiaopisu A Difficult(y) Choice (BOI21_books) C++14
100 / 100
 2 ms 336 KB 
#include<bits/stdc++.h>
#include "books.h"

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

ll w[N];

void solve(int n, int k, ll A, int S) {
	int l = 1, r = n, pos = n + 1;
	while(l <= r) {
		int mid = (l + r) >> 1;
		w[mid] = skim(mid);
		if(w[mid] >= A) {
			pos = mid;
			r = mid - 1;
		} else l = mid + 1;
	}

	if(pos < k) {
		impossible();
		return;
	}
	for(int i = 1; i < k; i++) w[i] = skim(i);

	if(pos <= n) {
		ll tot = w[pos];
		for(int i = 1; i < k; i++) tot += w[i];
		if(tot <= A * 2) {
			vector<int> ans;
			for(int i = 1; i < k; i++) ans.pb(i);
			ans.pb(pos);
			answer(ans);
			return;
		}
	}

	if(pos == k) {
		impossible();
		return;
	}
	ll tot = 0;
	if(!w[k]) w[k] = skim(k);
	for(int i = 1; i <= k; i++) tot += w[i];

	l = 1, r = pos - 1;
	while(true) {
		if(tot > A * 2) {
			impossible();
			return;
		}
		if(tot >= A) {
			vector<int> ans;
			for(int i = l; i <= k; i++) ans.pb(i);
			for(int i = r + 1; i < pos; i++) ans.pb(i);
			answer(ans); 
			return;
		}

		if(l > k || r <= k) {
			impossible();
			return;
		}

		tot -= w[l++];
		if(!w[r]) w[r] = skim(r);
		tot += w[r--];
	}

	impossible();
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 316 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 336 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 308 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Correct 1 ms 316 KB Output is correct

Subtask #5
15.0 / 15.0

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

Subtask #6
20.0 / 20.0

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

Subtask #7
20.0 / 20.0

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