제출 #1038590

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1038590		12345678	Uplifting Excursion (BOI22_vault)	C++17	5 / 100	5083 ms	8300 KiB

vault

#include <bits/stdc++.h>

using namespace std;

const int nx=1e6+5, c=5e5;

#define ll long long

ll m, z, p[nx], n[nx], dp[nx], l;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>m>>l;
    for (int i=m; i>=1; i--) cin>>n[i];
    cin>>z;
    for (int i=1; i<=m; i++) cin>>p[i];
    for (int i=0; i<nx; i++) dp[i]=-1;
    dp[c]=z;
    for (int i=1; i<=m; i++)
    {
        for (int t=0; t<n[i]; t++) 
        {
            for (int j=0; j<nx; j++) 
            {
                if (j+i<nx&&dp[j+i]!=-1) dp[j]=max(dp[j], dp[j+i]+1);
            }
        }
    }
    for (int i=1; i<=m; i++)
    {
        for (int t=0; t<p[i]; t++) 
        {
            for (int j=nx-1; j>=0; j--) 
            {
                if (j-i>=0&&dp[j-i]!=-1) dp[j]=max(dp[j], dp[j-i]+1);
            }
        }
    }
    if (l+c<0||l+c>nx||dp[l+c]<1) cout<<"impossible";
    else cout<<dp[l+c];
}

• Subtask 1: 5 / 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