Submission #574307

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
574307	2022-06-08T10:09:44 Z	8e7	Uplifting Excursion (BOI22_vault)	C++17	20 / 100	5000 ms	35560 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 9000005
    #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);	
    	ll mins = 0, ans = 0;
    	for (int i = 0;i < 2*m+1;i++) {
    		cin >> a[i];
    		if (i == m) ans += a[i], 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 < 2 * m+1;i++) {
    		if (i < m) mins += ex[i] * (i - 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);
    				}
    			}
    		}
    	}
    	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

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	60 ms	35524 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	60 ms	35524 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3-1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	289 ms	35540 KB	Output is correct
2	Correct	1232 ms	35540 KB	Output is correct
3	Correct	352 ms	35420 KB	Output is correct
4	Correct	1341 ms	35520 KB	Output is correct
5	Correct	1540 ms	35524 KB	Output is correct
6	Correct	1300 ms	35524 KB	Output is correct
7	Correct	175 ms	35516 KB	Output is correct
8	Correct	239 ms	35524 KB	Output is correct
9	Correct	701 ms	35524 KB	Output is correct
10	Correct	1047 ms	35520 KB	Output is correct

Subtask #3-2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	289 ms	35540 KB	Output is correct
2	Correct	1232 ms	35540 KB	Output is correct
3	Correct	352 ms	35420 KB	Output is correct
4	Correct	1341 ms	35520 KB	Output is correct
5	Correct	1540 ms	35524 KB	Output is correct
6	Correct	1300 ms	35524 KB	Output is correct
7	Correct	175 ms	35516 KB	Output is correct
8	Correct	239 ms	35524 KB	Output is correct
9	Correct	701 ms	35524 KB	Output is correct
10	Correct	1047 ms	35520 KB	Output is correct
11	Incorrect	69 ms	35540 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #4-1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	289 ms	35540 KB	Output is correct
2	Correct	1232 ms	35540 KB	Output is correct
3	Correct	352 ms	35420 KB	Output is correct
4	Correct	1341 ms	35520 KB	Output is correct
5	Correct	1540 ms	35524 KB	Output is correct
6	Correct	1300 ms	35524 KB	Output is correct
7	Correct	175 ms	35516 KB	Output is correct
8	Correct	239 ms	35524 KB	Output is correct
9	Correct	701 ms	35524 KB	Output is correct
10	Correct	1047 ms	35520 KB	Output is correct
11	Correct	296 ms	35524 KB	Output is correct
12	Correct	1394 ms	35524 KB	Output is correct
13	Correct	434 ms	35524 KB	Output is correct
14	Correct	1559 ms	35520 KB	Output is correct
15	Correct	1848 ms	35520 KB	Output is correct
16	Correct	1555 ms	35520 KB	Output is correct
17	Correct	198 ms	35516 KB	Output is correct
18	Correct	202 ms	35540 KB	Output is correct
19	Correct	798 ms	35524 KB	Output is correct
20	Correct	958 ms	35524 KB	Output is correct
21	Correct	160 ms	35532 KB	Output is correct
22	Correct	221 ms	35524 KB	Output is correct
23	Correct	2479 ms	35540 KB	Output is correct
24	Correct	1237 ms	35528 KB	Output is correct
25	Correct	2785 ms	35524 KB	Output is correct
26	Correct	3414 ms	35540 KB	Output is correct
27	Correct	2995 ms	35524 KB	Output is correct
28	Correct	2285 ms	35524 KB	Output is correct

