#include <bits/stdc++.h>
#define nemeshay ios_base::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);
#define int long long
#define sigma signed
#define pb push_back
#define ar array
using namespace std;
const int N = 1e6 + 2, inf = 1e9 + 7, mod = 998244353;
int ans[N];
void test_case(){
int n, k, q;
cin >> n >> k >> q;
vector <ar<int, 3>> pon[k + 1];
for (int i = 0; i < n; i++){
int x, t, a, b;
cin >> x >> t >> a >> b;
pon[t].pb({a, b, x});
}
while (q--){
int l, y;
cin >> l >> y;
int ans = 0;
for (int i = 1; i <= k; i++){
int mn = inf;
for (auto j: pon[i]) if (j[0] <= y && y <= j[1]) mn = min(mn, abs(l - j[2]));
if (mn == inf) {
ans = -1;
break;
}
ans = max(ans, mn);
}
cout << ans << '\n';
}
}
sigma main() {
nemeshay
int t = 1;
while (t--) test_case();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |