oj.uz

Submission #660450

# Submission time Handle Problem Language Result Execution time Memory
660450 2022-11-21T21:06:21 Z mychecksedad Uplifting Excursion (BOI22_vault) C++17
30 / 100
 1235 ms 508 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 = 10000;
    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 1 ms 468 KB Output is correct
2 Incorrect 1 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Incorrect 1 ms 468 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 3 ms 468 KB Output is correct
2 Correct 96 ms 468 KB Output is correct
3 Correct 34 ms 476 KB Output is correct
4 Correct 103 ms 468 KB Output is correct
5 Correct 90 ms 476 KB Output is correct
6 Correct 47 ms 468 KB Output is correct
7 Correct 17 ms 468 KB Output is correct
8 Correct 14 ms 468 KB Output is correct
9 Correct 29 ms 492 KB Output is correct
10 Correct 63 ms 468 KB Output is correct

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 96 ms 468 KB Output is correct
3 Correct 34 ms 476 KB Output is correct
4 Correct 103 ms 468 KB Output is correct
5 Correct 90 ms 476 KB Output is correct
6 Correct 47 ms 468 KB Output is correct
7 Correct 17 ms 468 KB Output is correct
8 Correct 14 ms 468 KB Output is correct
9 Correct 29 ms 492 KB Output is correct
10 Correct 63 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Incorrect 1 ms 468 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 3 ms 468 KB Output is correct
2 Correct 96 ms 468 KB Output is correct
3 Correct 34 ms 476 KB Output is correct
4 Correct 103 ms 468 KB Output is correct
5 Correct 90 ms 476 KB Output is correct
6 Correct 47 ms 468 KB Output is correct
7 Correct 17 ms 468 KB Output is correct
8 Correct 14 ms 468 KB Output is correct
9 Correct 29 ms 492 KB Output is correct
10 Correct 63 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 102 ms 480 KB Output is correct
13 Correct 33 ms 468 KB Output is correct
14 Correct 105 ms 476 KB Output is correct
15 Correct 100 ms 472 KB Output is correct
16 Correct 46 ms 468 KB Output is correct
17 Correct 17 ms 496 KB Output is correct
18 Correct 12 ms 468 KB Output is correct
19 Correct 28 ms 496 KB Output is correct
20 Correct 78 ms 476 KB Output is correct
21 Correct 9 ms 496 KB Output is correct
22 Correct 10 ms 500 KB Output is correct
23 Correct 123 ms 496 KB Output is correct
24 Correct 76 ms 468 KB Output is correct
25 Correct 125 ms 468 KB Output is correct
26 Correct 166 ms 468 KB Output is correct
27 Correct 125 ms 484 KB Output is correct
28 Correct 147 ms 492 KB Output is correct

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Incorrect 1 ms 468 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 3 ms 468 KB Output is correct
2 Correct 96 ms 468 KB Output is correct
3 Correct 34 ms 476 KB Output is correct
4 Correct 103 ms 468 KB Output is correct
5 Correct 90 ms 476 KB Output is correct
6 Correct 47 ms 468 KB Output is correct
7 Correct 17 ms 468 KB Output is correct
8 Correct 14 ms 468 KB Output is correct
9 Correct 29 ms 492 KB Output is correct
10 Correct 63 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 102 ms 480 KB Output is correct
13 Correct 33 ms 468 KB Output is correct
14 Correct 105 ms 476 KB Output is correct
15 Correct 100 ms 472 KB Output is correct
16 Correct 46 ms 468 KB Output is correct
17 Correct 17 ms 496 KB Output is correct
18 Correct 12 ms 468 KB Output is correct
19 Correct 28 ms 496 KB Output is correct
20 Correct 78 ms 476 KB Output is correct
21 Correct 9 ms 496 KB Output is correct
22 Correct 10 ms 500 KB Output is correct
23 Correct 123 ms 496 KB Output is correct
24 Correct 76 ms 468 KB Output is correct
25 Correct 125 ms 468 KB Output is correct
26 Correct 166 ms 468 KB Output is correct
27 Correct 125 ms 484 KB Output is correct
28 Correct 147 ms 492 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 96 ms 468 KB Output is correct
31 Correct 34 ms 468 KB Output is correct
32 Correct 108 ms 476 KB Output is correct
33 Correct 96 ms 476 KB Output is correct
34 Correct 48 ms 468 KB Output is correct
35 Correct 17 ms 496 KB Output is correct
36 Correct 11 ms 492 KB Output is correct
37 Correct 30 ms 468 KB Output is correct
38 Correct 62 ms 476 KB Output is correct
39 Correct 9 ms 468 KB Output is correct
40 Correct 9 ms 468 KB Output is correct
41 Correct 116 ms 468 KB Output is correct
42 Correct 89 ms 480 KB Output is correct
43 Correct 123 ms 476 KB Output is correct
44 Correct 166 ms 484 KB Output is correct
45 Correct 131 ms 480 KB Output is correct
46 Correct 153 ms 480 KB Output is correct
47 Correct 17 ms 500 KB Output is correct
48 Correct 17 ms 468 KB Output is correct
49 Correct 264 ms 468 KB Output is correct
50 Correct 116 ms 488 KB Output is correct
51 Correct 311 ms 480 KB Output is correct
52 Correct 350 ms 476 KB Output is correct
53 Correct 266 ms 476 KB Output is correct
54 Correct 231 ms 480 KB Output is correct

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Incorrect 1 ms 468 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 3 ms 468 KB Output is correct
2 Correct 96 ms 468 KB Output is correct
3 Correct 34 ms 476 KB Output is correct
4 Correct 103 ms 468 KB Output is correct
5 Correct 90 ms 476 KB Output is correct
6 Correct 47 ms 468 KB Output is correct
7 Correct 17 ms 468 KB Output is correct
8 Correct 14 ms 468 KB Output is correct
9 Correct 29 ms 492 KB Output is correct
10 Correct 63 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 102 ms 480 KB Output is correct
13 Correct 33 ms 468 KB Output is correct
14 Correct 105 ms 476 KB Output is correct
15 Correct 100 ms 472 KB Output is correct
16 Correct 46 ms 468 KB Output is correct
17 Correct 17 ms 496 KB Output is correct
18 Correct 12 ms 468 KB Output is correct
19 Correct 28 ms 496 KB Output is correct
20 Correct 78 ms 476 KB Output is correct
21 Correct 9 ms 496 KB Output is correct
22 Correct 10 ms 500 KB Output is correct
23 Correct 123 ms 496 KB Output is correct
24 Correct 76 ms 468 KB Output is correct
25 Correct 125 ms 468 KB Output is correct
26 Correct 166 ms 468 KB Output is correct
27 Correct 125 ms 484 KB Output is correct
28 Correct 147 ms 492 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 96 ms 468 KB Output is correct
31 Correct 34 ms 468 KB Output is correct
32 Correct 108 ms 476 KB Output is correct
33 Correct 96 ms 476 KB Output is correct
34 Correct 48 ms 468 KB Output is correct
35 Correct 17 ms 496 KB Output is correct
36 Correct 11 ms 492 KB Output is correct
37 Correct 30 ms 468 KB Output is correct
38 Correct 62 ms 476 KB Output is correct
39 Correct 9 ms 468 KB Output is correct
40 Correct 9 ms 468 KB Output is correct
41 Correct 116 ms 468 KB Output is correct
42 Correct 89 ms 480 KB Output is correct
43 Correct 123 ms 476 KB Output is correct
44 Correct 166 ms 484 KB Output is correct
45 Correct 131 ms 480 KB Output is correct
46 Correct 153 ms 480 KB Output is correct
47 Correct 17 ms 500 KB Output is correct
48 Correct 17 ms 468 KB Output is correct
49 Correct 264 ms 468 KB Output is correct
50 Correct 116 ms 488 KB Output is correct
51 Correct 311 ms 480 KB Output is correct
52 Correct 350 ms 476 KB Output is correct
53 Correct 266 ms 476 KB Output is correct
54 Correct 231 ms 480 KB Output is correct
55 Correct 3 ms 468 KB Output is correct
56 Correct 101 ms 476 KB Output is correct
57 Correct 33 ms 468 KB Output is correct
58 Correct 118 ms 472 KB Output is correct
59 Correct 92 ms 468 KB Output is correct
60 Correct 46 ms 468 KB Output is correct
61 Correct 17 ms 496 KB Output is correct
62 Correct 11 ms 468 KB Output is correct
63 Correct 29 ms 496 KB Output is correct
64 Correct 65 ms 476 KB Output is correct
65 Correct 10 ms 500 KB Output is correct
66 Correct 9 ms 500 KB Output is correct
67 Correct 129 ms 492 KB Output is correct
68 Correct 78 ms 468 KB Output is correct
69 Correct 126 ms 480 KB Output is correct
70 Correct 178 ms 480 KB Output is correct
71 Correct 139 ms 476 KB Output is correct
72 Correct 145 ms 468 KB Output is correct
73 Correct 18 ms 468 KB Output is correct
74 Correct 17 ms 492 KB Output is correct
75 Correct 267 ms 480 KB Output is correct
76 Correct 119 ms 480 KB Output is correct
77 Correct 290 ms 480 KB Output is correct
78 Correct 366 ms 480 KB Output is correct
79 Correct 261 ms 480 KB Output is correct
80 Correct 223 ms 468 KB Output is correct
81 Correct 928 ms 500 KB Output is correct
82 Correct 431 ms 468 KB Output is correct
83 Correct 923 ms 496 KB Output is correct
84 Correct 1235 ms 508 KB Output is correct
85 Incorrect 47 ms 492 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 1 ms 468 KB Output is correct
2 Incorrect 1 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -