제출 #955057

#제출 시각아이디문제언어결과실행 시간메모리
955057waldiVision Program (IOI19_vision)C++17
8 / 100
1 ms600 KiB
#include "vision.h" #include <bits/stdc++.h> #define FOR(i,p,k) for(int i=(p);i<=(k);++i) #define REP(i,n) FOR(i,0,(n)-1) #define ssize(x) (int((x).size())) #define all(x) (x).begin(),(x).end() using namespace std; void construct_network(int h, int w, int k){ if(max(h, w) <= 10 || min(h, w) == 1){ vector<int> vec; REP(i, h) REP(j, w) REP(x, h) REP(y, w){ if(abs(i-x)+abs(j-y) == k){ int t = add_and({i*w+j, x*w+y}); vec.emplace_back(t); } } add_or(vec); } vector<int> vec; REP(x, h) REP(y, w){ if(x+y == k){ int t = add_and({0, x*w+y}); vec.emplace_back(t); } } 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...