oj.uz

Submission #600399

# Submission time Handle Problem Language Result Execution time Memory
600399 2022-07-20T20:03:38 Z flappybird Uplifting Excursion (BOI22_vault) C++17
50 / 100
 2591 ms 8992 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 303030
#define MAXS 19
#define INF 1000000000000000001
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define smin(a, x) (a)=(min((a), (x)))
ll arr[MAX];
ll dp[MAX];
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int M;
	ll L;
	cin >> M >> L;
	int i;
	ll A, B;
	A = B = 0;
	for (i = -M; i <= M; i++) cin >> arr[i + M], (i < 0 ? A : B) += arr[i + M] * i;
	if (B < L || A > L) {
		cout << "impossible" << ln;
		return 0;
	}
	if (A + B <= L) reverse(arr, arr + M + M + 1), L *= -1, swap(A, B), A *= -1, B *= -1;
	ll cnt = 0;
	if (A + B == L) {
		for (i = -M; i <= M; i++) cnt += arr[i + M];
		cout << cnt << ln;
		return 0;
	}
	for (i = -M; i < 0; i++) cnt += arr[i + M];
	ll c = 0;
	for (i = 1; i <= M; i++) {
		if (A + arr[i + M] * i > L) {
			ll x = (L - A) / i;
			if (x) c = x;
			A += x * i;
			cnt += x;
			break;
		}
		else A += arr[i + M] * i, cnt += arr[i + M];
	}
	int e = i;
	A = L - A;
	vector<tuple<ll, ll, ll>> lst;
	for (i = -M; i < 0; i++) if (arr[i + M]) lst.emplace_back(-i, 1, arr[i + M]);
	lst.emplace_back(e, -1, arr[e + M] - c);
	for (i = e + 1; i <= M; i++) if (arr[i + M]) lst.emplace_back(i, -1, arr[i + M]);
	for (i = 1; i < e; i++) if (arr[i + M]) lst.emplace_back(-i, 1, arr[i + M]);
	if (c) lst.emplace_back(-e, 1, c);
	fill(dp, dp + 303000, INF);
	int bias = M * M + 20;
	dp[bias] = 0;
	for (auto& [w, v, mx] : lst) {
		int ww = abs(w);
		vector<priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>> vpq(ww);
		if (w < 0) {
			for (i = M * M + 10; i >= -M * M - 10; i--) {
				int ind = (i % ww + ww) % ww;
				while (vpq[ind].size() && vpq[ind].top().second > i + M * mx) vpq[ind].pop();
				ll pv = dp[i + bias];
				if (vpq[ind].size()) dp[i + bias] = min(dp[i + bias], vpq[ind].top().first - v * (i / ww));
				vpq[ind].emplace(pv + v * (i / ww), i);
			}
		}
		else {
			for (i = -M * M - 10; i <= M * M + 10; i++) {
				int ind = (i % ww + ww) % ww;
				while (vpq[ind].size() && vpq[ind].top().second < i - M * mx) vpq[ind].pop();
				ll pv = dp[i + bias];
				if (vpq[ind].size()) dp[i + bias] = min(dp[i + bias], vpq[ind].top().first + v * (i / ww));
				vpq[ind].emplace(pv - v * (i / ww), i);
			}
		}
	}
	if (dp[bias + A] > 50 * M) cout << "impossible" << ln;
	else cout << cnt + arr[M] - dp[bias + A];
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 29 ms 2960 KB Output is correct
7 Incorrect 9 ms 2880 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 29 ms 2960 KB Output is correct
7 Incorrect 9 ms 2880 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

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

Subtask #3-2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 4 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 5 ms 2772 KB Output is correct
6 Correct 4 ms 2800 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 4 ms 2772 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 3 ms 2644 KB Output is correct
15 Correct 4 ms 2772 KB Output is correct
16 Correct 3 ms 2784 KB Output is correct
17 Correct 3 ms 2772 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 5 ms 2772 KB Output is correct
20 Correct 2 ms 2772 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 3 ms 2760 KB Output is correct
23 Correct 4 ms 2764 KB Output is correct
24 Correct 7 ms 2772 KB Output is correct
25 Correct 3 ms 2760 KB Output is correct
26 Correct 5 ms 2772 KB Output is correct
27 Correct 6 ms 2820 KB Output is correct
28 Correct 6 ms 2748 KB Output is correct

