제출 #261870

#제출 시각아이디문제언어결과실행 시간메모리
261870kshitij_sodaniVision Program (IOI19_vision)C++14
12 / 100
233 ms1064 KiB
#include <bits/stdc++.h> using namespace std; typedef long long llo; #define mp make_pair #define pb push_back #define a first #define b second #include "vision.h" void construct_network(int n, int m, int k) { vector<int> cur; int pos=n*m; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ vector<int> cur2; for(int kk=0;kk<n;kk++){ for(int ll=0;ll<m;ll++){ if(abs(i-kk)+abs(j-ll)==k){ cur2.pb(kk+ll*n); } } } if(cur2.size()==0){ continue; } add_or(cur2); add_and({pos,i+n*j}); cur.pb(pos+1); pos+=2; } } add_or(cur); /*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);*/ }
#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...