# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
644934 | 2022-09-25T15:18:19 Z | a_aguilo | Vision Program (IOI19_vision) | C++14 | 0 ms | 0 KB |
#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); }