제출 #702310

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
702310		josanneo22	새 집 (APIO18_new_home)	C++17	0 / 100	157 ms	11300 KiB

new_home

#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];
        }
        vector<int> cur_type(type + 5, 0);
        int mx = 0, mn = INT_MAX;
        for (int i = 0; i < n; i++) {
            cur_type[tp[i]]++;
            mx = max(mx, loc[i]);
            mn = min(mn, loc[i]);
        }
        int ok = 1;
        for (int i = 1; i <= n; i++) {
            if (cur_type[i] == 0) ok = 0;
        }
        for (int i = 0; i < q; i++) {
            int u, ti; cin >> u >> ti;
            if (ok) cout << max(u - mn, mx - u) << '\n';
            else cout << "-1\n";
            /*
            int ans = -1;
            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]]++;
                }
            }
            int ok = 1;
            for (int p = 1; p <= type; p++) {
                if (cur_type[p] == 0) ok = 0;
            }
            if (ok == 0) cout << "-1\n";
            else cout << ans << '\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