oj.uz

Submission #660449

# Submission time Handle Problem Language Result Execution time Memory
660449 2022-11-21T21:00:13 Z mychecksedad Uplifting Excursion (BOI22_vault) C++17
30 / 100
 5000 ms 1860 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 = 90000;
    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 6 ms 1748 KB Output is correct
2 Incorrect 6 ms 1748 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1748 KB Output is correct
2 Incorrect 6 ms 1748 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 23 ms 1748 KB Output is correct
2 Correct 864 ms 1736 KB Output is correct
3 Correct 302 ms 1728 KB Output is correct
4 Correct 922 ms 1724 KB Output is correct
5 Correct 828 ms 1748 KB Output is correct
6 Correct 403 ms 1728 KB Output is correct
7 Correct 167 ms 1740 KB Output is correct
8 Correct 108 ms 1748 KB Output is correct
9 Correct 247 ms 1724 KB Output is correct
10 Correct 593 ms 1728 KB Output is correct

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1748 KB Output is correct
2 Correct 864 ms 1736 KB Output is correct
3 Correct 302 ms 1728 KB Output is correct
4 Correct 922 ms 1724 KB Output is correct
5 Correct 828 ms 1748 KB Output is correct
6 Correct 403 ms 1728 KB Output is correct
7 Correct 167 ms 1740 KB Output is correct
8 Correct 108 ms 1748 KB Output is correct
9 Correct 247 ms 1724 KB Output is correct
10 Correct 593 ms 1728 KB Output is correct
11 Correct 6 ms 1748 KB Output is correct
12 Incorrect 6 ms 1748 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 23 ms 1748 KB Output is correct
2 Correct 864 ms 1736 KB Output is correct
3 Correct 302 ms 1728 KB Output is correct
4 Correct 922 ms 1724 KB Output is correct
5 Correct 828 ms 1748 KB Output is correct
6 Correct 403 ms 1728 KB Output is correct
7 Correct 167 ms 1740 KB Output is correct
8 Correct 108 ms 1748 KB Output is correct
9 Correct 247 ms 1724 KB Output is correct
10 Correct 593 ms 1728 KB Output is correct
11 Correct 24 ms 1748 KB Output is correct
12 Correct 946 ms 1728 KB Output is correct
13 Correct 315 ms 1728 KB Output is correct
14 Correct 945 ms 1728 KB Output is correct
15 Correct 829 ms 1740 KB Output is correct
16 Correct 421 ms 1748 KB Output is correct
17 Correct 170 ms 1736 KB Output is correct
18 Correct 99 ms 1748 KB Output is correct
19 Correct 246 ms 1620 KB Output is correct
20 Correct 566 ms 1724 KB Output is correct
21 Correct 78 ms 1620 KB Output is correct
22 Correct 73 ms 1748 KB Output is correct
23 Correct 1090 ms 1732 KB Output is correct
24 Correct 750 ms 1748 KB Output is correct
25 Correct 1213 ms 1728 KB Output is correct
26 Correct 1634 ms 1728 KB Output is correct
27 Correct 1209 ms 1748 KB Output is correct
28 Correct 1406 ms 1748 KB Output is correct

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1748 KB Output is correct
2 Incorrect 6 ms 1748 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 23 ms 1748 KB Output is correct
2 Correct 864 ms 1736 KB Output is correct
3 Correct 302 ms 1728 KB Output is correct
4 Correct 922 ms 1724 KB Output is correct
5 Correct 828 ms 1748 KB Output is correct
6 Correct 403 ms 1728 KB Output is correct
7 Correct 167 ms 1740 KB Output is correct
8 Correct 108 ms 1748 KB Output is correct
9 Correct 247 ms 1724 KB Output is correct
10 Correct 593 ms 1728 KB Output is correct
11 Correct 24 ms 1748 KB Output is correct
12 Correct 946 ms 1728 KB Output is correct
13 Correct 315 ms 1728 KB Output is correct
14 Correct 945 ms 1728 KB Output is correct
15 Correct 829 ms 1740 KB Output is correct
16 Correct 421 ms 1748 KB Output is correct
17 Correct 170 ms 1736 KB Output is correct
18 Correct 99 ms 1748 KB Output is correct
19 Correct 246 ms 1620 KB Output is correct
20 Correct 566 ms 1724 KB Output is correct
21 Correct 78 ms 1620 KB Output is correct
22 Correct 73 ms 1748 KB Output is correct
23 Correct 1090 ms 1732 KB Output is correct
24 Correct 750 ms 1748 KB Output is correct
25 Correct 1213 ms 1728 KB Output is correct
26 Correct 1634 ms 1728 KB Output is correct
27 Correct 1209 ms 1748 KB Output is correct
28 Correct 1406 ms 1748 KB Output is correct
29 Correct 23 ms 1752 KB Output is correct
30 Correct 864 ms 1740 KB Output is correct
31 Correct 294 ms 1748 KB Output is correct
32 Correct 915 ms 1728 KB Output is correct
33 Correct 826 ms 1748 KB Output is correct
34 Correct 415 ms 1724 KB Output is correct
35 Correct 157 ms 1620 KB Output is correct
36 Correct 100 ms 1728 KB Output is correct
37 Correct 251 ms 1740 KB Output is correct
38 Correct 564 ms 1620 KB Output is correct
39 Correct 81 ms 1740 KB Output is correct
40 Correct 71 ms 1748 KB Output is correct
41 Correct 1089 ms 1728 KB Output is correct
42 Correct 735 ms 1748 KB Output is correct
43 Correct 1193 ms 1728 KB Output is correct
44 Correct 1619 ms 1748 KB Output is correct
45 Correct 1212 ms 1748 KB Output is correct
46 Correct 1343 ms 1748 KB Output is correct
47 Correct 148 ms 1748 KB Output is correct
48 Correct 144 ms 1748 KB Output is correct
49 Correct 2726 ms 1748 KB Output is correct
50 Correct 1184 ms 1728 KB Output is correct
51 Correct 3085 ms 1748 KB Output is correct
52 Correct 3593 ms 1748 KB Output is correct
53 Correct 2809 ms 1748 KB Output is correct
54 Correct 2225 ms 1748 KB Output is correct

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1748 KB Output is correct
2 Incorrect 6 ms 1748 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 23 ms 1748 KB Output is correct
2 Correct 864 ms 1736 KB Output is correct
3 Correct 302 ms 1728 KB Output is correct
4 Correct 922 ms 1724 KB Output is correct
5 Correct 828 ms 1748 KB Output is correct
6 Correct 403 ms 1728 KB Output is correct
7 Correct 167 ms 1740 KB Output is correct
8 Correct 108 ms 1748 KB Output is correct
9 Correct 247 ms 1724 KB Output is correct
10 Correct 593 ms 1728 KB Output is correct
11 Correct 24 ms 1748 KB Output is correct
12 Correct 946 ms 1728 KB Output is correct
13 Correct 315 ms 1728 KB Output is correct
14 Correct 945 ms 1728 KB Output is correct
15 Correct 829 ms 1740 KB Output is correct
16 Correct 421 ms 1748 KB Output is correct
17 Correct 170 ms 1736 KB Output is correct
18 Correct 99 ms 1748 KB Output is correct
19 Correct 246 ms 1620 KB Output is correct
20 Correct 566 ms 1724 KB Output is correct
21 Correct 78 ms 1620 KB Output is correct
22 Correct 73 ms 1748 KB Output is correct
23 Correct 1090 ms 1732 KB Output is correct
24 Correct 750 ms 1748 KB Output is correct
25 Correct 1213 ms 1728 KB Output is correct
26 Correct 1634 ms 1728 KB Output is correct
27 Correct 1209 ms 1748 KB Output is correct
28 Correct 1406 ms 1748 KB Output is correct
29 Correct 23 ms 1752 KB Output is correct
30 Correct 864 ms 1740 KB Output is correct
31 Correct 294 ms 1748 KB Output is correct
32 Correct 915 ms 1728 KB Output is correct
33 Correct 826 ms 1748 KB Output is correct
34 Correct 415 ms 1724 KB Output is correct
35 Correct 157 ms 1620 KB Output is correct
36 Correct 100 ms 1728 KB Output is correct
37 Correct 251 ms 1740 KB Output is correct
38 Correct 564 ms 1620 KB Output is correct
39 Correct 81 ms 1740 KB Output is correct
40 Correct 71 ms 1748 KB Output is correct
41 Correct 1089 ms 1728 KB Output is correct
42 Correct 735 ms 1748 KB Output is correct
43 Correct 1193 ms 1728 KB Output is correct
44 Correct 1619 ms 1748 KB Output is correct
45 Correct 1212 ms 1748 KB Output is correct
46 Correct 1343 ms 1748 KB Output is correct
47 Correct 148 ms 1748 KB Output is correct
48 Correct 144 ms 1748 KB Output is correct
49 Correct 2726 ms 1748 KB Output is correct
50 Correct 1184 ms 1728 KB Output is correct
51 Correct 3085 ms 1748 KB Output is correct
52 Correct 3593 ms 1748 KB Output is correct
53 Correct 2809 ms 1748 KB Output is correct
54 Correct 2225 ms 1748 KB Output is correct
55 Correct 24 ms 1748 KB Output is correct
56 Correct 869 ms 1748 KB Output is correct
57 Correct 299 ms 1748 KB Output is correct
58 Correct 933 ms 1748 KB Output is correct
59 Correct 856 ms 1860 KB Output is correct
60 Correct 444 ms 1736 KB Output is correct
61 Correct 160 ms 1740 KB Output is correct
62 Correct 101 ms 1748 KB Output is correct
63 Correct 252 ms 1748 KB Output is correct
64 Correct 574 ms 1748 KB Output is correct
65 Correct 79 ms 1732 KB Output is correct
66 Correct 84 ms 1748 KB Output is correct
67 Correct 1111 ms 1748 KB Output is correct
68 Correct 767 ms 1748 KB Output is correct
69 Correct 1201 ms 1748 KB Output is correct
70 Correct 1643 ms 1748 KB Output is correct
71 Correct 1198 ms 1748 KB Output is correct
72 Correct 1353 ms 1736 KB Output is correct
73 Correct 152 ms 1748 KB Output is correct
74 Correct 144 ms 1748 KB Output is correct
75 Correct 2681 ms 1748 KB Output is correct
76 Correct 1194 ms 1748 KB Output is correct
77 Correct 3095 ms 1748 KB Output is correct
78 Correct 3652 ms 1748 KB Output is correct
79 Correct 2753 ms 1748 KB Output is correct
80 Correct 2216 ms 1748 KB Output is correct
81 Execution timed out 5048 ms 1764 KB Time limit exceeded
82 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

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