oj.uz

답안 #660452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
660452 2022-11-21T21:14:11 Z mychecksedad Uplifting Excursion (BOI22_vault) C++17
30 / 100
 3235 ms 660 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;
        if(i < m) swap(b[i][0], b[i][1]);
        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:106:16: warning: unused variable 'aa' [-Wunused-variable]
  106 |     int T = 1, aa;
      |                ^~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 596 KB Output is correct
2 Correct 196 ms 636 KB Output is correct
3 Correct 64 ms 596 KB Output is correct
4 Correct 220 ms 636 KB Output is correct
5 Correct 181 ms 636 KB Output is correct
6 Correct 92 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 58 ms 644 KB Output is correct
10 Correct 124 ms 596 KB Output is correct

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 596 KB Output is correct
2 Correct 196 ms 636 KB Output is correct
3 Correct 64 ms 596 KB Output is correct
4 Correct 220 ms 636 KB Output is correct
5 Correct 181 ms 636 KB Output is correct
6 Correct 92 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 58 ms 644 KB Output is correct
10 Correct 124 ms 596 KB Output is correct
11 Incorrect 2 ms 596 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 596 KB Output is correct
2 Correct 196 ms 636 KB Output is correct
3 Correct 64 ms 596 KB Output is correct
4 Correct 220 ms 636 KB Output is correct
5 Correct 181 ms 636 KB Output is correct
6 Correct 92 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 58 ms 644 KB Output is correct
10 Correct 124 ms 596 KB Output is correct
11 Correct 6 ms 596 KB Output is correct
12 Correct 193 ms 636 KB Output is correct
13 Correct 67 ms 640 KB Output is correct
14 Correct 227 ms 632 KB Output is correct
15 Correct 196 ms 640 KB Output is correct
16 Correct 92 ms 632 KB Output is correct
17 Correct 36 ms 596 KB Output is correct
18 Correct 28 ms 596 KB Output is correct
19 Correct 73 ms 636 KB Output is correct
20 Correct 140 ms 640 KB Output is correct
21 Correct 20 ms 660 KB Output is correct
22 Correct 21 ms 656 KB Output is correct
23 Correct 279 ms 636 KB Output is correct
24 Correct 159 ms 636 KB Output is correct
25 Correct 264 ms 644 KB Output is correct
26 Correct 396 ms 640 KB Output is correct
27 Correct 279 ms 640 KB Output is correct
28 Correct 335 ms 636 KB Output is correct

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 596 KB Output is correct
2 Correct 196 ms 636 KB Output is correct
3 Correct 64 ms 596 KB Output is correct
4 Correct 220 ms 636 KB Output is correct
5 Correct 181 ms 636 KB Output is correct
6 Correct 92 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 58 ms 644 KB Output is correct
10 Correct 124 ms 596 KB Output is correct
11 Correct 6 ms 596 KB Output is correct
12 Correct 193 ms 636 KB Output is correct
13 Correct 67 ms 640 KB Output is correct
14 Correct 227 ms 632 KB Output is correct
15 Correct 196 ms 640 KB Output is correct
16 Correct 92 ms 632 KB Output is correct
17 Correct 36 ms 596 KB Output is correct
18 Correct 28 ms 596 KB Output is correct
19 Correct 73 ms 636 KB Output is correct
20 Correct 140 ms 640 KB Output is correct
21 Correct 20 ms 660 KB Output is correct
22 Correct 21 ms 656 KB Output is correct
23 Correct 279 ms 636 KB Output is correct
24 Correct 159 ms 636 KB Output is correct
25 Correct 264 ms 644 KB Output is correct
26 Correct 396 ms 640 KB Output is correct
27 Correct 279 ms 640 KB Output is correct
28 Correct 335 ms 636 KB Output is correct
29 Correct 5 ms 596 KB Output is correct
30 Correct 198 ms 596 KB Output is correct
31 Correct 86 ms 636 KB Output is correct
32 Correct 211 ms 596 KB Output is correct
33 Correct 201 ms 636 KB Output is correct
34 Correct 103 ms 640 KB Output is correct
35 Correct 43 ms 636 KB Output is correct
36 Correct 22 ms 596 KB Output is correct
37 Correct 56 ms 636 KB Output is correct
38 Correct 140 ms 636 KB Output is correct
39 Correct 21 ms 596 KB Output is correct
40 Correct 17 ms 596 KB Output is correct
41 Correct 262 ms 640 KB Output is correct
42 Correct 158 ms 644 KB Output is correct
43 Correct 275 ms 636 KB Output is correct
44 Correct 358 ms 640 KB Output is correct
45 Correct 266 ms 644 KB Output is correct
46 Correct 307 ms 640 KB Output is correct
47 Correct 31 ms 596 KB Output is correct
48 Correct 30 ms 596 KB Output is correct
49 Correct 627 ms 644 KB Output is correct
50 Correct 246 ms 640 KB Output is correct
51 Correct 658 ms 640 KB Output is correct
52 Correct 809 ms 640 KB Output is correct
53 Correct 611 ms 640 KB Output is correct
54 Correct 468 ms 644 KB Output is correct

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 596 KB Output is correct
2 Correct 196 ms 636 KB Output is correct
3 Correct 64 ms 596 KB Output is correct
4 Correct 220 ms 636 KB Output is correct
5 Correct 181 ms 636 KB Output is correct
6 Correct 92 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 58 ms 644 KB Output is correct
10 Correct 124 ms 596 KB Output is correct
11 Correct 6 ms 596 KB Output is correct
12 Correct 193 ms 636 KB Output is correct
13 Correct 67 ms 640 KB Output is correct
14 Correct 227 ms 632 KB Output is correct
15 Correct 196 ms 640 KB Output is correct
16 Correct 92 ms 632 KB Output is correct
17 Correct 36 ms 596 KB Output is correct
18 Correct 28 ms 596 KB Output is correct
19 Correct 73 ms 636 KB Output is correct
20 Correct 140 ms 640 KB Output is correct
21 Correct 20 ms 660 KB Output is correct
22 Correct 21 ms 656 KB Output is correct
23 Correct 279 ms 636 KB Output is correct
24 Correct 159 ms 636 KB Output is correct
25 Correct 264 ms 644 KB Output is correct
26 Correct 396 ms 640 KB Output is correct
27 Correct 279 ms 640 KB Output is correct
28 Correct 335 ms 636 KB Output is correct
29 Correct 5 ms 596 KB Output is correct
30 Correct 198 ms 596 KB Output is correct
31 Correct 86 ms 636 KB Output is correct
32 Correct 211 ms 596 KB Output is correct
33 Correct 201 ms 636 KB Output is correct
34 Correct 103 ms 640 KB Output is correct
35 Correct 43 ms 636 KB Output is correct
36 Correct 22 ms 596 KB Output is correct
37 Correct 56 ms 636 KB Output is correct
38 Correct 140 ms 636 KB Output is correct
39 Correct 21 ms 596 KB Output is correct
40 Correct 17 ms 596 KB Output is correct
41 Correct 262 ms 640 KB Output is correct
42 Correct 158 ms 644 KB Output is correct
43 Correct 275 ms 636 KB Output is correct
44 Correct 358 ms 640 KB Output is correct
45 Correct 266 ms 644 KB Output is correct
46 Correct 307 ms 640 KB Output is correct
47 Correct 31 ms 596 KB Output is correct
48 Correct 30 ms 596 KB Output is correct
49 Correct 627 ms 644 KB Output is correct
50 Correct 246 ms 640 KB Output is correct
51 Correct 658 ms 640 KB Output is correct
52 Correct 809 ms 640 KB Output is correct
53 Correct 611 ms 640 KB Output is correct
54 Correct 468 ms 644 KB Output is correct
55 Correct 5 ms 596 KB Output is correct
56 Correct 196 ms 644 KB Output is correct
57 Correct 64 ms 636 KB Output is correct
58 Correct 209 ms 632 KB Output is correct
59 Correct 185 ms 596 KB Output is correct
60 Correct 92 ms 640 KB Output is correct
61 Correct 35 ms 596 KB Output is correct
62 Correct 22 ms 656 KB Output is correct
63 Correct 57 ms 640 KB Output is correct
64 Correct 121 ms 636 KB Output is correct
65 Correct 15 ms 660 KB Output is correct
66 Correct 17 ms 596 KB Output is correct
67 Correct 232 ms 640 KB Output is correct
68 Correct 163 ms 636 KB Output is correct
69 Correct 255 ms 636 KB Output is correct
70 Correct 360 ms 640 KB Output is correct
71 Correct 274 ms 596 KB Output is correct
72 Correct 295 ms 640 KB Output is correct
73 Correct 35 ms 644 KB Output is correct
74 Correct 31 ms 660 KB Output is correct
75 Correct 550 ms 640 KB Output is correct
76 Correct 247 ms 644 KB Output is correct
77 Correct 643 ms 652 KB Output is correct
78 Correct 782 ms 644 KB Output is correct
79 Correct 610 ms 596 KB Output is correct
80 Correct 485 ms 648 KB Output is correct
81 Correct 2143 ms 656 KB Output is correct
82 Correct 968 ms 652 KB Output is correct
83 Correct 2098 ms 656 KB Output is correct
84 Correct 3235 ms 660 KB Output is correct
85 Incorrect 89 ms 652 KB Output isn't correct
86 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -