oj.uz

Submission #657089

# Submission time Handle Problem Language Result Execution time Memory
657089 2022-11-08T20:47:17 Z Lobo Uplifting Excursion (BOI22_vault) C++17
5 / 100
 5000 ms 524288 KB 
#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxm = 51;

int n, m, L;

void solve() {
    cin >> m >> L;
    vector<int> vals;
    int sumneg = 0, sumpos = 0;
    for(int i = -m; i <= m; i++) {
        int x; cin >> x;
        if(i > 0) sumpos+= x*i;
        if(i < 0) sumneg-= x*i;
        while(x--) vals.pb(i);
    }

    if(L > sumpos || L < -sumneg) {
        cout << "impossible" << endl;
        return;
    }

    int n = vals.size();
    int up = sumneg;

    vector<int> dp[2];
    for(int i = -sumneg; i <= sumpos; i++) {
        dp[0].pb(-inf);
        dp[1].pb(-inf);
    }
    dp[0][0+up] = 0;
    for(int i = 1; i <= n; i++) {
        int x = vals[i-1];
        for(int j = -sumneg; j <= sumpos; j++) {
            dp[i&1][j+up] = -inf;
            dp[i&1][j+up] = max(dp[i&1][j+up],dp[i&1^1][j+up]);
            if(j-x >= -sumneg && j-x <= sumpos) dp[i&1][j+up] = max(dp[i&1][j+up],dp[i&1^1][j-x+up]+1);
        }
    }

    if(dp[n&1][L+up] < 0) {
        cout << "impossible" << endl;
    }
    else {
        cout << dp[n&1][L+up] << endl;
    }


}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }

}

Compilation message

vault.cpp: In function 'void solve()':
vault.cpp:47:51: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   47 |             dp[i&1][j+up] = max(dp[i&1][j+up],dp[i&1^1][j+up]);
      |                                                  ~^~
vault.cpp:48:87: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   48 |             if(j-x >= -sumneg && j-x <= sumpos) dp[i&1][j+up] = max(dp[i&1][j+up],dp[i&1^1][j-x+up]+1);
      |                                                                                      ~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 349 ms 2044 KB Output is correct
7 Correct 58 ms 996 KB Output is correct
8 Correct 319 ms 1488 KB Output is correct
9 Correct 1149 ms 2464 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 324 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 349 ms 2044 KB Output is correct
7 Correct 58 ms 996 KB Output is correct
8 Correct 319 ms 1488 KB Output is correct
9 Correct 1149 ms 2464 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 360 ms 2044 KB Output is correct
18 Correct 60 ms 952 KB Output is correct
19 Correct 340 ms 1492 KB Output is correct
20 Correct 1157 ms 2464 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 448 KB Output is correct
24 Execution timed out 5072 ms 8596 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 407 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 407 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 407 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 349 ms 2044 KB Output is correct
7 Correct 58 ms 996 KB Output is correct
8 Correct 319 ms 1488 KB Output is correct
9 Correct 1149 ms 2464 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Runtime error 407 ms 524288 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 407 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 349 ms 2044 KB Output is correct
7 Correct 58 ms 996 KB Output is correct
8 Correct 319 ms 1488 KB Output is correct
9 Correct 1149 ms 2464 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 360 ms 2044 KB Output is correct
18 Correct 60 ms 952 KB Output is correct
19 Correct 340 ms 1492 KB Output is correct
20 Correct 1157 ms 2464 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 448 KB Output is correct
24 Execution timed out 5072 ms 8596 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 407 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 349 ms 2044 KB Output is correct
7 Correct 58 ms 996 KB Output is correct
8 Correct 319 ms 1488 KB Output is correct
9 Correct 1149 ms 2464 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 360 ms 2044 KB Output is correct
18 Correct 60 ms 952 KB Output is correct
19 Correct 340 ms 1492 KB Output is correct
20 Correct 1157 ms 2464 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 448 KB Output is correct
24 Execution timed out 5072 ms 8596 KB Time limit exceeded
25 Halted 0 ms 0 KB -