Submission #1058007

#TimeUsernameProblemLanguageResultExecution timeMemory
1058007UnforgettableplVision Program (IOI19_vision)C++17
0 / 100
1 ms348 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; void construct_network(int H, int W, int K) { vector<int> cultprits; int lig = H*W; assert(H*W<=900); for(int i=0;i<1;i++) { for(int j=0;j<1;j++) { for(int k=i;k<H;k++) { for(int l=(k==i?j:0);l<W;l++) { if(abs(i-k)+abs(j-l)!=K)continue; add_and({i*W+j,k*W+l}); cultprits.emplace_back(lig++); } } } } add_or(cultprits); }
#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...