Submission #370346

#TimeUsernameProblemLanguageResultExecution timeMemory
370346MilosMilutinovicVision Program (IOI19_vision)C++14
0 / 100
1 ms364 KiB
#include <bits/stdc++.h> #include "vision.h" using namespace std; #define pb push_back const int N=205; int h,w,k,a[N][N]; int Get(int i,int j){return a[i][j];} void SolveBF(){ int tmp=0; for(int i=0;i<h;i++)for(int j=0;j<w;j++)a[i][j]=tmp++; 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;y++){ int dist=x-i+y-j; if(dist!=k)continue; add_and({Get(i,j),Get(x,y)}); ask.pb(cnt); 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; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...