Submission #293713

#TimeUsernameProblemLanguageResultExecution timeMemory
293713AutoratchVision Program (IOI19_vision)C++14
26 / 100
12 ms1152 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; void construct_network(int m, int n, int k) { vector<int> vx,hx,tmp; for(int i = 0;i < m;i++) { tmp.clear(); for(int j = 0;j < n;j++) tmp.push_back(i*n+j); hx.push_back(add_xor(tmp)); } for(int i = 0;i < n;i++) { tmp.clear(); for(int j = 0;j < m;j++) tmp.push_back(j*n+i); vx.push_back(add_xor(tmp)); } int ah = add_or(hx),av = add_or(vx); vector<int> sv,sh; for(int i = 0;i+k < m;i++) sh.push_back(add_and({hx[i],hx[i+k]})); for(int i = 0;i+k < n;i++) sv.push_back(add_and({vx[i],vx[i+k]})); int oh,ov; if(sv.empty()) { oh = add_or(sh); add_and({oh,add_not(av)}); } else if(sh.empty()) { ov = add_or(sv); add_and({ov,add_not(ah)}); } else { int ov = add_or(sv),oh = add_or(sh); int t1 = add_and({ov,add_not(ah)}); int t2 = add_and({oh,add_not(av)}); add_or({t1,t2}); } }
#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...