Submission #1013076

#TimeUsernameProblemLanguageResultExecution timeMemory
1013076HappyCapybaraVision Program (IOI19_vision)C++17
8 / 100
1 ms604 KiB
#include "vision.h" #include<bits/stdc++.h> using namespace std; void construct_network(int H, int W, int K){ vector<int> w; for (int i=0; i<1; i++){ for (int j=0; j<1; j++){ vector<int> v; for (int k=-K; k<=K; k++){ if (i+k < 0 || i+k >= H) continue; if (j+(K-abs(k)) < W) v.push_back((i+k)*W + j+(K-abs(k))); if (abs(k) != K && j-(K-abs(k)) >= 0) v.push_back((i+k)*W + j-(K-abs(k))); } if (v.size() == 0) continue; add_or(v); if (w.size() == 0) w.push_back(H*W+1); else w.push_back(w[w.size()-1]+2); add_and({w[w.size()-1]-1, i*W+j}); } } add_or(w); }
#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...