#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int n, K, q;
	cin >> n >> K >> q;
	vector<int> x(n), t(n), a(n), b(n);
	for (int i = 0; i < n; i++) {
		cin >> x[i] >> t[i] >> a[i] >> b[i]; t[i]--;
	}
	while (q--) {
		int l, y;
		cin >> l >> y;
		vector<int> mn(K, INT_MAX);
		for (int i = 0; i < n; i++)
			if (a[i] <= y && y <= b[i]) mn[t[i]] = min(mn[t[i]], abs(l - x[i]));
	
		int mx = *max_element(mn.begin(), mn.end());
		cout << (mx != INT_MAX ? mx : -1) << '\n';
	}
}
| # | 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... |