Submission #146751

#TimeUsernameProblemLanguageResultExecution timeMemory
146751daniel920712Vision Program (IOI19_vision)C++14
40 / 100
5 ms676 KiB
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <vector> #include <stdlib.h> #include "vision.h" using namespace std; vector < int > temp; vector < int > temp2; vector < int > all; void construct_network(int H, int W, int K) { int i,j,k,now=H*W-1; for(i=0;i<H;i++) { for(j=0;j<W;j++) { temp.clear(); for(k=0;k<=K;k++) if(i+k<H&&j+(K-k)<W) temp.push_back((i+k)*W+j+(K-k)); for(k=0;k<=K;k++) if(i+k<H&&j-(K-k)>=0) temp.push_back((i+k)*W+j-(K-k)); if(!temp.empty()) { temp2.clear(); temp2.push_back(i*W+j); add_or(temp); now++; temp2.push_back(now); add_and(temp2); now++; all.push_back(now); } if(i==0&&j==0&&max(H,W)>30) { add_or(all); return; } } } add_or(all); }
#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...