# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1014578 | 2024-07-05T07:40:35 Z | Error404 | Kitchen (BOI19_kitchen) | C++17 | 47 ms | 27928 KB |
#include "bits/stdc++.h" using namespace std; #define ll long long #define f first #define s second #define pi pair<ll,ll> #define vi vector<ll> #define vd vector<double> #define vpi vector<pi> #define pb push_back #define INF 1e18 #define endl '\n' //#define int ll #define pii pair<pi,ll> const int mod = 1e9+7; const int MAX = 1e5+1; const int LOG = 30; vi g[MAX]; int tin[MAX], val[MAX], tout[MAX]; int up[LOG+1][MAX]; map<pi,int>mp; vector<pi>order; int timer = 0; signed main(){ int n,m,k,a,b; cin >>n >> m >> k; int dish[n+1], chef[m+1]; ll sum = 0, target = 0;; for(int i= 1; i<= n; i++){ cin >> dish[i]; target += dish[i]; } for(int i = 1; i <=m; i++){ cin >> chef[i]; sum +=chef[i]; } bool dp[m+1][sum+1]; memset(dp,0,sizeof(dp)); dp[0][0]=1; for(int i =1; i <= m; i++){ for(int j = 0; j<=sum; j++){ dp[i][j] = dp[i-1][j]; if(j>=chef[i]&&dp[i-1][j-chef[i]]) dp[i][j] = 1; } } for(int i = target; i <= sum; i++){ if(dp[m][i]){ cout << i-target << endl; return 0; } } cout << "Impossible" << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 3420 KB | Output is correct |
2 | Correct | 1 ms | 3608 KB | Output is correct |
3 | Correct | 1 ms | 3420 KB | Output is correct |
4 | Incorrect | 2 ms | 3420 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 3420 KB | Output is correct |
2 | Correct | 1 ms | 3608 KB | Output is correct |
3 | Correct | 1 ms | 3420 KB | Output is correct |
4 | Incorrect | 2 ms | 3420 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 20496 KB | Output is correct |
2 | Correct | 21 ms | 16220 KB | Output is correct |
3 | Correct | 31 ms | 17736 KB | Output is correct |
4 | Correct | 47 ms | 27740 KB | Output is correct |
5 | Correct | 41 ms | 27928 KB | Output is correct |
6 | Correct | 17 ms | 13660 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 3420 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 3420 KB | Output is correct |
2 | Correct | 1 ms | 3608 KB | Output is correct |
3 | Correct | 1 ms | 3420 KB | Output is correct |
4 | Incorrect | 2 ms | 3420 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |