oj.uz

Submission #592151

# Submission time Handle Problem Language Result Execution time Memory
592151 2022-07-08T16:44:06 Z tutis Uplifting Excursion (BOI22_vault) C++17
45 / 100
 5000 ms 104016 KB 
/*input
2 5
2 3 1 1 4

*/

#pragma GCC optimize ("O3")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T,  null_type,  less<T>,  rb_tree_tag,  tree_order_statistics_node_update>;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
mt19937_64 rng(0);
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int M;
	ll L;
	cin >> M >> L;
	ll A_[2 * M + 1];
	ll* A = A_ + M;
	for (int i = -M; i <= M; i++)
		cin >> A[i];
	ll pl = 0;
	pl += A[0];
	A[0] = 0;
	L = -L;
	ll cnt = 0;
	for (int l = -M; l <= M; l++)
	{
		L += l * A[l];
		cnt += A[l];
	}
	cc_hash_table<ll, ll>D;
	D[0] = 0;
	cc_hash_table<ll, int>X[M + 1];
	X[0][0] = 0;
	int mxe = 100;
	for (int v = 1; v <= M; v++)
	{
		for (pair<ll, int>a : X[v - 1])
		{
			int mxe1 = mxe - a.second;
			for (int l : {v, -v})
			{
				for (int i = 0; i <= mxe1 && i <= A[l]; i++)
				{
					ll val = a.first + i * l;
					int ej = a.second + i;
					auto it = X[v].find(val);
					if (it == X[v].end())
						X[v][val] = ej;
					else
						it->second = min(it->second, ej);
				}
			}
		}
	}
	if (X[M].find(L) != X[M].end())
	{
		cout << pl + cnt - X[M][L] << "\n";
		return 0;
	}
	ll infi = 5e18;
	ll best = infi;
	A[0] = 1;
	for (int v = M; v >= 1; v--)
		for (int l : {v, -v})
		{
			if (l == 0)
				continue;
			cc_hash_table<ll, ll>D_;
			for (pair<ll, ll>v : D)
			{
				if (v.second >= best)
					continue;
				ll k = (L - v.first) / l;
				k = max(k, 0ll);
				k = min(k, A[l]);
				ll lo = max(0ll, k - abs(l));
				ll hi = min(k + abs(l), A[l]);
				if (abs(L - (v.first + k * l)) < abs(l) && A[L - (v.first + k * l)] > 0)
				{
					int d = 1;
					if (L - (v.first + k * l) == 0)
						d = 0;
					ll c_ = v.second + k + d;
					best = min(best, c_);
				}
				else
				{
					for (ll c = lo; c <= hi; c++)
					{
						ll v_ = v.first + l * c;
						ll c_ = v.second + c;
						if (c_ >= best)
							continue;
						auto it1 = X[abs(l) - 1].find(L - v_);
						if (it1 != X[abs(l) - 1].end())
						{
							best = min(best, c_ + it1->second);
						}
						else {
							auto it = D_.find(v_);
							if (it == D_.end())
								D_[v_] = c_;
							else
								it->second = min(it->second, c_);
						}
					}
				}
			}
			D = D_;
		}
	if (best < infi)
		cout << pl + cnt - best << "\n";
	else
		cout << "impossible\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1132 ms 22196 KB Output is correct
6 Correct 108 ms 13576 KB Output is correct
7 Correct 369 ms 15648 KB Output is correct
8 Correct 796 ms 21324 KB Output is correct
9 Correct 1897 ms 30396 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1132 ms 22196 KB Output is correct
6 Correct 108 ms 13576 KB Output is correct
7 Correct 369 ms 15648 KB Output is correct
8 Correct 796 ms 21324 KB Output is correct
9 Correct 1897 ms 30396 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1137 ms 22076 KB Output is correct
17 Correct 102 ms 13548 KB Output is correct
18 Correct 404 ms 15780 KB Output is correct
19 Correct 790 ms 21280 KB Output is correct
20 Correct 1887 ms 30456 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Execution timed out 5091 ms 104016 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 13 ms 2664 KB Output is correct
3 Correct 21 ms 2328 KB Output is correct
4 Correct 40 ms 3792 KB Output is correct
5 Correct 17 ms 3156 KB Output is correct
6 Correct 48 ms 3592 KB Output is correct
7 Correct 9 ms 724 KB Output is correct
8 Correct 8 ms 776 KB Output is correct
9 Correct 5 ms 1944 KB Output is correct
10 Correct 9 ms 2308 KB Output is correct

