Submission #1095280

#TimeUsernameProblemLanguageResultExecution timeMemory
1095280TymondKitchen (BOI19_kitchen)C++17
20 / 100
19 ms828 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; #define fi first #define se second #define vi vector<int> #define vll vector<long long> #define pii pair<int, int> #define pll pair<long long, long long> #define pb push_back #define mp make_pair #define eb emplace_back #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count()); inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);} inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);} #ifdef DEBUG auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; const int INF = 1e9; const int MAXN = 3e2 + 7; const int MAXS = 9e4 + 7; int a[MAXN];//zadania int b[MAXN];//kucharze int dp[MAXS]; int ndp[MAXS]; int n, m, k; int main(){ ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> n >> m >> k; for(int i = 1; i <= n; i++){ cin >> a[i]; } for(int i = 1; i <= m; i++){ cin >> b[i]; } for(int i = 1; i < MAXS; i++){ dp[i] = -INF; } dp[0] = 0; for(int i = 1; i <= m; i++){ for(int j = MAXS - b[i] - 1; j >= 0; j--){ dp[j + b[i]] = max(dp[j + b[i]], dp[j] + min(n, b[i])); } } int sum = 0; for(int i = 1; i <= n; i++){ sum += a[i]; } int ans = INF; for(int i = sum; i < MAXS; i++){ if(dp[i] < 0){ continue; } if(dp[i] >= n * k){ ans = i - sum; break; } } if(ans == INF){ cout << "Impossible\n"; }else{ cout << ans << '\n'; } 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...