제출 #1135354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135354		ByeWorld	Kitchen (BOI19_kitchen)	C++20	0 / 100	12 ms	328 KiB

kitchen

#include <bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<char,char> pcc;
typedef pair<int,pii> ipii;
typedef pair<pii,pii> ipiii;
const int MAXN = 310;
const int SQRT = 610;
const int MAXA = 9e4+10;
const int MOD = 1e6+7;
const int INF = 2e9+10;
const int LOG = 19;
const ld EPS = 1e-12;
void chmx(int &a, int b){ a = max(a,b); }
void chmn(int &a, int b){ a = min(a,b); }

int n, m, k;
int a[MAXN], b[MAXN];
bool dp[MAXA];

signed main(){
    // ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m >> k;
    int tot = 0;
    for(int i=1; i<=n; i++){
        cin >> a[i]; tot += a[i];
    }
    for(int i=1; i<=m; i++) cin >> b[i];
    dp[0] = 1;
    for(int i=1; i<=m; i++){
        for(int j=MAXA-10; j>=b[i]; j--)
            dp[j] |= dp[j-b[i]];
    }
    int mn = INF;
    for(int i=tot; i<=MAXA-10; i++){
        if(dp[i]){
            mn = i; break;
        }
    }
    if(mn==INF) cout << "impossible\n";
    else cout << mn-tot << '\n';
}   

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