Subtask #3-2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 13 ms 2664 KB Output is correct
3 Correct 21 ms 2328 KB Output is correct
4 Correct 40 ms 3792 KB Output is correct
5 Correct 17 ms 3156 KB Output is correct
6 Correct 48 ms 3592 KB Output is correct
7 Correct 9 ms 724 KB Output is correct
8 Correct 8 ms 776 KB Output is correct
9 Correct 5 ms 1944 KB Output is correct
10 Correct 9 ms 2308 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 14 ms 2760 KB Output is correct
16 Correct 21 ms 2380 KB Output is correct
17 Correct 39 ms 3716 KB Output is correct
18 Correct 17 ms 3028 KB Output is correct
19 Correct 50 ms 3564 KB Output is correct
20 Correct 7 ms 724 KB Output is correct
21 Correct 6 ms 724 KB Output is correct
22 Correct 5 ms 2004 KB Output is correct
23 Correct 8 ms 2260 KB Output is correct
24 Correct 43 ms 5068 KB Output is correct
25 Correct 70 ms 5280 KB Output is correct
26 Correct 222 ms 9084 KB Output is correct
27 Correct 39 ms 4920 KB Output is correct
28 Correct 173 ms 7372 KB Output is correct

Subtask #4-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 13 ms 2664 KB Output is correct
3 Correct 21 ms 2328 KB Output is correct
4 Correct 40 ms 3792 KB Output is correct
5 Correct 17 ms 3156 KB Output is correct
6 Correct 48 ms 3592 KB Output is correct
7 Correct 9 ms 724 KB Output is correct
8 Correct 8 ms 776 KB Output is correct
9 Correct 5 ms 1944 KB Output is correct
10 Correct 9 ms 2308 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 13 ms 2644 KB Output is correct
13 Correct 21 ms 2376 KB Output is correct
14 Correct 41 ms 3680 KB Output is correct
15 Correct 17 ms 3028 KB Output is correct
16 Correct 49 ms 3500 KB Output is correct
17 Correct 7 ms 724 KB Output is correct
18 Correct 7 ms 776 KB Output is correct
19 Correct 5 ms 1876 KB Output is correct
20 Correct 9 ms 2260 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 652 KB Output is correct
23 Correct 40 ms 7064 KB Output is correct
24 Correct 318 ms 10484 KB Output is correct
25 Correct 39 ms 7192 KB Output is correct
26 Correct 357 ms 14972 KB Output is correct
27 Correct 587 ms 14996 KB Output is correct
28 Correct 31 ms 6432 KB Output is correct

