oj.uz

Submission #660451

# Submission time Handle Problem Language Result Execution time Memory
660451 2022-11-21T21:08:01 Z mychecksedad Uplifting Excursion (BOI22_vault) C++17
30 / 100
 3007 ms 720 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, F = 2147483646, K = 20;

ll m, l, a[N], sum, ans, b[N][2], dp[N]; // + and - parts
void solve(){
    cin >> m >> l;
    for(int i = 0; i < 2*m+1; ++i) cin >> a[i];
    sum = ans = 0;
    for(int i = 0; i < 2*m+1; ++i) sum += a[i] * (i - m), ans += a[i], b[i][0] = 0, b[i][1] = a[i];
    if(sum == l){
        cout << ans;
        return;
    }
    ll c;
    if(sum > l){
        c = 2*m;
        while(sum > l && c > m){
            if(c==m){
                c--;
                continue;
            }
            if(sum - a[c] * (c - m) >= l) sum -= a[c] * (c - m), ans -= a[c], b[c][0] = a[c], b[c][1] = 0;
            else{
                ll num = (sum - l + (c - m) - 1) / (c - m);
                ans -= num;
                sum -= num * (c - m);

                b[c][0] = num;
                b[c][1] = a[c] - num;

                break;
            }
            c--;
        }
    }else{
        c = 0;
        while(sum < l && c < m){
            if(c==m){
                c++;
                continue;
            }
            if(sum - a[c] * (c - m) <= l) sum -= a[c] * (c - m), ans -= a[c], b[c][0] = a[c], b[c][1] = 0;
            else{
                ll num = (sum - l) / (c - m);
                ans -= num;
                sum -= num * (c - m);

                b[c][0] = num;
                b[c][1] = a[c] - num;

                break;
            }
            c++;
        }
    }
    ll M = 20000;
    if(sum > l || l - sum > M){
        cout << "impossible";
        return;
    }
    int v = l - sum + M;
    for(int i = 0; i <= 2*M; ++i) dp[i] = MOD;
    dp[M] = 0;
    for(int i = 0; i <= 2*m; ++i){
        if(i==m) continue;
        for(int j = 2*M; j >= 0; --j){
            for(int k = 0; k <= min(b[i][0], 300*1ll); ++k){
                int val = j + k * (i - m);
                if(val >= 0 && val <= 2*M){
                    dp[val] = min(dp[val], dp[j] - k);
                }
            }
        }
        for(int j = 0; j <= 2*M; ++j){
            for(int k = 0; k <= min(b[i][1], 300*1ll); ++k){
                int val = j - k * (i - m);
                if(val >= 0 && val <= 2*M){
                    dp[val] = min(dp[val], dp[j] + k);
                }
            }
        }
    } 
    if(dp[v] > 1e7) cout << "impossible";
    else cout << ans - dp[v];
}




int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:105:16: warning: unused variable 'aa' [-Wunused-variable]
  105 |     int T = 1, aa;
      |                ^~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Incorrect 1 ms 596 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Incorrect 1 ms 596 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 596 KB Output is correct
