Submission #1216680

#TimeUsernameProblemLanguageResultExecution timeMemory
1216680loiiii12358Vision Program (IOI19_vision)C++20
44 / 100
11 ms3004 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; void construct_network(int H, int W, int K) { int tmp; vector<int> vec,ans; for(int i=0;i<H;i++){ for(int j=0;j<W;j++){ vec.clear(); for(int k=max(0,i-K);k<min(H,i+K+1);k++){ tmp=K-abs(k-i); if(j-tmp>=0){ vec.push_back(k*W+j-tmp); } if(j+tmp<W){ vec.push_back(k*W+j+tmp); } } if(!vec.empty()){ tmp=add_or(vec); vec={tmp,i*W+j}; ans.push_back(add_and(vec)); } } } add_or(ans); }
#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...