# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
644934 | a_aguilo | Vision Program (IOI19_vision) | C++14 | 0 ms | 0 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 "vision.h"
#include<bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
int possibilities[K+1];
memset(possibilities, 0, sizeof(possibilities));
for(int w = 0; w <= min(K, W-1); ++w){
int h = K - w;
if(h >= H) continue;
int act[2];
act[0] = 0;
act[1] = h*W + w;
possibilities[w] = add_and(act);
}
add_or(possibilities);
}