제출 #1199578

#제출 시각아이디문제언어결과실행 시간메모리
1199578justNew Home (APIO18_new_home)C++20
5 / 100
5092 ms10548 KiB
#include "bits/stdc++.h" #include <climits> using namespace std; #define int long long #define vec vector #define all(x) (x).begin(), (x).end() using quad = tuple<int, int, int, int>; int n, k, q; vec<quad> stores; signed main() { cin >> n >> k >> q; stores.resize(n); for(auto &[x, t, a, b]: stores) { cin >> x >> t >> a >> b; t--; } vec<int> dist; while(q--) { int l, y; cin >> l >> y; dist.clear(); dist.assign(k, INT_MAX); for(auto [x, t, a, b]: stores) { if (y < a || y > b) continue; dist[t] = min(dist[t], abs(l - x)); } int mx = *max_element(all(dist)); mx = mx == INT_MAX ? -1 : mx; cout << mx << "\n"; } }
#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...