# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
370340 | 2021-02-23T20:28:06 Z | MilosMilutinovic | Vision Program (IOI19_vision) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define pb push_back int h,w,k; int Get(int i,int j){return i*w+j;} void SolveBF(){ vector<int> ask; int cnt=h*w; for(int i=0;i<h;i++){ for(int j=0;j<w;j++){ for(int x=i;x<h;x++){ for(int y=j;y<w;j++){ int dist=x-i+y-j; if(dist!=k)continue; add_and(Get(i,j),Get(x,y)); ask.pb(cnt++); } } } } add_or(ask); } void construct_network(int H,int W,int K){ h=H,w=W,k=K; if(max(H,W)<=30){ SolveBF(); return; } }