Submission #464464

#	Time	Username	Problem	Language	Result	Execution time	Memory
464464		BT21tata	Kitchen (BOI19_kitchen)	C++17	20 / 100	58 ms	372 KiB

kitchen

#include<bits/stdc++.h>
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
typedef long long ll;
typedef long double ld;
#define SPEED ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0)
#define rall(v) (v).rbegin(),(v).rend()
#define all(v) (v).begin(),(v).end()
#define OK cerr<<"OK"<<endl<<flush
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define F first
#define S second
#define y0 jahdakdh
#define y1 jahsadakdakdh
#define endl '\n'
const ll MOD=1e9+7;
using namespace std;
//mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());
 
int n, m, k, a[305], b[305];
int suma, sumb;
bool dp[100005];
int main()
{
    SPEED;
    cin>>n>>m>>k;
    for(int i=0; i<n; i++)
    {
        cin>>a[i];
        suma+=a[i];
    }
    for(int i=0; i<m; i++)
    {
        cin>>b[i];
        sumb+=b[i];
    }
    if(sumb<suma) cout<<"Impossible\n";
    dp[0]=1;
    for(int i=0; i<m; i++)
        for(int j=100000; j>=0; j--)
            if(dp[j])
            {
                dp[j+b[i]]=1;
            }

    for(int i=suma; i<=100000; i++)
        if(dp[i]) return cout<<i-suma<<endl,0;
    return 0;
}

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