Submission #1025362

#TimeUsernameProblemLanguageResultExecution timeMemory
1025362byakkoVision Program (IOI19_vision)C++17
33 / 100
4 ms1172 KiB
#include "vision.h" using namespace std; void construct_network(int H, int W, int K) { int last = 0; for(int i = 0; i < H; i++) for(int j = 0; j < W; j++) { int difx = -K; while(difx <= K) { int dify = K - abs(difx); int ii = i + difx; int jj = j + dify; if(ii >= 0 && ii < H && jj >= 0 && jj < W) { last = add_and({i*W + j, ii*W + jj}); } difx++; } } vector<int> all; for(int i = H*W; i <= last; i++) all.push_back(i); 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...