# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
807120 | Benmath | 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) {
std::vector<int> Ns;
int a;
i=0;
j=0;
for(int k=0;k<K;k++){
int ro1=i+k;
int ro2=j+K-1-k;
if(ro1<H and ro2<W){
Ns= {0,ro1*W+ro2};
a=add_and(Ns);
}
}
Ns.clear();
for(int i=H*W;i<=a;i++){
Ns.push_back(i);
}
a = add_or(Ns);
}