제출 #1077767

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

vault

#include<bits/stdc++.h>
using namespace std;
long long int m,dp[300005];
long long int L;
int num[200005];
int val[200005];
int su = 0;
int main()
{
    cin>>m>>L;
    for(int i=1;i<=m*2+1;i++)
    {
        cin>>num[i];
        val[i] = i-m-1;
        su += num[i];
    }
    for(int i=1;i<=200000;i++)dp[i] = -1;
    dp[100000] = num[m+1]; //遍移量為1000000
    for (int i=m+2;i<=m*2+1;i++)
    {
        for(int j=1;j<=num[i];j++)
        {
            for(int k=200000;k>=1;k--)
            {
                if(k >= val[i])
                {
                    if(dp[k-val[i]] == -1)continue;
                    if(dp[k] == -1)
                    {
                        dp[k] = dp[k-val[i]] + 1;   
                    }           
                    else dp[k] = max(dp[k-val[i]] + 1,dp[k]);
                }
            }
        }
    }
    for (int i =1;i<=m;i++)
    {
        for(int j=1;j<=num[i];j++)
        {
            for(int k=1;k<=200000;k++)
            {
                if(k - val[i] <= 200000)
                {
                    if(dp[k-val[i]] == -1)continue;
                    if(dp[k] == -1)dp[k] = dp[k-val[i]] + 1;                
                    else dp[k] = max(dp[k-val[i]] + 1,dp[k]);
                }
            }
        }
        
    }


    if(L >= 100000 || L <= 0-100000)
    {
        cout<<"impossible"<<endl;
        return 0;
    }
    else
    {
        if(dp[L+100000] >= 0)cout<<dp[L+100000]<<endl;
        else cout<<"impossible"<<endl;
    }

    








    return 0;
}

• 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