Subtask #4-2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	60 ms	35524 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5-1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	289 ms	35540 KB	Output is correct
2	Correct	1232 ms	35540 KB	Output is correct
3	Correct	352 ms	35420 KB	Output is correct
4	Correct	1341 ms	35520 KB	Output is correct
5	Correct	1540 ms	35524 KB	Output is correct
6	Correct	1300 ms	35524 KB	Output is correct
7	Correct	175 ms	35516 KB	Output is correct
8	Correct	239 ms	35524 KB	Output is correct
9	Correct	701 ms	35524 KB	Output is correct
10	Correct	1047 ms	35520 KB	Output is correct
11	Correct	296 ms	35524 KB	Output is correct
12	Correct	1394 ms	35524 KB	Output is correct
13	Correct	434 ms	35524 KB	Output is correct
14	Correct	1559 ms	35520 KB	Output is correct
15	Correct	1848 ms	35520 KB	Output is correct
16	Correct	1555 ms	35520 KB	Output is correct
17	Correct	198 ms	35516 KB	Output is correct
18	Correct	202 ms	35540 KB	Output is correct
19	Correct	798 ms	35524 KB	Output is correct
20	Correct	958 ms	35524 KB	Output is correct
21	Correct	160 ms	35532 KB	Output is correct
22	Correct	221 ms	35524 KB	Output is correct
23	Correct	2479 ms	35540 KB	Output is correct
24	Correct	1237 ms	35528 KB	Output is correct
25	Correct	2785 ms	35524 KB	Output is correct
26	Correct	3414 ms	35540 KB	Output is correct
27	Correct	2995 ms	35524 KB	Output is correct
28	Correct	2285 ms	35524 KB	Output is correct
29	Correct	293 ms	35520 KB	Output is correct
30	Correct	1485 ms	35520 KB	Output is correct
31	Correct	443 ms	35528 KB	Output is correct
32	Correct	1596 ms	35540 KB	Output is correct
33	Correct	1632 ms	35540 KB	Output is correct
34	Correct	1465 ms	35540 KB	Output is correct
35	Correct	191 ms	35524 KB	Output is correct
36	Correct	219 ms	35524 KB	Output is correct
37	Correct	842 ms	35520 KB	Output is correct
38	Correct	1012 ms	35524 KB	Output is correct
39	Correct	165 ms	35524 KB	Output is correct
40	Correct	245 ms	35524 KB	Output is correct
41	Correct	2663 ms	35540 KB	Output is correct
42	Correct	1237 ms	35540 KB	Output is correct
43	Correct	3093 ms	35540 KB	Output is correct
44	Correct	3261 ms	35540 KB	Output is correct
45	Correct	2972 ms	35524 KB	Output is correct
46	Correct	2093 ms	35520 KB	Output is correct
47	Correct	173 ms	35540 KB	Output is correct
48	Correct	250 ms	35524 KB	Output is correct
49	Execution timed out	5068 ms	35560 KB	Time limit exceeded
50	Halted	0 ms	0 KB	-

Subtask #5-2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	60 ms	35524 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6-1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	289 ms	35540 KB	Output is correct
2	Correct	1232 ms	35540 KB	Output is correct
3	Correct	352 ms	35420 KB	Output is correct
4	Correct	1341 ms	35520 KB	Output is correct
5	Correct	1540 ms	35524 KB	Output is correct
6	Correct	1300 ms	35524 KB	Output is correct
7	Correct	175 ms	35516 KB	Output is correct
8	Correct	239 ms	35524 KB	Output is correct
9	Correct	701 ms	35524 KB	Output is correct
10	Correct	1047 ms	35520 KB	Output is correct
11	Correct	296 ms	35524 KB	Output is correct
12	Correct	1394 ms	35524 KB	Output is correct
13	Correct	434 ms	35524 KB	Output is correct
14	Correct	1559 ms	35520 KB	Output is correct
15	Correct	1848 ms	35520 KB	Output is correct
16	Correct	1555 ms	35520 KB	Output is correct
17	Correct	198 ms	35516 KB	Output is correct
18	Correct	202 ms	35540 KB	Output is correct
19	Correct	798 ms	35524 KB	Output is correct
20	Correct	958 ms	35524 KB	Output is correct
21	Correct	160 ms	35532 KB	Output is correct
22	Correct	221 ms	35524 KB	Output is correct
23	Correct	2479 ms	35540 KB	Output is correct
24	Correct	1237 ms	35528 KB	Output is correct
25	Correct	2785 ms	35524 KB	Output is correct
26	Correct	3414 ms	35540 KB	Output is correct
27	Correct	2995 ms	35524 KB	Output is correct
28	Correct	2285 ms	35524 KB	Output is correct
29	Correct	293 ms	35520 KB	Output is correct
30	Correct	1485 ms	35520 KB	Output is correct
31	Correct	443 ms	35528 KB	Output is correct
32	Correct	1596 ms	35540 KB	Output is correct
33	Correct	1632 ms	35540 KB	Output is correct
34	Correct	1465 ms	35540 KB	Output is correct
35	Correct	191 ms	35524 KB	Output is correct
36	Correct	219 ms	35524 KB	Output is correct
37	Correct	842 ms	35520 KB	Output is correct
38	Correct	1012 ms	35524 KB	Output is correct
39	Correct	165 ms	35524 KB	Output is correct
40	Correct	245 ms	35524 KB	Output is correct
41	Correct	2663 ms	35540 KB	Output is correct
42	Correct	1237 ms	35540 KB	Output is correct
43	Correct	3093 ms	35540 KB	Output is correct
44	Correct	3261 ms	35540 KB	Output is correct
45	Correct	2972 ms	35524 KB	Output is correct
46	Correct	2093 ms	35520 KB	Output is correct
47	Correct	173 ms	35540 KB	Output is correct
48	Correct	250 ms	35524 KB	Output is correct
49	Execution timed out	5068 ms	35560 KB	Time limit exceeded
50	Halted	0 ms	0 KB	-

Subtask #6-2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	60 ms	35524 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Submission #574307

Compilation message