Submission #77321

#TimeUsernameProblemLanguageResultExecution timeMemory
77321298iq새 집 (APIO18_new_home)C++14
5 / 100
4 ms1564 KiB
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 507;
const int INF = 1e9 + 7;

int p[MAXN], c[MAXN], l[MAXN], r[MAXN];
int mn[MAXN];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, k, q;
    cin >> n >> k >> q;

    for (int i = 0; i < n; ++i) {
        cin >> p[i] >> c[i] >> l[i] >> r[i];
        --c[i];
    }

    for (int i = 0; i < q; ++i) {
        int np, nt;
        cin >> np >> nt;
        
        for (int j = 0; j < k; ++j) {
            mn[j] = INF;
        }

        for (int j = 0; j < n; ++j) {
            if (l[j] <= nt && nt <= r[j]) {
                mn[c[j]] = min(mn[c[j]], abs(p[j] - np));
            }
        }

        int ans = 0;
        for (int j = 0; j < k; ++j) {
            ans = max(ans, mn[j]);
        }

        if (ans == INF) 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...