제출 #812591

#제출 시각아이디문제언어결과실행 시간메모리
812591fatemetmhrVision Program (IOI19_vision)C++17
12 / 100
2 ms316 KiB
// Comment! #include "vision.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; #define mp make_pair #define all(x) x.begin(), x.end() #define pb push_back #define fi first #define se second const int maxn5 = 2e5 + 10; vector <int> ns; void construct_network(int h, int w, int k) { ns.clear(); int st2 = h * w; int last = st2 - 1; for(int i = 0; i + k < max(h, w); i++){ ns.clear(); ns = {i, i + k}; last = add_and(ns); } ns.clear(); for(int i = st2; i <= last; i++) ns.pb(i); add_or(ns); 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...