제출 #849973

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

vault

#include <bits/stdc++.h>
using namespace std;
short dp[2][505000*2+5],arr[301];
int br = 505000 , n , m;

signed main(){
    long long all =0;
    for(int i = 1;i<=100;i++){
        all+=100*i;
    }
    cout<<all<<endl;
    cin>>m>>n;
    for(int i = 0;i<2*m+1;i++){
        cin>>arr[i];
    }
    int vl = -30001;
    for(int i = 2*m+1;i>=0;i--){
        for(int j = 0;j<=505000*2;j++){
            if(i==2*m+1){
                if(j==n+br){
                    dp[i&1][j] = 0;
                }else{
                    dp[i&1][j] = vl;
                }
                continue;
            }
            int ans = vl;
            for(int e = 0;e<=arr[i];e++){
                if(j+e*(i-m)<0||j+e*(i-m)>505000*2)continue;
                ans = max(ans,dp[!(i&1)][j+e*(i-m)]+e);
            }
            dp[i&1][j] = ans;
        }
    }
    long long vll = dp[0][505000];
    if(vll<0)cout<<"impossible\n";
    else cout<<vll<<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