# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1124386 | whoknow | Kitchen (BOI19_kitchen) | C++20 | 15 ms | 584 KiB |
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define MAXN 305
#define MAXSUM 90005
#define ii pair<int,int>
#define bit(i,j) ((i>>j)&1)
#define sz(i) (int)i.size()
#define endl '\n'
using namespace std;
int n, m, K;
int a[MAXN], b[MAXN];
namespace sub1
{
int sumA, sumB;
int dp[MAXSUM];
void solve()
{
for(int i = 1; i <= n; i++)
{
if(a[i] < K)
return cout << "Impossible", void();
sumA += a[i];
}
for(int i = 1; i <= m; i++)
sumB += b[i];
memset(dp, -0x3f, sizeof(dp));
dp[0] = 0;
for(int i = 1; i <= m; i++)
Compilation message (stderr)
# | 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... |