This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int t = 1;
while (t--) {
int n, type, q;
cin >> n >> type >> q;
vector<int> loc(n+3), tp(n + 3), st(n + 3), ed(n + 3);
for (int i = 0; i < n; i++) {
cin >> loc[i] >> tp[i] >> st[i] >> ed[i];
tp[i]--;
}
vector<int> cur_type(type + 5, 0);
for (int i = 0; i < q; i++) {
int u, ti; cin >> u >> ti;
int ans = -1;
vector<int> cur_type(n, INT_MAX);
for (int j = 0; j < n; j++) {
if (st[j] <= ti && ti<=ed[j]) {
ans = max(ans, abs(u - loc[j]));
cur_type[tp[j]] = min(cur_type[tp[j]], abs(u - loc[j]));
}
}
int ok = 1;
for (int p = 0; p < type; p++) {
if (cur_type[p] ==INT_MAX) ok = 0;
}
if (ok == 0) cout << "-1\n";
else cout << ans << '\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... |