Submission #418368

#TimeUsernameProblemLanguageResultExecution timeMemory
418368dxz05Vision Program (IOI19_vision)C++14
44 / 100
212 ms7788 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN = 2e5 + 3e2; vector<int> vv[MAXN]; void construct_network(int H, int W, int K) { vector<int> Ns; for (int i = 0; i < H; i++){ for (int j = 0; j < W; j++){ Ns = {i * W + j}; vv[i * W + j].push_back(add_or(Ns)); Ns.clear(); for (int x = 0; x < H; x++){ for (int y = 0; y < W; y++){ if (abs(x - i) + abs(y - j) != K) continue; Ns.push_back(x * W + y); } } if (!Ns.empty()) vv[i * W + j].push_back(add_or(Ns)); } } Ns.clear(); for (int i = 0; i < H * W; i++){ if (vv[i].size() == 2) Ns.push_back(add_and(vv[i])); } add_or(Ns); }
#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...