Submission #421384

#TimeUsernameProblemLanguageResultExecution timeMemory
421384Dan4LifeVision Program (IOI19_vision)C++17
8 / 100
1 ms296 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; void construct_network(int H, int W, int K) { set<pair<int,int> > S; S.clear(); vector<int> v; v.clear(); for(int i = 0; i < H; i++) { for(int j = 0; j < W; j++) { if(i+j==0)continue; //for(int k = i; k < H; k++) //{ // for(int l = 0; l < W; l++) // { vector<int> Ns; Ns.clear(); Ns = {i*W+j, 0}; if(abs(i-0)+abs(j-0)!=K or S.count({i*W+j, 0})) continue; S.insert({i*W+j, 0}); S.insert({0, i*W+j}); int x = add_and(Ns); v.push_back(x); // } //} } } 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...