# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161829 | dosts | Kitchen (BOI19_kitchen) | C++20 | 211 ms | 212492 KiB |
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int inf = 1e17,N = 1e5+50,MOD = 1e9+7;
void solve() {
int n,m,k;
cin >> n >> m >> k;
vi a(n+1),b(m+1);
for (int i=1;i<=n;i++) cin >> a[i];
int s = 0;
for (int i=1;i<=n;i++) s+=a[i];
for (int i=1;i<=n;i++) {
if (a[i] < k) {
cout << "Impossible\n";
return;
}
}
for (int i=1;i<=m;i++) cin >> b[i];
int maxsm = 300*m;
int dp[m+1][maxsm+1]{};
# | 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... |