Subtask #4-2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1132 ms 22196 KB Output is correct
6 Correct 108 ms 13576 KB Output is correct
7 Correct 369 ms 15648 KB Output is correct
8 Correct 796 ms 21324 KB Output is correct
9 Correct 1897 ms 30396 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 13 ms 2664 KB Output is correct
14 Correct 21 ms 2328 KB Output is correct
15 Correct 40 ms 3792 KB Output is correct
16 Correct 17 ms 3156 KB Output is correct
17 Correct 48 ms 3592 KB Output is correct
18 Correct 9 ms 724 KB Output is correct
19 Correct 8 ms 776 KB Output is correct
20 Correct 5 ms 1944 KB Output is correct
21 Correct 9 ms 2308 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 14 ms 2760 KB Output is correct
27 Correct 21 ms 2380 KB Output is correct
28 Correct 39 ms 3716 KB Output is correct
29 Correct 17 ms 3028 KB Output is correct
30 Correct 50 ms 3564 KB Output is correct
31 Correct 7 ms 724 KB Output is correct
32 Correct 6 ms 724 KB Output is correct
33 Correct 5 ms 2004 KB Output is correct
34 Correct 8 ms 2260 KB Output is correct
35 Correct 43 ms 5068 KB Output is correct
36 Correct 70 ms 5280 KB Output is correct
37 Correct 222 ms 9084 KB Output is correct
38 Correct 39 ms 4920 KB Output is correct
39 Correct 173 ms 7372 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 13 ms 2644 KB Output is correct
42 Correct 21 ms 2376 KB Output is correct
43 Correct 41 ms 3680 KB Output is correct
44 Correct 17 ms 3028 KB Output is correct
45 Correct 49 ms 3500 KB Output is correct
46 Correct 7 ms 724 KB Output is correct
47 Correct 7 ms 776 KB Output is correct
48 Correct 5 ms 1876 KB Output is correct
49 Correct 9 ms 2260 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 1 ms 652 KB Output is correct
52 Correct 40 ms 7064 KB Output is correct
53 Correct 318 ms 10484 KB Output is correct
54 Correct 39 ms 7192 KB Output is correct
55 Correct 357 ms 14972 KB Output is correct
56 Correct 587 ms 14996 KB Output is correct
57 Correct 31 ms 6432 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1128 ms 22068 KB Output is correct
63 Correct 104 ms 13640 KB Output is correct
64 Correct 369 ms 15800 KB Output is correct
65 Correct 785 ms 21284 KB Output is correct
66 Correct 1904 ms 30408 KB Output is correct
67 Correct 1 ms 596 KB Output is correct
68 Correct 1 ms 596 KB Output is correct
69 Correct 12 ms 2644 KB Output is correct
70 Correct 22 ms 2412 KB Output is correct
71 Correct 38 ms 3776 KB Output is correct
72 Correct 18 ms 3132 KB Output is correct
73 Correct 49 ms 3568 KB Output is correct
74 Correct 9 ms 724 KB Output is correct
75 Correct 8 ms 724 KB Output is correct
76 Correct 5 ms 1876 KB Output is correct
77 Correct 8 ms 2284 KB Output is correct
78 Correct 45 ms 5012 KB Output is correct
79 Correct 69 ms 5344 KB Output is correct
80 Correct 230 ms 9108 KB Output is correct
81 Correct 39 ms 4928 KB Output is correct
82 Correct 174 ms 7300 KB Output is correct
83 Correct 40 ms 7124 KB Output is correct
84 Correct 329 ms 10500 KB Output is correct
85 Correct 39 ms 7228 KB Output is correct
86 Correct 341 ms 14888 KB Output is correct
87 Correct 577 ms 15056 KB Output is correct
88 Correct 30 ms 6444 KB Output is correct
89 Correct 125 ms 13844 KB Output is correct
90 Correct 179 ms 16048 KB Output is correct
91 Correct 585 ms 22492 KB Output is correct
92 Correct 1554 ms 29924 KB Output is correct

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 13 ms 2664 KB Output is correct
3 Correct 21 ms 2328 KB Output is correct
4 Correct 40 ms 3792 KB Output is correct
5 Correct 17 ms 3156 KB Output is correct
6 Correct 48 ms 3592 KB Output is correct
7 Correct 9 ms 724 KB Output is correct
8 Correct 8 ms 776 KB Output is correct
9 Correct 5 ms 1944 KB Output is correct
10 Correct 9 ms 2308 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 13 ms 2644 KB Output is correct
13 Correct 21 ms 2376 KB Output is correct
14 Correct 41 ms 3680 KB Output is correct
15 Correct 17 ms 3028 KB Output is correct
16 Correct 49 ms 3500 KB Output is correct
17 Correct 7 ms 724 KB Output is correct
18 Correct 7 ms 776 KB Output is correct
19 Correct 5 ms 1876 KB Output is correct
20 Correct 9 ms 2260 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 652 KB Output is correct
23 Correct 40 ms 7064 KB Output is correct
24 Correct 318 ms 10484 KB Output is correct
25 Correct 39 ms 7192 KB Output is correct
26 Correct 357 ms 14972 KB Output is correct
27 Correct 587 ms 14996 KB Output is correct
28 Correct 31 ms 6432 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 14 ms 2660 KB Output is correct
31 Correct 23 ms 2420 KB Output is correct
32 Correct 40 ms 3824 KB Output is correct
33 Correct 19 ms 3188 KB Output is correct
34 Correct 52 ms 3616 KB Output is correct
35 Correct 8 ms 724 KB Output is correct
36 Correct 9 ms 776 KB Output is correct
37 Correct 6 ms 1820 KB Output is correct
38 Correct 9 ms 2260 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 40 ms 7152 KB Output is correct
42 Correct 340 ms 10576 KB Output is correct
43 Correct 40 ms 7244 KB Output is correct
44 Correct 369 ms 14944 KB Output is correct
45 Correct 620 ms 15152 KB Output is correct
46 Correct 28 ms 6476 KB Output is correct
47 Correct 140 ms 1932 KB Output is correct
48 Correct 2 ms 980 KB Output is correct
49 Correct 189 ms 28008 KB Output is correct
50 Correct 3448 ms 44140 KB Output is correct
51 Correct 2894 ms 62184 KB Output is correct
52 Execution timed out 5101 ms 64400 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1132 ms 22196 KB Output is correct
6 Correct 108 ms 13576 KB Output is correct
7 Correct 369 ms 15648 KB Output is correct
8 Correct 796 ms 21324 KB Output is correct
9 Correct 1897 ms 30396 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1137 ms 22076 KB Output is correct
17 Correct 102 ms 13548 KB Output is correct
18 Correct 404 ms 15780 KB Output is correct
19 Correct 790 ms 21280 KB Output is correct
20 Correct 1887 ms 30456 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Execution timed out 5091 ms 104016 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 13 ms 2664 KB Output is correct
3 Correct 21 ms 2328 KB Output is correct
4 Correct 40 ms 3792 KB Output is correct
5 Correct 17 ms 3156 KB Output is correct
6 Correct 48 ms 3592 KB Output is correct
7 Correct 9 ms 724 KB Output is correct
8 Correct 8 ms 776 KB Output is correct
9 Correct 5 ms 1944 KB Output is correct
10 Correct 9 ms 2308 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 13 ms 2644 KB Output is correct
13 Correct 21 ms 2376 KB Output is correct
14 Correct 41 ms 3680 KB Output is correct
15 Correct 17 ms 3028 KB Output is correct
16 Correct 49 ms 3500 KB Output is correct
17 Correct 7 ms 724 KB Output is correct
18 Correct 7 ms 776 KB Output is correct
19 Correct 5 ms 1876 KB Output is correct
20 Correct 9 ms 2260 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 652 KB Output is correct
23 Correct 40 ms 7064 KB Output is correct
24 Correct 318 ms 10484 KB Output is correct
25 Correct 39 ms 7192 KB Output is correct
26 Correct 357 ms 14972 KB Output is correct
27 Correct 587 ms 14996 KB Output is correct
28 Correct 31 ms 6432 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 14 ms 2660 KB Output is correct
31 Correct 23 ms 2420 KB Output is correct
32 Correct 40 ms 3824 KB Output is correct
33 Correct 19 ms 3188 KB Output is correct
34 Correct 52 ms 3616 KB Output is correct
35 Correct 8 ms 724 KB Output is correct
36 Correct 9 ms 776 KB Output is correct
37 Correct 6 ms 1820 KB Output is correct
38 Correct 9 ms 2260 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 40 ms 7152 KB Output is correct
42 Correct 340 ms 10576 KB Output is correct
43 Correct 40 ms 7244 KB Output is correct
44 Correct 369 ms 14944 KB Output is correct
45 Correct 620 ms 15152 KB Output is correct
46 Correct 28 ms 6476 KB Output is correct
47 Correct 140 ms 1932 KB Output is correct
48 Correct 2 ms 980 KB Output is correct
49 Correct 189 ms 28008 KB Output is correct
50 Correct 3448 ms 44140 KB Output is correct
51 Correct 2894 ms 62184 KB Output is correct
52 Execution timed out 5101 ms 64400 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1132 ms 22196 KB Output is correct
6 Correct 108 ms 13576 KB Output is correct
7 Correct 369 ms 15648 KB Output is correct
8 Correct 796 ms 21324 KB Output is correct
9 Correct 1897 ms 30396 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1137 ms 22076 KB Output is correct
17 Correct 102 ms 13548 KB Output is correct
18 Correct 404 ms 15780 KB Output is correct
19 Correct 790 ms 21280 KB Output is correct
20 Correct 1887 ms 30456 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Execution timed out 5091 ms 104016 KB Time limit exceeded
24 Halted 0 ms 0 KB -