답안 #575221

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
575221	2022-06-10T02:48:08 Z	8e7	Uplifting Excursion (BOI22_vault)	C++17	50 / 100	4926 ms	8312 KB

vault

//Challenge: Accepted
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 2000005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
const int inf = 1<<30;
int dp[maxn];
int main() {
	io
	int m;
	ll L;
	cin >> m >> L;
	vector<ll> a(2*m+1), ex(2*m+1), ex2(2*m+1);	
	ll mins = -maxn / 2, ans = 0;
	ll sum = 0;
	for (int i = 0;i < 2*m+1;i++) {
		cin >> a[i];
		if (i == m) ans += a[i], a[i] = 0;
		sum += a[i] * (i - m);	
	}
	if (sum < L) {
		for (int i = 0;i < m;i++) swap(a[i], a[2*m - i]);
		L = -L;
	}
	for (int i = 0;i < m;i++) {
		L -= a[i] * (i - m);
		ans += a[i];
		
		ex2[2 * m - i] = min(a[i],(ll)m);

		a[i] = 0;
	}
	for (int i = m+1;i < 2*m+1;i++) {
		ll p = min(a[i], L / (i-m));
		ans += p;
		L -= p * (i-m);
		a[i] -= p;

		ex[i] = min(a[i], (ll)m);
		ex[2 * m - i] = min(p,(ll)m);
	}
	for (int i = 0;i < maxn;i++) dp[i] = -inf;	

	dp[-mins] = 0;
	for (int i = 0;i < 2*m+1;i++) {
		ll cnt = 1;
		vector<int> num;
		while (ex[i] >= cnt) {
			num.push_back(cnt);
			ex[i] -= cnt;
			cnt <<= 1;
		}
		if (ex[i] > 0) num.push_back(ex[i]);
		for (int p:num) {
			if (i - m > 0) {
				for (int j = maxn - 1;j >= 0;j--) {
					int val = j + p * (i-m);
					if (val >= maxn) continue;
					int del = i < m ? -p : p;
					dp[val] = max(dp[val], dp[j] + del);
				}
			} else {
				for (int j = 0;j < maxn;j++) {
					int val = j + p * (i-m);
					if (val < 0) continue;
					int del = i < m ? -p : p;
					dp[val] = max(dp[val], dp[j] + del);
				}
			}
		}
	}
	ex = ex2;
	for (int i = m+1;i < 2*m+1;i++) {
		ll cnt = 1;
		vector<int> num;
		while (ex[i] >= cnt) {
			num.push_back(cnt);
			ex[i] -= cnt;
			cnt <<= 1;
		}
		if (ex[i] > 0) num.push_back(ex[i]);
		for (int p:num) {
			for (int j = maxn - 1;j >= 0;j--) {
				int val = j + p * (i-m);
				if (val >= maxn) continue;
				dp[val] = max(dp[val], dp[j] - p);
			}
		}
	}
	if (L - mins >= maxn || L - mins < 0 || dp[L - mins] < -maxn) cout << "impossible\n";
	else cout << dp[L - mins]+ans << "\n";
}

Subtask #1
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	8020 KB	Output is correct
2	Correct	13 ms	8140 KB	Output is correct
3	Correct	7 ms	8144 KB	Output is correct
4	Correct	58 ms	8136 KB	Output is correct
5	Incorrect	883 ms	8140 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #2
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	8020 KB	Output is correct
2	Correct	13 ms	8140 KB	Output is correct
3	Correct	7 ms	8144 KB	Output is correct
4	Correct	58 ms	8136 KB	Output is correct
5	Incorrect	883 ms	8140 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3-1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	55 ms	8128 KB	Output is correct
2	Correct	257 ms	8124 KB	Output is correct
3	Correct	76 ms	8020 KB	Output is correct
4	Correct	289 ms	8140 KB	Output is correct
5	Correct	291 ms	8120 KB	Output is correct
6	Correct	258 ms	8124 KB	Output is correct
7	Correct	33 ms	8020 KB	Output is correct
8	Correct	37 ms	8120 KB	Output is correct
9	Correct	136 ms	8020 KB	Output is correct
10	Correct	182 ms	8128 KB	Output is correct

