# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151201 | georgerapeanu | Kitchen (BOI19_kitchen) | C++11 | 53 ms | 1144 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 <cstdio>
#include <algorithm>
using namespace std;
const int NMAX = 300;
const int SMAX = NMAX * NMAX;
int n,m,k;
int a[NMAX + 5];
int b[NMAX + 5];
int dp[2][SMAX + 5];
int sum;
int update(int x,int y,int val){
if(y < 0 || y > SMAX || dp[x][y] == -1){
return -1;
}
return dp[x][y] + val;
}
int main(){
scanf("%d %d %d",&n,&m,&k);
for(int i = 1;i <= n;i++){
scanf("%d",&a[i]);
sum += a[i];
if(a[i] < k){
printf("Impossible");
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... |