| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 423308 |
2021-06-10T23:45:27 Z |
abdzag |
Kitchen (BOI19_kitchen) |
C++17 |
|
1000 ms |
30660 KB |
#include<bits/stdc++.h>
#include<unordered_map>
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define trav(a,v) for(auto& a: v)
#define sz(v) v.size()
#define all(v) v.begin(),v.end()
#define vi vector<int>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const long long inf = 1e15;
using namespace std;
int main() {
cin.sync_with_stdio(false);
ll n, m, k;
cin >> n >> m >> k;
vector<ll> v(n);
vector<ll> v2(m);
rep(i, 0, n) {
cin >> v[i];
if (v[i] < k) {
cout << "Impossible" << endl;
return 0;
}
}
rep(i, 0, m)cin >> v2[i];
ll sum = 0;
rep(i, 0, n)sum += v[i];
sort(all(v2), greater<>());
set < pair<ll, pair<ll, ll>>>dp0;
dp0.emplace(0, make_pair(0, 0));
set<pair<ll, pair<ll, ll>>> dp = dp0;
rep(i, 0, m) {
trav(a, dp0) {
pair<ll, pair<ll, ll>> cur = a;
cur.first += v2[i];
cur.second.first++;
if (cur.second.first >= k)cur.second.second += v2[i];
dp.insert(cur);
}
dp0 = dp;
}
ll ans = inf;
trav(a, dp) {
if (a.second.second >= n&&a.first>=sum) {
ans = min(ans, a.first);
}
}
if (ans == inf)cout << "Impossible" << endl;
else cout << ans - sum << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
3 ms |
972 KB |
Output is correct |
| 10 |
Correct |
2 ms |
716 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
2 ms |
588 KB |
Output is correct |
| 13 |
Correct |
4 ms |
1356 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
412 ms |
3964 KB |
Output is correct |
| 2 |
Correct |
36 ms |
4436 KB |
Output is correct |
| 3 |
Execution timed out |
1085 ms |
30660 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
972 KB |
Output is correct |
| 2 |
Incorrect |
28 ms |
5416 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
3 ms |
972 KB |
Output is correct |
| 10 |
Correct |
2 ms |
716 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
2 ms |
588 KB |
Output is correct |
| 13 |
Correct |
4 ms |
1356 KB |
Output is correct |
| 14 |
Correct |
412 ms |
3964 KB |
Output is correct |
| 15 |
Correct |
36 ms |
4436 KB |
Output is correct |
| 16 |
Execution timed out |
1085 ms |
30660 KB |
Time limit exceeded |
| 17 |
Halted |
0 ms |
0 KB |
- |