2 Correct 203 ms 640 KB Output is correct
3 Correct 70 ms 636 KB Output is correct
4 Correct 229 ms 640 KB Output is correct
5 Correct 198 ms 640 KB Output is correct
6 Correct 91 ms 596 KB Output is correct
7 Correct 35 ms 596 KB Output is correct
8 Correct 22 ms 656 KB Output is correct
9 Correct 72 ms 644 KB Output is correct
10 Correct 132 ms 636 KB Output is correct

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 596 KB Output is correct
2 Correct 203 ms 640 KB Output is correct
3 Correct 70 ms 636 KB Output is correct
4 Correct 229 ms 640 KB Output is correct
5 Correct 198 ms 640 KB Output is correct
6 Correct 91 ms 596 KB Output is correct
7 Correct 35 ms 596 KB Output is correct
8 Correct 22 ms 656 KB Output is correct
9 Correct 72 ms 644 KB Output is correct
10 Correct 132 ms 636 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Incorrect 2 ms 596 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 596 KB Output is correct
2 Correct 203 ms 640 KB Output is correct
3 Correct 70 ms 636 KB Output is correct
4 Correct 229 ms 640 KB Output is correct
5 Correct 198 ms 640 KB Output is correct
6 Correct 91 ms 596 KB Output is correct
7 Correct 35 ms 596 KB Output is correct
8 Correct 22 ms 656 KB Output is correct
9 Correct 72 ms 644 KB Output is correct
10 Correct 132 ms 636 KB Output is correct
11 Correct 6 ms 660 KB Output is correct
12 Correct 197 ms 632 KB Output is correct
13 Correct 76 ms 720 KB Output is correct
14 Correct 208 ms 640 KB Output is correct
15 Correct 193 ms 640 KB Output is correct
16 Correct 94 ms 596 KB Output is correct
17 Correct 42 ms 636 KB Output is correct
18 Correct 22 ms 596 KB Output is correct
19 Correct 65 ms 636 KB Output is correct
20 Correct 131 ms 596 KB Output is correct
21 Correct 17 ms 596 KB Output is correct
22 Correct 17 ms 596 KB Output is correct
23 Correct 238 ms 636 KB Output is correct
24 Correct 163 ms 640 KB Output is correct
25 Correct 259 ms 640 KB Output is correct
26 Correct 365 ms 640 KB Output is correct
27 Correct 277 ms 640 KB Output is correct
28 Correct 299 ms 636 KB Output is correct

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Incorrect 1 ms 596 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 596 KB Output is correct
2 Correct 203 ms 640 KB Output is correct
3 Correct 70 ms 636 KB Output is correct
4 Correct 229 ms 640 KB Output is correct
5 Correct 198 ms 640 KB Output is correct
6 Correct 91 ms 596 KB Output is correct
7 Correct 35 ms 596 KB Output is correct
8 Correct 22 ms 656 KB Output is correct
9 Correct 72 ms 644 KB Output is correct
10 Correct 132 ms 636 KB Output is correct
11 Correct 6 ms 660 KB Output is correct
12 Correct 197 ms 632 KB Output is correct
13 Correct 76 ms 720 KB Output is correct
14 Correct 208 ms 640 KB Output is correct
15 Correct 193 ms 640 KB Output is correct
16 Correct 94 ms 596 KB Output is correct
17 Correct 42 ms 636 KB Output is correct
18 Correct 22 ms 596 KB Output is correct
19 Correct 65 ms 636 KB Output is correct
20 Correct 131 ms 596 KB Output is correct
21 Correct 17 ms 596 KB Output is correct
22 Correct 17 ms 596 KB Output is correct
23 Correct 238 ms 636 KB Output is correct
24 Correct 163 ms 640 KB Output is correct
25 Correct 259 ms 640 KB Output is correct
26 Correct 365 ms 640 KB Output is correct
27 Correct 277 ms 640 KB Output is correct
28 Correct 299 ms 636 KB Output is correct
29 Correct 8 ms 596 KB Output is correct
30 Correct 197 ms 636 KB Output is correct
31 Correct 67 ms 636 KB Output is correct
32 Correct 236 ms 596 KB Output is correct
33 Correct 208 ms 636 KB Output is correct
34 Correct 100 ms 632 KB Output is correct
35 Correct 43 ms 652 KB Output is correct
36 Correct 22 ms 596 KB Output is correct
37 Correct 58 ms 632 KB Output is correct
38 Correct 139 ms 632 KB Output is correct
39 Correct 25 ms 656 KB Output is correct
40 Correct 20 ms 656 KB Output is correct
41 Correct 281 ms 640 KB Output is correct
42 Correct 177 ms 596 KB Output is correct
43 Correct 282 ms 648 KB Output is correct
44 Correct 361 ms 636 KB Output is correct
45 Correct 278 ms 636 KB Output is correct
46 Correct 312 ms 596 KB Output is correct
47 Correct 34 ms 640 KB Output is correct
48 Correct 34 ms 596 KB Output is correct
49 Correct 600 ms 636 KB Output is correct
50 Correct 265 ms 640 KB Output is correct
51 Correct 655 ms 636 KB Output is correct
52 Correct 842 ms 636 KB Output is correct
53 Correct 594 ms 640 KB Output is correct
54 Correct 481 ms 640 KB Output is correct

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Incorrect 1 ms 596 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 596 KB Output is correct
2 Correct 203 ms 640 KB Output is correct
3 Correct 70 ms 636 KB Output is correct
4 Correct 229 ms 640 KB Output is correct
5 Correct 198 ms 640 KB Output is correct
6 Correct 91 ms 596 KB Output is correct
7 Correct 35 ms 596 KB Output is correct
8 Correct 22 ms 656 KB Output is correct
9 Correct 72 ms 644 KB Output is correct
10 Correct 132 ms 636 KB Output is correct
11 Correct 6 ms 660 KB Output is correct
12 Correct 197 ms 632 KB Output is correct
13 Correct 76 ms 720 KB Output is correct
14 Correct 208 ms 640 KB Output is correct
15 Correct 193 ms 640 KB Output is correct
16 Correct 94 ms 596 KB Output is correct
17 Correct 42 ms 636 KB Output is correct
18 Correct 22 ms 596 KB Output is correct
19 Correct 65 ms 636 KB Output is correct
20 Correct 131 ms 596 KB Output is correct
21 Correct 17 ms 596 KB Output is correct
22 Correct 17 ms 596 KB Output is correct
23 Correct 238 ms 636 KB Output is correct
24 Correct 163 ms 640 KB Output is correct
25 Correct 259 ms 640 KB Output is correct
26 Correct 365 ms 640 KB Output is correct
27 Correct 277 ms 640 KB Output is correct
28 Correct 299 ms 636 KB Output is correct
29 Correct 8 ms 596 KB Output is correct
30 Correct 197 ms 636 KB Output is correct
31 Correct 67 ms 636 KB Output is correct
32 Correct 236 ms 596 KB Output is correct
33 Correct 208 ms 636 KB Output is correct
34 Correct 100 ms 632 KB Output is correct
35 Correct 43 ms 652 KB Output is correct
36 Correct 22 ms 596 KB Output is correct
37 Correct 58 ms 632 KB Output is correct
38 Correct 139 ms 632 KB Output is correct
39 Correct 25 ms 656 KB Output is correct
40 Correct 20 ms 656 KB Output is correct
41 Correct 281 ms 640 KB Output is correct
42 Correct 177 ms 596 KB Output is correct
43 Correct 282 ms 648 KB Output is correct
44 Correct 361 ms 636 KB Output is correct
45 Correct 278 ms 636 KB Output is correct
46 Correct 312 ms 596 KB Output is correct
47 Correct 34 ms 640 KB Output is correct
48 Correct 34 ms 596 KB Output is correct
49 Correct 600 ms 636 KB Output is correct
50 Correct 265 ms 640 KB Output is correct
51 Correct 655 ms 636 KB Output is correct
52 Correct 842 ms 636 KB Output is correct
53 Correct 594 ms 640 KB Output is correct
54 Correct 481 ms 640 KB Output is correct
55 Correct 6 ms 656 KB Output is correct
56 Correct 200 ms 632 KB Output is correct
57 Correct 67 ms 640 KB Output is correct
58 Correct 238 ms 596 KB Output is correct
59 Correct 201 ms 636 KB Output is correct
60 Correct 95 ms 632 KB Output is correct
61 Correct 37 ms 636 KB Output is correct
62 Correct 22 ms 656 KB Output is correct
63 Correct 59 ms 640 KB Output is correct
64 Correct 128 ms 636 KB Output is correct
65 Correct 18 ms 660 KB Output is correct
66 Correct 22 ms 596 KB Output is correct
67 Correct 269 ms 640 KB Output is correct
68 Correct 158 ms 636 KB Output is correct
69 Correct 300 ms 652 KB Output is correct
70 Correct 349 ms 640 KB Output is correct
71 Correct 280 ms 640 KB Output is correct
72 Correct 297 ms 640 KB Output is correct
73 Correct 33 ms 596 KB Output is correct
74 Correct 34 ms 596 KB Output is correct
75 Correct 655 ms 636 KB Output is correct
76 Correct 255 ms 640 KB Output is correct
77 Correct 662 ms 640 KB Output is correct
78 Correct 848 ms 716 KB Output is correct
79 Correct 670 ms 640 KB Output is correct
80 Correct 485 ms 640 KB Output is correct
81 Correct 2292 ms 656 KB Output is correct
82 Correct 989 ms 716 KB Output is correct
83 Correct 2192 ms 652 KB Output is correct
84 Correct 3007 ms 596 KB Output is correct
85 Incorrect 93 ms 656 KB Output isn't correct
86 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Incorrect 1 ms 596 KB Output isn't correct
3 Halted 0 ms 0 KB -