Subtask #4-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 4 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 5 ms 2772 KB Output is correct
6 Correct 4 ms 2800 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 4 ms 2772 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 4 ms 2732 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 4 ms 2772 KB Output is correct
15 Correct 4 ms 2772 KB Output is correct
16 Correct 4 ms 2772 KB Output is correct
17 Correct 3 ms 2772 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 4 ms 2772 KB Output is correct
20 Correct 4 ms 2772 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 3 ms 2772 KB Output is correct
23 Correct 15 ms 2916 KB Output is correct
24 Correct 6 ms 2872 KB Output is correct
25 Correct 12 ms 2900 KB Output is correct
26 Correct 12 ms 2924 KB Output is correct
27 Correct 14 ms 2904 KB Output is correct
28 Correct 10 ms 2932 KB Output is correct

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 29 ms 2960 KB Output is correct
7 Incorrect 9 ms 2880 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 4 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 5 ms 2772 KB Output is correct
6 Correct 4 ms 2800 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 4 ms 2772 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 4 ms 2732 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 4 ms 2772 KB Output is correct
15 Correct 4 ms 2772 KB Output is correct
16 Correct 4 ms 2772 KB Output is correct
17 Correct 3 ms 2772 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 4 ms 2772 KB Output is correct
20 Correct 4 ms 2772 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 3 ms 2772 KB Output is correct
23 Correct 15 ms 2916 KB Output is correct
24 Correct 6 ms 2872 KB Output is correct
25 Correct 12 ms 2900 KB Output is correct
26 Correct 12 ms 2924 KB Output is correct
27 Correct 14 ms 2904 KB Output is correct
28 Correct 10 ms 2932 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 4 ms 2772 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 4 ms 2772 KB Output is correct
33 Correct 5 ms 2764 KB Output is correct
34 Correct 5 ms 2772 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 3 ms 2772 KB Output is correct
38 Correct 3 ms 2772 KB Output is correct
39 Correct 3 ms 2760 KB Output is correct
40 Correct 3 ms 2756 KB Output is correct
41 Correct 14 ms 2920 KB Output is correct
42 Correct 7 ms 2872 KB Output is correct
43 Correct 12 ms 2904 KB Output is correct
44 Correct 11 ms 2900 KB Output is correct
45 Correct 11 ms 2904 KB Output is correct
46 Correct 10 ms 2912 KB Output is correct
47 Correct 4 ms 3092 KB Output is correct
48 Correct 7 ms 3124 KB Output is correct
49 Correct 89 ms 3428 KB Output is correct
50 Correct 41 ms 3296 KB Output is correct
51 Correct 83 ms 3480 KB Output is correct
52 Correct 73 ms 3380 KB Output is correct
53 Correct 83 ms 3392 KB Output is correct
54 Correct 82 ms 3488 KB Output is correct

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 29 ms 2960 KB Output is correct
7 Incorrect 9 ms 2880 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 4 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 5 ms 2772 KB Output is correct
6 Correct 4 ms 2800 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 4 ms 2772 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 4 ms 2732 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 4 ms 2772 KB Output is correct
15 Correct 4 ms 2772 KB Output is correct
16 Correct 4 ms 2772 KB Output is correct
17 Correct 3 ms 2772 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 4 ms 2772 KB Output is correct
20 Correct 4 ms 2772 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 3 ms 2772 KB Output is correct
23 Correct 15 ms 2916 KB Output is correct
24 Correct 6 ms 2872 KB Output is correct
25 Correct 12 ms 2900 KB Output is correct
26 Correct 12 ms 2924 KB Output is correct
27 Correct 14 ms 2904 KB Output is correct
28 Correct 10 ms 2932 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 4 ms 2772 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 4 ms 2772 KB Output is correct
33 Correct 5 ms 2764 KB Output is correct
34 Correct 5 ms 2772 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 3 ms 2772 KB Output is correct
38 Correct 3 ms 2772 KB Output is correct
39 Correct 3 ms 2760 KB Output is correct
40 Correct 3 ms 2756 KB Output is correct
41 Correct 14 ms 2920 KB Output is correct
42 Correct 7 ms 2872 KB Output is correct
43 Correct 12 ms 2904 KB Output is correct
44 Correct 11 ms 2900 KB Output is correct
45 Correct 11 ms 2904 KB Output is correct
46 Correct 10 ms 2912 KB Output is correct
47 Correct 4 ms 3092 KB Output is correct
48 Correct 7 ms 3124 KB Output is correct
49 Correct 89 ms 3428 KB Output is correct
50 Correct 41 ms 3296 KB Output is correct
51 Correct 83 ms 3480 KB Output is correct
52 Correct 73 ms 3380 KB Output is correct
53 Correct 83 ms 3392 KB Output is correct
54 Correct 82 ms 3488 KB Output is correct
55 Correct 2 ms 2644 KB Output is correct
56 Correct 6 ms 2772 KB Output is correct
57 Correct 2 ms 2772 KB Output is correct
58 Correct 5 ms 2772 KB Output is correct
59 Correct 6 ms 2796 KB Output is correct
60 Correct 3 ms 2772 KB Output is correct
61 Correct 2 ms 2772 KB Output is correct
62 Correct 2 ms 2752 KB Output is correct
63 Correct 4 ms 2772 KB Output is correct
64 Correct 3 ms 2800 KB Output is correct
65 Correct 2 ms 2772 KB Output is correct
66 Correct 3 ms 2772 KB Output is correct
67 Correct 17 ms 2916 KB Output is correct
68 Correct 6 ms 2872 KB Output is correct
69 Correct 12 ms 2924 KB Output is correct
70 Correct 11 ms 2912 KB Output is correct
71 Correct 12 ms 2916 KB Output is correct
72 Correct 9 ms 2912 KB Output is correct
73 Correct 3 ms 3092 KB Output is correct
74 Correct 7 ms 3144 KB Output is correct
75 Correct 85 ms 3428 KB Output is correct
76 Correct 39 ms 3308 KB Output is correct
77 Correct 84 ms 3480 KB Output is correct
78 Correct 76 ms 3436 KB Output is correct
79 Correct 80 ms 3368 KB Output is correct
80 Correct 77 ms 3412 KB Output is correct
81 Correct 2532 ms 8808 KB Output is correct
82 Correct 1220 ms 7412 KB Output is correct
83 Correct 2591 ms 8824 KB Output is correct
84 Correct 2254 ms 8892 KB Output is correct
85 Correct 28 ms 7252 KB Output is correct
86 Correct 58 ms 7332 KB Output is correct
87 Correct 2196 ms 8992 KB Output is correct

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 29 ms 2960 KB Output is correct
7 Incorrect 9 ms 2880 KB Output isn't correct
8 Halted 0 ms 0 KB -