제출 #702326

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
702326		josanneo22	새 집 (APIO18_new_home)	C++17	0 / 100	155 ms	15828 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> cur_type(type, 0);
        vector<long long> 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]--;
            cur_type[tp[i]]++;
        }
        int ok = 0, mx = *max_element(loc.begin(), loc.end()), mn = *min_element(loc.begin(), loc.end());
        for (int i = 0; i < type; i++) if (cur_type[i] == 0) ok = 0;
        for (int i = 0; i < q; i++) {
            int u, ti; cin >> u >> ti;
            if (ok == 1) {
                cout << max(mx - u, u - mn) << '\n';
            }
            else cout << "-1\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