Submission #464483

#TimeUsernameProblemLanguageResultExecution timeMemory
464483fuad27Kitchen (BOI19_kitchen)C++17
0 / 100
1095 ms204 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define vii vector<pair<int, int>> #define vi vector<int> #define vl vector<long long> #define vll vector<pair<long long, long long>> #define mp make_pair #define pb push_back #define rep(i, a, b) for(int i = a;i<=b;i++) #define f first #define s second #define FIO ios_base::sync_with_stdio(0);cin.tie(0); #define start int tt;cin>>tt;rep(testcase, 1, tt) #define print(k) cout<<"Case #"<<testcase<<": "<<k<<"\n"; #define endl "\n" #define DEBUG(k) cerr<<k<<"\n"; int ans = 100000000; int n, m, k, sum = 0; int a[310], b[310]; void f(int ind, vector<int> t, int s, int ts) { if(ind == m) { if(s >= n*k and ts >= sum) { ans = min(ans, ts); } return; } f(ind+1, t, s, ts); t.push_back(ind); f(ind+1,t, s+min(n, b[ind]), ts + b[ind]); } void solve() { cin >> n >> m >> k; rep(i, 0, n-1) { cin>>a[i]; sum += a[i]; } rep(i, 0, m-1)cin>>b[i]; vector<int> tmp(0); f(0, tmp, 0, 0); if(ans == 100000000)cout<<"Impossible"<<endl; else cout<<ans - sum<<endl; } int32_t main () { int t = 1; while(t--) { solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...