Submission #390546

#TimeUsernameProblemLanguageResultExecution timeMemory
390546qwerasdfzxclVision Program (IOI19_vision)C++14
0 / 100
2 ms968 KiB
#include "vision.h" #include <bits/stdc++.h> typedef long long ll; using namespace std; void construct_network(int H, int W, int K) { int idx=-1; for (int i=0;i<H;i++){ for (int j=0;j<W;j++){ for (int i1=0;i1<H;i1++){ int d = K-abs(i1-i); if (j-d>=0){ vector<int> v = {i*W+j, i1*W+(j-d)}; idx = add_and(v); } if (j+d<W){ vector<int> v = {i*W+j, i1*W+(j+d)}; idx = add_and(v); } } } } assert(idx!=-1); vector<int> v; for (int i=H*W;i<=idx;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...