제출 #217561

#제출 시각아이디문제언어결과실행 시간메모리
217561VEGAnn새 집 (APIO18_new_home)C++14
5 / 100
6 ms640 KiB
#include <bits/stdc++.h> using namespace std; const int N = 410; const int oo = 2e9; int n, k, qq, x[N], t[N], a[N], b[N], dst[N], tt = 0; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); //freopen("in.txt","r",stdin); cin >> n >> k >> qq; assert(n < 401 && qq < 401); for (int i = 0; i < n; i++) cin >> x[i] >> t[i] >> a[i] >> b[i]; for (; qq; qq--){ int l, y; cin >> l >> y; tt++; fill(dst + 1, dst + k + 1, oo); for (int i = 0; i < n; i++){ if (y < a[i] || y > b[i]) continue; dst[t[i]] = min(dst[t[i]], abs(l - x[i])); } int ans = 0; for (int i = 1; i <= k; i++) ans = max(ans, dst[i]); if (ans == oo) cout << "-1\n"; else cout << ans << '\n'; } return 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...