Submission #429008

#TimeUsernameProblemLanguageResultExecution timeMemory
429008Ahmadsm2005Vision Program (IOI19_vision)C++14
33 / 100
125 ms996 KiB
#include "vision.h" //#include "grader.cpp" #include<bits/stdc++.h> using namespace std; void construct_network(int H,int W,int K){ /*std::vector<int>Ns; Ns = {0, 1}; int a = add_and(Ns); Ns = {0, a}; int b = add_or(Ns); Ns = {0, 1, b}; int c = add_xor(Ns); add_not(c);*/ vector<int>ADD; int Z=0; for(int i=0;i<W;i++){ for(int l=0;l<H;l++){ for(int x=0;x<W;x++){ for(int z=0;z<H;z++){ if(abs(i-x)+abs(l-z)==K){ ADD.push_back(i+l*W); ADD.push_back(x+z*W); add_and(ADD); ADD.clear(); Z++; } } } } } for(int i=W*H;i<W*H+Z;i++){ ADD.push_back(i); } add_or(ADD); }
#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...