| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1291364 | nathlol2 | Kitchen (BOI19_kitchen) | C++20 | 2 ms | 580 KiB |
#include <bits/stdc++.h>
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, k;
cin >> n >> m >> k;
int a[n], b[m], sm = 0, sma = 0;
for(int i = 0;i<n;i++){
cin >> a[i];
sm += a[i];
sma += a[i];
}
for(int i = 0;i<m;i++){
cin >> b[i];
sm -= b[i];
}
if(sm > 0) return cout << "Impossible\n", 0;
bitset<90001> c;
c[0] = 1;
for(int i = 0;i<m;i++){
c |= (c << b[i]);
}
for(int i = sma;i<=90000;i++){
if(c[i]) return cout << i - sma, 0;
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
