# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
667874 | coding_snorlax | 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<bits/stdc++.h>
#include "vision.h"
using namespace std;
int List1[200006]={0};
int row,column;
void construct_network(int H,int W,int K){
row=H;
column=W;
vector<int> s;
for(int i=0;i<1;i++){
for(int j=0;j<1;j++){
s.clear();
for(int k=0;k<H;k++){
for(int l=0;l<W;l++){
if(dis(i,j,k,l)==K) s.push_back(num(k,l));
}
}
if((int)s.size()==0){
s.push_back(0);
s.push_back(1);
s.push_back(2);
add_and(s);
}
else{
add_xor(s);
}
}
}
vector<int> s1={0,H*W};
for(int i=0;i<H*W;i++){
add_and(s1);
s1[0]++;
s1[1]++;
}
vector<int> s2;
for(int i=0;i<H*W;i++){
s2.push_back(i+2*H*W);
}
add_or(s2);
return;
}