oj.uz

답안 #660448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
660448 2022-11-21T20:57:05 Z mychecksedad Uplifting Excursion (BOI22_vault) C++17
20 / 100
 5000 ms 1996 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++;
        }
    }
    if(sum > l || l - sum > 1000000){
        cout << "impossible";
        return;
    }
    ll M = 100000;
    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], 500*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], 500*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

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

Subtask #2
0 / 15.0

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

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 1900 KB Output is correct
2 Correct 1673 ms 1924 KB Output is correct
3 Correct 601 ms 1880 KB Output is correct
4 Correct 1779 ms 1892 KB Output is correct
5 Correct 1448 ms 1888 KB Output is correct
6 Correct 689 ms 1896 KB Output is correct
7 Correct 281 ms 1888 KB Output is correct
8 Correct 180 ms 1884 KB Output is correct
9 Correct 453 ms 1884 KB Output is correct
10 Correct 1150 ms 1884 KB Output is correct

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 1900 KB Output is correct
2 Correct 1673 ms 1924 KB Output is correct
3 Correct 601 ms 1880 KB Output is correct
4 Correct 1779 ms 1892 KB Output is correct
5 Correct 1448 ms 1888 KB Output is correct
6 Correct 689 ms 1896 KB Output is correct
7 Correct 281 ms 1888 KB Output is correct
8 Correct 180 ms 1884 KB Output is correct
9 Correct 453 ms 1884 KB Output is correct
10 Correct 1150 ms 1884 KB Output is correct
11 Correct 7 ms 1908 KB Output is correct
12 Incorrect 8 ms 1876 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 1900 KB Output is correct
2 Correct 1673 ms 1924 KB Output is correct
3 Correct 601 ms 1880 KB Output is correct
4 Correct 1779 ms 1892 KB Output is correct
5 Correct 1448 ms 1888 KB Output is correct
6 Correct 689 ms 1896 KB Output is correct
7 Correct 281 ms 1888 KB Output is correct
8 Correct 180 ms 1884 KB Output is correct
9 Correct 453 ms 1884 KB Output is correct
10 Correct 1150 ms 1884 KB Output is correct
11 Correct 28 ms 1864 KB Output is correct
12 Correct 1619 ms 1892 KB Output is correct
13 Correct 574 ms 1884 KB Output is correct
14 Correct 1791 ms 1888 KB Output is correct
15 Correct 1428 ms 1892 KB Output is correct
16 Correct 694 ms 1888 KB Output is correct
17 Correct 262 ms 1876 KB Output is correct
18 Correct 154 ms 1884 KB Output is correct
19 Correct 432 ms 1888 KB Output is correct
20 Correct 1091 ms 1884 KB Output is correct
21 Correct 84 ms 1876 KB Output is correct
22 Correct 87 ms 1876 KB Output is correct
23 Correct 1880 ms 1896 KB Output is correct
24 Correct 1346 ms 1996 KB Output is correct
25 Correct 2043 ms 1984 KB Output is correct
26 Correct 2751 ms 1888 KB Output is correct
27 Correct 2121 ms 1888 KB Output is correct
28 Correct 2453 ms 1888 KB Output is correct

