# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
175901 | AlexLuchianov | Kitchen (BOI19_kitchen) | C++14 | 162 ms | 3348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
using namespace std;
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 300;
int const inf = 1000000000;
int v[5 + nmax], v2[5 + nmax];
bitset<5 + nmax * nmax> dpinit, dp[5 + nmax];
int dist[5 + nmax * nmax];
int main()
{
int n, k, m;
cin >> n >> m >> k;
int sum = 0;
for(int i = 1;i <= n; i++) {
cin >> v[i];
sum += v[i];
if(v[i] < k) {
cout << "Impossible";
return 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... |