Subtask #3-2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	55 ms	8128 KB	Output is correct
2	Correct	257 ms	8124 KB	Output is correct
3	Correct	76 ms	8020 KB	Output is correct
4	Correct	289 ms	8140 KB	Output is correct
5	Correct	291 ms	8120 KB	Output is correct
6	Correct	258 ms	8124 KB	Output is correct
7	Correct	33 ms	8020 KB	Output is correct
8	Correct	37 ms	8120 KB	Output is correct
9	Correct	136 ms	8020 KB	Output is correct
10	Correct	182 ms	8128 KB	Output is correct
11	Correct	16 ms	8148 KB	Output is correct
12	Correct	16 ms	8140 KB	Output is correct
13	Correct	8 ms	8140 KB	Output is correct
14	Correct	57 ms	8020 KB	Output is correct
15	Correct	255 ms	8124 KB	Output is correct
16	Correct	75 ms	8020 KB	Output is correct
17	Correct	281 ms	8124 KB	Output is correct
18	Correct	286 ms	8020 KB	Output is correct
19	Correct	249 ms	8020 KB	Output is correct
20	Correct	32 ms	8020 KB	Output is correct
21	Correct	37 ms	8128 KB	Output is correct
22	Correct	135 ms	8124 KB	Output is correct
23	Correct	185 ms	8124 KB	Output is correct
24	Correct	491 ms	8020 KB	Output is correct
25	Correct	208 ms	8020 KB	Output is correct
26	Correct	581 ms	8124 KB	Output is correct
27	Correct	508 ms	8120 KB	Output is correct
28	Correct	517 ms	8120 KB	Output is correct

Subtask #4-1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	55 ms	8128 KB	Output is correct
2	Correct	257 ms	8124 KB	Output is correct
3	Correct	76 ms	8020 KB	Output is correct
4	Correct	289 ms	8140 KB	Output is correct
5	Correct	291 ms	8120 KB	Output is correct
6	Correct	258 ms	8124 KB	Output is correct
7	Correct	33 ms	8020 KB	Output is correct
8	Correct	37 ms	8120 KB	Output is correct
9	Correct	136 ms	8020 KB	Output is correct
10	Correct	182 ms	8128 KB	Output is correct
11	Correct	57 ms	8124 KB	Output is correct
12	Correct	257 ms	8120 KB	Output is correct
13	Correct	78 ms	8120 KB	Output is correct
14	Correct	271 ms	8020 KB	Output is correct
15	Correct	285 ms	8120 KB	Output is correct
16	Correct	264 ms	8020 KB	Output is correct
17	Correct	31 ms	8020 KB	Output is correct
18	Correct	36 ms	8124 KB	Output is correct
19	Correct	136 ms	8128 KB	Output is correct
20	Correct	185 ms	8124 KB	Output is correct
21	Correct	30 ms	8148 KB	Output is correct
22	Correct	44 ms	8128 KB	Output is correct
23	Correct	495 ms	8128 KB	Output is correct
24	Correct	236 ms	8148 KB	Output is correct
25	Correct	478 ms	8148 KB	Output is correct
26	Correct	581 ms	8124 KB	Output is correct
27	Correct	517 ms	8128 KB	Output is correct
28	Correct	386 ms	8148 KB	Output is correct

