Submission #415671

#TimeUsernameProblemLanguageResultExecution timeMemory
415671AmineTrabelsiVision Program (IOI19_vision)C++14
33 / 100
3 ms1096 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; void construct_network(int H, int W, int K) { // add_and(vector); // add_or(vector); // add_xor(vector); // add_not(int); auto cell = [&](int x,int y) -> int { return x*W+y; }; vector<int> que; for(int i=0;i<H;i++){ for(int j=0;j<W;j++){ for(int x=0;x<=K ;x++){ int a = x,b = K-x; if(i+a < H && j+b < W){ int ni = i+a, nj = j+b; que.push_back(add_and({cell(i,j),cell(ni,nj)})); } if(i+a < H && j-b >= 0){ int ni = i+a, nj = j-b; que.push_back(add_and({cell(i,j),cell(ni,nj)})); } } } } //cerr<<que.size() << '\n'; add_or(que); }
#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...