Submission #946085

#	Time	Username	Problem	Language	Result	Execution time	Memory
946085		itslq	New Home (APIO18_new_home)	C++17	0 / 100	5042 ms	7536 KiB

new_home

#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;

int main() {
    int N, K, Q, L, Y;
    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];

    while (Q--) {
        cin >> L >> Y;

        unordered_map<int, int> stores;

        for (int i = 0; i < N; i++) {
            if (A[i] <= Y && Y <= B[i]) {
                stores[T[i]] = max(abs(L - X[i]), stores[T[i]]);
            }
        }

        int M = -1;
        for (pair<int, int> x: stores) {
            M = max(M, x.second);
        }

        cout << M << '\n';
    }
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 23
• Subtask 5: 0 / 35
• Subtask 6: 0 / 20