Subtask #4-2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	8020 KB	Output is correct
2	Correct	13 ms	8140 KB	Output is correct
3	Correct	7 ms	8144 KB	Output is correct
4	Correct	58 ms	8136 KB	Output is correct
5	Incorrect	883 ms	8140 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #5-1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	55 ms	8128 KB	Output is correct
2	Correct	257 ms	8124 KB	Output is correct
3	Correct	76 ms	8020 KB	Output is correct
4	Correct	289 ms	8140 KB	Output is correct
5	Correct	291 ms	8120 KB	Output is correct
6	Correct	258 ms	8124 KB	Output is correct
7	Correct	33 ms	8020 KB	Output is correct
8	Correct	37 ms	8120 KB	Output is correct
9	Correct	136 ms	8020 KB	Output is correct
10	Correct	182 ms	8128 KB	Output is correct
11	Correct	57 ms	8124 KB	Output is correct
12	Correct	257 ms	8120 KB	Output is correct
13	Correct	78 ms	8120 KB	Output is correct
14	Correct	271 ms	8020 KB	Output is correct
15	Correct	285 ms	8120 KB	Output is correct
16	Correct	264 ms	8020 KB	Output is correct
17	Correct	31 ms	8020 KB	Output is correct
18	Correct	36 ms	8124 KB	Output is correct
19	Correct	136 ms	8128 KB	Output is correct
20	Correct	185 ms	8124 KB	Output is correct
21	Correct	30 ms	8148 KB	Output is correct
22	Correct	44 ms	8128 KB	Output is correct
23	Correct	495 ms	8128 KB	Output is correct
24	Correct	236 ms	8148 KB	Output is correct
25	Correct	478 ms	8148 KB	Output is correct
26	Correct	581 ms	8124 KB	Output is correct
27	Correct	517 ms	8128 KB	Output is correct
28	Correct	386 ms	8148 KB	Output is correct
29	Correct	55 ms	8124 KB	Output is correct
30	Correct	272 ms	8124 KB	Output is correct
31	Correct	77 ms	8128 KB	Output is correct
32	Correct	277 ms	8124 KB	Output is correct
33	Correct	303 ms	8020 KB	Output is correct
34	Correct	258 ms	8148 KB	Output is correct
35	Correct	31 ms	8020 KB	Output is correct
36	Correct	39 ms	8020 KB	Output is correct
37	Correct	141 ms	8020 KB	Output is correct
38	Correct	197 ms	8020 KB	Output is correct
39	Correct	31 ms	8020 KB	Output is correct
40	Correct	43 ms	8144 KB	Output is correct
41	Correct	497 ms	8128 KB	Output is correct
42	Correct	221 ms	8128 KB	Output is correct
43	Correct	484 ms	8020 KB	Output is correct
44	Correct	585 ms	8020 KB	Output is correct
45	Correct	538 ms	8148 KB	Output is correct
46	Correct	381 ms	8128 KB	Output is correct
47	Correct	33 ms	8128 KB	Output is correct
48	Correct	50 ms	8140 KB	Output is correct
49	Correct	1108 ms	8128 KB	Output is correct
50	Correct	481 ms	8128 KB	Output is correct
51	Correct	1176 ms	8124 KB	Output is correct
52	Correct	1307 ms	8136 KB	Output is correct
53	Correct	1131 ms	8128 KB	Output is correct
54	Correct	943 ms	8140 KB	Output is correct

