제출 #567107

#제출 시각아이디문제언어결과실행 시간메모리
567107RealSnakeKitchen (BOI19_kitchen)C++14
0 / 100
13 ms596 KiB
#include "bits/stdc++.h" using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; typedef tree<pair<int, int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; #define ll long long #define mod 1000000007 ofstream fout(".out"); ifstream fin(".in"); int dp[90001]; signed main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, k; cin >> n >> m >> k; int a[n], b[m]; int x = 0; for(int i = 0; i < n; i++) { cin >> a[i]; x += a[i]; } int sum = 0; for(int i = 0; i < m; i++) { cin >> b[i]; sum += b[i]; } if(k == 1) { dp[0] = 1; for(int i = 0; i < m; i++) { for(int j = 90000; j >= b[i]; j--) dp[j] |= dp[j - b[i]]; } for(int i = sum; i <= 90000; i++) { if(dp[i]) { cout << i - x; return 0; } } cout << "Impossible"; } 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...