제출 #298168

#제출 시각아이디문제언어결과실행 시간메모리
298168shayan_pVision Program (IOI19_vision)C++17
33 / 100
110 ms1148 KiB
#include<bits/stdc++.h> #include "vision.h" #define F first #define S second #define PB push_back #define sz(s) (int(s.size())) #define bit(n, k) (((n)>>(k))&1) using namespace std; typedef long long ll; typedef pair<int, int> pii; void construct_network(int H, int W, int K){ /* 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);*/ auto to = [&](int x, int y){ return x * W + y; }; int cnt = 0; for(int a = 0; a < H; a++){ for(int b = 0; b < W; b++){ for(int c = 0; c < H; c++){ for(int d = 0; d < W; d++){ if(abs(a-c) + abs(b-d) == K){ vector<int> vec; vec.PB(to(a, b)), vec.PB(to(c, d)); add_and(vec); cnt++; } } } } } vector<int> vec; for(int i = 0; i < cnt; i++){ vec.PB(H * W + i); } add_or(vec); }
#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...