Subtask #5-2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	8020 KB	Output is correct
2	Correct	13 ms	8140 KB	Output is correct
3	Correct	7 ms	8144 KB	Output is correct
4	Correct	58 ms	8136 KB	Output is correct
5	Incorrect	883 ms	8140 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #6-1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	55 ms	8128 KB	Output is correct
2	Correct	257 ms	8124 KB	Output is correct
3	Correct	76 ms	8020 KB	Output is correct
4	Correct	289 ms	8140 KB	Output is correct
5	Correct	291 ms	8120 KB	Output is correct
6	Correct	258 ms	8124 KB	Output is correct
7	Correct	33 ms	8020 KB	Output is correct
8	Correct	37 ms	8120 KB	Output is correct
9	Correct	136 ms	8020 KB	Output is correct
10	Correct	182 ms	8128 KB	Output is correct
11	Correct	57 ms	8124 KB	Output is correct
12	Correct	257 ms	8120 KB	Output is correct
13	Correct	78 ms	8120 KB	Output is correct
14	Correct	271 ms	8020 KB	Output is correct
15	Correct	285 ms	8120 KB	Output is correct
16	Correct	264 ms	8020 KB	Output is correct
17	Correct	31 ms	8020 KB	Output is correct
18	Correct	36 ms	8124 KB	Output is correct
19	Correct	136 ms	8128 KB	Output is correct
20	Correct	185 ms	8124 KB	Output is correct
21	Correct	30 ms	8148 KB	Output is correct
22	Correct	44 ms	8128 KB	Output is correct
23	Correct	495 ms	8128 KB	Output is correct
24	Correct	236 ms	8148 KB	Output is correct
25	Correct	478 ms	8148 KB	Output is correct
26	Correct	581 ms	8124 KB	Output is correct
27	Correct	517 ms	8128 KB	Output is correct
28	Correct	386 ms	8148 KB	Output is correct
29	Correct	55 ms	8124 KB	Output is correct
30	Correct	272 ms	8124 KB	Output is correct
31	Correct	77 ms	8128 KB	Output is correct
32	Correct	277 ms	8124 KB	Output is correct
33	Correct	303 ms	8020 KB	Output is correct
34	Correct	258 ms	8148 KB	Output is correct
35	Correct	31 ms	8020 KB	Output is correct
36	Correct	39 ms	8020 KB	Output is correct
37	Correct	141 ms	8020 KB	Output is correct
38	Correct	197 ms	8020 KB	Output is correct
39	Correct	31 ms	8020 KB	Output is correct
40	Correct	43 ms	8144 KB	Output is correct
41	Correct	497 ms	8128 KB	Output is correct
42	Correct	221 ms	8128 KB	Output is correct
43	Correct	484 ms	8020 KB	Output is correct
44	Correct	585 ms	8020 KB	Output is correct
45	Correct	538 ms	8148 KB	Output is correct
46	Correct	381 ms	8128 KB	Output is correct
47	Correct	33 ms	8128 KB	Output is correct
48	Correct	50 ms	8140 KB	Output is correct
49	Correct	1108 ms	8128 KB	Output is correct
50	Correct	481 ms	8128 KB	Output is correct
51	Correct	1176 ms	8124 KB	Output is correct
52	Correct	1307 ms	8136 KB	Output is correct
53	Correct	1131 ms	8128 KB	Output is correct
54	Correct	943 ms	8140 KB	Output is correct
55	Correct	60 ms	8312 KB	Output is correct
56	Correct	264 ms	8124 KB	Output is correct
57	Correct	76 ms	8120 KB	Output is correct
58	Correct	278 ms	8020 KB	Output is correct
59	Correct	298 ms	8120 KB	Output is correct
60	Correct	255 ms	8020 KB	Output is correct
61	Correct	31 ms	8020 KB	Output is correct
62	Correct	37 ms	8020 KB	Output is correct
63	Correct	150 ms	8120 KB	Output is correct
64	Correct	183 ms	8020 KB	Output is correct
65	Correct	29 ms	8128 KB	Output is correct
66	Correct	42 ms	8020 KB	Output is correct
67	Correct	499 ms	8124 KB	Output is correct
68	Correct	215 ms	8148 KB	Output is correct
69	Correct	484 ms	8136 KB	Output is correct
70	Correct	571 ms	8128 KB	Output is correct
71	Correct	547 ms	8124 KB	Output is correct
72	Correct	380 ms	8148 KB	Output is correct
73	Correct	32 ms	8148 KB	Output is correct
74	Correct	48 ms	8020 KB	Output is correct
75	Correct	1102 ms	8128 KB	Output is correct
76	Correct	486 ms	8124 KB	Output is correct
77	Correct	1166 ms	8140 KB	Output is correct
78	Correct	1293 ms	8140 KB	Output is correct
79	Correct	1111 ms	8124 KB	Output is correct
80	Correct	976 ms	8124 KB	Output is correct
81	Correct	4297 ms	8148 KB	Output is correct
82	Correct	1885 ms	8148 KB	Output is correct
83	Correct	4231 ms	8148 KB	Output is correct
84	Correct	4926 ms	8148 KB	Output is correct
85	Correct	56 ms	8148 KB	Output is correct
86	Correct	56 ms	8148 KB	Output is correct
87	Correct	3807 ms	8148 KB	Output is correct

Subtask #6-2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	8020 KB	Output is correct
2	Correct	13 ms	8140 KB	Output is correct
3	Correct	7 ms	8144 KB	Output is correct
4	Correct	58 ms	8136 KB	Output is correct
5	Incorrect	883 ms	8140 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

답안 #575221

Compilation message