제출 #899911

#제출 시각아이디문제언어결과실행 시간메모리
899911rxlfd314Vision Program (IOI19_vision)C++17
0 / 100
1 ms600 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using ari2 = array<int, 2>; using ari3 = array<int, 3>; using arl2 = array<ll, 2>; using arl3 = array<ll, 3>; #define vt vector #define size(x) (int((x).size())) #define all(x) begin(x), end(x) #define REP(a, b, c, d) for (int a = (b); (d) > 0 ? a <= (c) : a >= (c); a += (d)) #define FOR(a, b, c) REP(a, b, c, 1) #define ROF(a, b, c) REP(a, b, c, -1) void construct_network(int H, int W, int K) { if (min(H, W) == 1) { int cur = H * W; FOR(i, K, H*W-1) { add_and({i, i-K}); cur++; } int cur2 = cur; add_or({H*W, H*W+1}); #ifdef DEBUG cout << "fine on " << __LINE__ << '\n'; #endif FOR(i, H*W+2, cur-1) { add_or({i, cur2}); cur2++; } return; } }
#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...