제출 #572956

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
572956		AmirElarbi	Uplifting Excursion (BOI22_vault)	C++14	0 / 100	47 ms	71928 KiB

vault

#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e7
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 2e5+5
using namespace std;
const int MOD = 1e4+7;
const int nax = 305;
const int nax2 = 30005;
typedef complex<int> Point;
#define X real()
#define Y imag()
int s[nax], dp[nax2*2][nax],m,l;
int solve(int sm, int pos){
    if(pos > 2*m){
        if(sm == l) return 0;
        else return -1;
    }
    if(dp[sm+nax2][pos] != -1) return dp[sm+nax2][pos];
    for (int i = 0; i <= s[pos]; ++i)
    {
        int a = solve(sm+(pos-m)*i,pos+1);
        if(a!=-1) dp[sm+nax2][pos] = max(dp[sm+nax2][pos], solve(sm+(pos-m)*i,pos+1)+ i );
    }
    return dp[sm+nax2][pos];
}
int main(){
    optimise;
    cin >> m >> l;
    for (int i = 0; i < 2*m+1; ++i)
    {
        cin >> s[i];
    }
    int res = 0;
    memset(dp, -1,sizeof dp);
    res = solve(0,0);
    if(res == -1) cout << "INPOSSIBLE" << endl;
    else
    cout << res << endl;
}

• 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