제출 #1021545

#제출 시각아이디문제언어결과실행 시간메모리
1021545vjudge1Vision Program (IOI19_vision)C++17
8 / 100
1 ms372 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using vll = vector <ll>; using vi = vector <int>; void construct_network (int h, int w, int K) { vi th; auto toLine = [&](ll i, ll j) { return 0 <= i && i < h && 0 <= j && j < w ? i*w+j : -16; }; auto getNeigh = [&](ll i, ll j) -> vi { vi ans; for (ll k = 0; k <= K; k++) { ans.push_back(toLine(i-K+k, j+k)); ans.push_back(toLine(i+k, j+K-k)); } sort(ans.begin(), ans.end()); ans.resize(unique(ans.begin(), ans.end()) - ans.begin()); if (ans.empty()) return ans; if (ans[0] == -16) ans.erase(ans.begin()); return ans; }; add_or(getNeigh(0, 0)); }
#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...