제출 #657086

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
657086		Lobo	Uplifting Excursion (BOI22_vault)	C++17	0 / 100	837 ms	524288 KiB

vault

#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[n+1];
    for(int i = -sumneg; i <= sumpos; i++) {
        dp[0].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].pb(-inf);
            dp[i][j+up] = max(dp[i][j+up],dp[i-1][j+up]);
            if(j-x >= -sumneg && j-x <= sumpos) dp[i][j+up] = max(dp[i][j+up],dp[i-1][j-x+up]+1);
        }
    }

    if(dp[n][L+up] < 0) {
        cout << "impossible" << endl;
    }
    else {
        cout << dp[n][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();
    }

}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3-1: 0 / 10
• Subtask 3-2: 0 / 10
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 10
• Subtask 5-2: 0 / 10
• Subtask 6-1: 0 / 10
• Subtask 6-2: 0 / 10