Subtask #4-2
0 / 10.0

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

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 1900 KB Output is correct
2 Correct 1673 ms 1924 KB Output is correct
3 Correct 601 ms 1880 KB Output is correct
4 Correct 1779 ms 1892 KB Output is correct
5 Correct 1448 ms 1888 KB Output is correct
6 Correct 689 ms 1896 KB Output is correct
7 Correct 281 ms 1888 KB Output is correct
8 Correct 180 ms 1884 KB Output is correct
9 Correct 453 ms 1884 KB Output is correct
10 Correct 1150 ms 1884 KB Output is correct
11 Correct 28 ms 1864 KB Output is correct
12 Correct 1619 ms 1892 KB Output is correct
13 Correct 574 ms 1884 KB Output is correct
14 Correct 1791 ms 1888 KB Output is correct
15 Correct 1428 ms 1892 KB Output is correct
16 Correct 694 ms 1888 KB Output is correct
17 Correct 262 ms 1876 KB Output is correct
18 Correct 154 ms 1884 KB Output is correct
19 Correct 432 ms 1888 KB Output is correct
20 Correct 1091 ms 1884 KB Output is correct
21 Correct 84 ms 1876 KB Output is correct
22 Correct 87 ms 1876 KB Output is correct
23 Correct 1880 ms 1896 KB Output is correct
24 Correct 1346 ms 1996 KB Output is correct
25 Correct 2043 ms 1984 KB Output is correct
26 Correct 2751 ms 1888 KB Output is correct
27 Correct 2121 ms 1888 KB Output is correct
28 Correct 2453 ms 1888 KB Output is correct
29 Correct 26 ms 1868 KB Output is correct
30 Correct 1585 ms 1888 KB Output is correct
31 Correct 552 ms 1900 KB Output is correct
32 Correct 1733 ms 1892 KB Output is correct
33 Correct 1406 ms 1884 KB Output is correct
34 Correct 686 ms 1888 KB Output is correct
35 Correct 277 ms 1892 KB Output is correct
36 Correct 151 ms 1876 KB Output is correct
37 Correct 428 ms 1884 KB Output is correct
38 Correct 1103 ms 1904 KB Output is correct
39 Correct 83 ms 1876 KB Output is correct
40 Correct 79 ms 1896 KB Output is correct
41 Correct 1863 ms 1996 KB Output is correct
42 Correct 1310 ms 1892 KB Output is correct
43 Correct 2029 ms 1996 KB Output is correct
44 Correct 2825 ms 1888 KB Output is correct
45 Correct 2193 ms 1892 KB Output is correct
46 Correct 2459 ms 1892 KB Output is correct
47 Correct 162 ms 1876 KB Output is correct
48 Correct 164 ms 1888 KB Output is correct
49 Correct 4423 ms 1892 KB Output is correct
50 Correct 1892 ms 1892 KB Output is correct
51 Execution timed out 5083 ms 1876 KB Time limit exceeded
52 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

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

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 1900 KB Output is correct
2 Correct 1673 ms 1924 KB Output is correct
3 Correct 601 ms 1880 KB Output is correct
4 Correct 1779 ms 1892 KB Output is correct
5 Correct 1448 ms 1888 KB Output is correct
6 Correct 689 ms 1896 KB Output is correct
7 Correct 281 ms 1888 KB Output is correct
8 Correct 180 ms 1884 KB Output is correct
9 Correct 453 ms 1884 KB Output is correct
10 Correct 1150 ms 1884 KB Output is correct
11 Correct 28 ms 1864 KB Output is correct
12 Correct 1619 ms 1892 KB Output is correct
13 Correct 574 ms 1884 KB Output is correct
14 Correct 1791 ms 1888 KB Output is correct
15 Correct 1428 ms 1892 KB Output is correct
16 Correct 694 ms 1888 KB Output is correct
17 Correct 262 ms 1876 KB Output is correct
18 Correct 154 ms 1884 KB Output is correct
19 Correct 432 ms 1888 KB Output is correct
20 Correct 1091 ms 1884 KB Output is correct
21 Correct 84 ms 1876 KB Output is correct
22 Correct 87 ms 1876 KB Output is correct
23 Correct 1880 ms 1896 KB Output is correct
24 Correct 1346 ms 1996 KB Output is correct
25 Correct 2043 ms 1984 KB Output is correct
26 Correct 2751 ms 1888 KB Output is correct
27 Correct 2121 ms 1888 KB Output is correct
28 Correct 2453 ms 1888 KB Output is correct
29 Correct 26 ms 1868 KB Output is correct
30 Correct 1585 ms 1888 KB Output is correct
31 Correct 552 ms 1900 KB Output is correct
32 Correct 1733 ms 1892 KB Output is correct
33 Correct 1406 ms 1884 KB Output is correct
34 Correct 686 ms 1888 KB Output is correct
35 Correct 277 ms 1892 KB Output is correct
36 Correct 151 ms 1876 KB Output is correct
37 Correct 428 ms 1884 KB Output is correct
38 Correct 1103 ms 1904 KB Output is correct
39 Correct 83 ms 1876 KB Output is correct
40 Correct 79 ms 1896 KB Output is correct
41 Correct 1863 ms 1996 KB Output is correct
42 Correct 1310 ms 1892 KB Output is correct
43 Correct 2029 ms 1996 KB Output is correct
44 Correct 2825 ms 1888 KB Output is correct
45 Correct 2193 ms 1892 KB Output is correct
46 Correct 2459 ms 1892 KB Output is correct
47 Correct 162 ms 1876 KB Output is correct
48 Correct 164 ms 1888 KB Output is correct
49 Correct 4423 ms 1892 KB Output is correct
50 Correct 1892 ms 1892 KB Output is correct
51 Execution timed out 5083 ms 1876 KB Time limit exceeded
52 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

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