oj.uz

답안 #857726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
857726 2023-10-06T17:15:55 Z vgtcross Uplifting Excursion (BOI22_vault) C++17
20 / 100
 3806 ms 9812 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int, int>;

const int N = 1100000;
int dp[N], nx[N];
ll dp2[N], nx2[N];

void solve() {
    int m;
    ll x;
    cin >> m >> x;
    vector<ll> a(2*m+1);
    ll maxa = 0;
    for (ll &i : a) {
        cin >> i;
        maxa = max(maxa, i);
    }
    
    if (maxa <= 100) {
        ll mins = 0, maxs = 0;
        vector<pii> v;
        for (int i = -m; i <= m; ++i) {
            int f = a[i+m];
            
            if (i < 0) mins += f * i;
            else maxs += f * i;
            
            int z = 1;
            while (f > z) {
                v.push_back({z * i, z});
                f -= z;
                z *= 2;
            }
            if (f > 0) v.push_back({f * i, f});
        }
        
        memset(dp, 0xc0, sizeof dp);
        memset(nx, 0xc0, sizeof nx);
        dp[0] = nx[0] = 0;
        for (pii p : v) {
            for (int i = -550000; i <= 550000; ++i) {
                int j = i + p.first;
                if (-550000 <= j && j <= 550000) nx[(j + N) % N] = max(nx[(j + N) % N], dp[(i + N) % N] + p.second);
            }
            copy(nx, nx+N, dp);
        }
        
        if (x < mins || x > maxs) cout << "impossible\n";
        else cout << (dp[(x + N) % N] < 0 ? "impossible" : to_string(dp[(x + N) % N])) << '\n';
    } else {
        ll maxs = 0;
        vector<pii> v[m+1];
        for (int i = 1; i <= m; ++i) {
            ll f = a[i+m];
            
            maxs += f * i;
            
            f = min(f, (ll) m-1);
            
            int z = 1;
            while (f > z) {
                v[i].push_back({z * i, z});
                f -= z;
                z *= 2;
            }
            if (f > 0) v[i].push_back({f * i, f});
        }
        
        ll ans = -1;
        ll ofs = 0;
        for (int k = 1; k <= m; ++k) {
            memset(dp2, 0xc0, 77000 * sizeof(ll));
            memset(nx2, 0xc0, 77000 * sizeof(ll));
            dp2[0] = nx2[0] = 0;
            for (int b = 1; b <= m; ++b) if (b != k) {
                for (pii p : v[b]) {
                    for (int i = 0; i <= 70000; ++i) {
                        int j = i + p.first;
                        if (j <= 70000) nx2[j] = max(nx2[j], dp2[i] + p.second);
                    }
                    copy(nx2, nx2+77000, dp2);
                }
            }
            
            for (int i = 0; i <= 70000; ++i) {
                if (i + ofs > x) break;
                if ((x - i - ofs) % k == 0) ans = max(ans, dp2[i] + (x - i - ofs) / k);
            }
            
            ofs += max(0ll, a[k+m] - m + 1) * k;
        }
        
        cout << (ans == -1 ? "impossible" : to_string(ans + a[m])) << '\n';
    }
}

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    
    solve();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 9560 KB Output is correct
2 Correct 20 ms 9564 KB Output is correct
3 Correct 10 ms 9700 KB Output is correct
4 Correct 85 ms 9564 KB Output is correct
5 Correct 1341 ms 9812 KB Output is correct
6 Correct 1338 ms 9680 KB Output is correct
7 Correct 548 ms 9564 KB Output is correct
8 Correct 1336 ms 9688 KB Output is correct
9 Correct 1655 ms 9692 KB Output is correct
10 Correct 47 ms 9564 KB Output is correct
11 Correct 52 ms 9564 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 9560 KB Output is correct
2 Correct 20 ms 9564 KB Output is correct
3 Correct 10 ms 9700 KB Output is correct
4 Correct 85 ms 9564 KB Output is correct
5 Correct 1341 ms 9812 KB Output is correct
6 Correct 1338 ms 9680 KB Output is correct
7 Correct 548 ms 9564 KB Output is correct
8 Correct 1336 ms 9688 KB Output is correct
9 Correct 1655 ms 9692 KB Output is correct
10 Correct 47 ms 9564 KB Output is correct
11 Correct 52 ms 9564 KB Output is correct
12 Correct 26 ms 9564 KB Output is correct
13 Correct 21 ms 9564 KB Output is correct
14 Correct 10 ms 9564 KB Output is correct
15 Correct 83 ms 9564 KB Output is correct
16 Correct 1302 ms 9684 KB Output is correct
17 Correct 1320 ms 9684 KB Output is correct
18 Correct 550 ms 9680 KB Output is correct
19 Correct 1320 ms 9684 KB Output is correct
20 Correct 1609 ms 9692 KB Output is correct
21 Correct 53 ms 9564 KB Output is correct
22 Correct 51 ms 9808 KB Output is correct
23 Correct 3174 ms 9704 KB Output is correct
24 Correct 3135 ms 9712 KB Output is correct
25 Correct 1155 ms 9684 KB Output is correct
26 Correct 3782 ms 9704 KB Output is correct
27 Correct 3806 ms 9708 KB Output is correct
28 Correct 55 ms 9560 KB Output is correct
29 Correct 73 ms 9564 KB Output is correct

