Submission #612722

#TimeUsernameProblemLanguageResultExecution timeMemory
612722moreteVision Program (IOI19_vision)C++17
33 / 100
1097 ms2508 KiB
#include<bits/stdc++.h> using namespace std; #include "vision.h" int f(int i, int j, int W){ return i*W + j; } void construct_network(int H, int W, int K) { int cap = 1; int last = 0; map<array<int, 4>, bool> M; for(int i = 0; i < H && cap < 10000; i++){ for(int j = 0; j < W && cap < 10000; j++){ for(int k = 0; k < H && cap < 10000; k++){ for(int l = 0; l < W && cap < 10000; l++){ if(abs(i - k) + abs(j - l) == K && !M.count({i, j, k, l})){ last = add_and({f(i, j, W), f(k, l, W)}); cap++; M[{i, j, k, l}] = true; M[{k, l, i, j}] = true; } } } } } vector<int> v; for(int i = H*W; i <= last; i++) v.push_back(i); add_or(v); }
#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...