oj.uz

Submission #582254

# Submission time Handle Problem Language Result Execution time Memory
582254 2022-06-23T14:56:02 Z talant117408 Uplifting Excursion (BOI22_vault) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define long                unsigned long 
#define pb                  push_back
#define mp                  make_pair
#define all(v)              (v).begin(),(v).end()
#define rall(v)             (v).rbegin(),(v).rend()
#define lb                  lower_bound
#define ub                  upper_bound
#define sz(v)               int((v).size())
#define do_not_disturb      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl                '\n'
#define PI                  2*acos(0.0)

ll calc(ll n) {
    return n*(n+1)/2;
}

void solve() {
    ll m, l;
    cin >> m >> l;
    vector <ll> v(m*2+1);
    ll largest = 0;
    for (auto &to : v) cin >> to;
    for (auto to : v) largest = max(largest, to);
    ll neg = 0, pos = 0;
    for (int i = 0; i <= m*2; i++) {
        if (i < m) neg += v[i]*(i-m)*(-1);
        else pos += v[i]*(i-m);
    }
    if (largest <= 100 && abs(m) <= 100) {
        int offset = neg;
        int saizu = pos+neg;
        if (l+offset < 0 || l > saizu) return;
        vector <int> dp(saizu+1);
        for (int i = m; i <= m*2; i++) {
            for (int j = 1; j <= v[i]; j++) {
                for (int w = saizu; w >= offset; w--) {
                    if (w-(i-m) >= offset && (w-(i-m) == neg || dp[w-(i-m)] > 0)) {
                        dp[w] = max(dp[w], dp[w-(i-m)]+1);
                    }
                }
            }
        }
        for (int i = 0; i < m; i++) {
            for (int j = 1; j <= v[i]; j++) {
                for (int w = 0; w <= saizu; w++) {
                    if (w-(i-m) <= saizu && (w-(i-m) == neg || dp[w-(i-m)] > 0)) {
                        dp[w] = max(dp[w], dp[w-(i-m)]+1);
                    }
                }
            }
        }
        if (dp[l+offset] > 0) cout << dp[l+offset] << endl;
        else cout << "impossible" << endl;
    }
}

int main() {
    do_not_disturb
    
    int t = 1;
    //~ cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}
/*

*/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 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 Incorrect 1 ms 212 KB Output isn't correct
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 Incorrect 1 ms 212 KB Output isn't correct
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 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 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 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 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 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -