제출 #1131480

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1131480		Sofiatpc	Kitchen (BOI19_kitchen)	C++20	20 / 100	308 ms	1160 KiB

kitchen

#include <bits/stdc++.h>

using namespace std;

const int MAX = 305, INF = 1e9;
int a[MAX], s[MAX], b[MAX], dp[2][MAX][MAX];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int n,m,k; cin>>n>>m>>k;

    for(int i = 1; i <= n; i++){
        cin>>a[i];
        s[i] = s[i-1]+a[i];
    }
    s[n+1] = INF;

    for(int i = 1; i <= m; i++)cin>>b[i];

    for(int i = 1; i <= n; i++)
        for(int v = 1; v <= 300; v++)dp[(m+1)%2][i][v] = INF;

    for(int x = m; x >= 1; x--){
        int j = x%2, nxt = (x+1)%2;
        for(int i = 1; i <= n; i++)
            for(int v = 1; v <= 300; v++){
                dp[j][i][v] = dp[nxt][i][v];

                int id = upper_bound(s+1,s+2+n, b[x] + s[i] - v)-s;

                if(id > n)dp[j][i][v] = min(dp[j][i][v], b[x] - (s[n]-s[i]) - v );
                else dp[j][i][v] = min(dp[j][i][v], dp[nxt][id][a[id] - (b[x] - (s[id-1]-s[i]) - v)] );
            }
    }

    if(dp[1][1][a[1]] == INF)cout<<"Impossible\n";
    else cout<<dp[1][1][a[1]]<<"\n";
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 20 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28