Subtask #3-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 9680 KB Output is correct
2 Incorrect 324 ms 4712 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 9680 KB Output is correct
2 Incorrect 324 ms 4712 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 9680 KB Output is correct
2 Incorrect 324 ms 4712 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 9560 KB Output is correct
2 Correct 20 ms 9564 KB Output is correct
3 Correct 10 ms 9700 KB Output is correct
4 Correct 85 ms 9564 KB Output is correct
5 Correct 1341 ms 9812 KB Output is correct
6 Correct 1338 ms 9680 KB Output is correct
7 Correct 548 ms 9564 KB Output is correct
8 Correct 1336 ms 9688 KB Output is correct
9 Correct 1655 ms 9692 KB Output is correct
10 Correct 47 ms 9564 KB Output is correct
11 Correct 52 ms 9564 KB Output is correct
12 Correct 82 ms 9680 KB Output is correct
13 Incorrect 324 ms 4712 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 9680 KB Output is correct
2 Incorrect 324 ms 4712 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 9560 KB Output is correct
2 Correct 20 ms 9564 KB Output is correct
3 Correct 10 ms 9700 KB Output is correct
4 Correct 85 ms 9564 KB Output is correct
5 Correct 1341 ms 9812 KB Output is correct
6 Correct 1338 ms 9680 KB Output is correct
7 Correct 548 ms 9564 KB Output is correct
8 Correct 1336 ms 9688 KB Output is correct
9 Correct 1655 ms 9692 KB Output is correct
10 Correct 47 ms 9564 KB Output is correct
11 Correct 52 ms 9564 KB Output is correct
12 Correct 26 ms 9564 KB Output is correct
13 Correct 21 ms 9564 KB Output is correct
14 Correct 10 ms 9564 KB Output is correct
15 Correct 83 ms 9564 KB Output is correct
16 Correct 1302 ms 9684 KB Output is correct
17 Correct 1320 ms 9684 KB Output is correct
18 Correct 550 ms 9680 KB Output is correct
19 Correct 1320 ms 9684 KB Output is correct
20 Correct 1609 ms 9692 KB Output is correct
21 Correct 53 ms 9564 KB Output is correct
22 Correct 51 ms 9808 KB Output is correct
23 Correct 3174 ms 9704 KB Output is correct
24 Correct 3135 ms 9712 KB Output is correct
25 Correct 1155 ms 9684 KB Output is correct
26 Correct 3782 ms 9704 KB Output is correct
27 Correct 3806 ms 9708 KB Output is correct
28 Correct 55 ms 9560 KB Output is correct
29 Correct 73 ms 9564 KB Output is correct
30 Correct 82 ms 9680 KB Output is correct
31 Incorrect 324 ms 4712 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 9680 KB Output is correct
2 Incorrect 324 ms 4712 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 9560 KB Output is correct
2 Correct 20 ms 9564 KB Output is correct
3 Correct 10 ms 9700 KB Output is correct
4 Correct 85 ms 9564 KB Output is correct
5 Correct 1341 ms 9812 KB Output is correct
6 Correct 1338 ms 9680 KB Output is correct
7 Correct 548 ms 9564 KB Output is correct
8 Correct 1336 ms 9688 KB Output is correct
9 Correct 1655 ms 9692 KB Output is correct
10 Correct 47 ms 9564 KB Output is correct
11 Correct 52 ms 9564 KB Output is correct
12 Correct 26 ms 9564 KB Output is correct
13 Correct 21 ms 9564 KB Output is correct
14 Correct 10 ms 9564 KB Output is correct
15 Correct 83 ms 9564 KB Output is correct
16 Correct 1302 ms 9684 KB Output is correct
17 Correct 1320 ms 9684 KB Output is correct
18 Correct 550 ms 9680 KB Output is correct
19 Correct 1320 ms 9684 KB Output is correct
20 Correct 1609 ms 9692 KB Output is correct
21 Correct 53 ms 9564 KB Output is correct
22 Correct 51 ms 9808 KB Output is correct
23 Correct 3174 ms 9704 KB Output is correct
24 Correct 3135 ms 9712 KB Output is correct
25 Correct 1155 ms 9684 KB Output is correct
26 Correct 3782 ms 9704 KB Output is correct
27 Correct 3806 ms 9708 KB Output is correct
28 Correct 55 ms 9560 KB Output is correct
29 Correct 73 ms 9564 KB Output is correct
30 Correct 82 ms 9680 KB Output is correct
31 Incorrect 324 ms 4712 KB Output isn't correct
32 Halted 0 ms 0 KB -