Submission #721230

#TimeUsernameProblemLanguageResultExecution timeMemory
721230nguyentunglamVision Program (IOI19_vision)C++17
0 / 100
242 ms1164 KiB
#include "vision.h" #include<bits/stdc++.h> using namespace std; void construct_network(int h, int w, int K) { vector<int> lst; int timer = 0; for(int i = 0; i < h; i++) for(int j = 0; j < w; j++) { for(int k = i; k < h; k++) for(int l = 0; l < w; l++) { if (i == k && j > l) continue; if (abs(i - k) + abs(j - l) == K) { lst.push_back(add_and({i * w + j, k * w + l})); timer++; } } } cout << timer << endl; if (lst.empty()) return; add_or(lst); }
#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...