제출 #702298

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
702298		josanneo22	New Home (APIO18_new_home)	C++17	0 / 100	5042 ms	10304 KiB

new_home

#include <bits/stdc++.h>
using namespace std;
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t = 1; //cin >> t;
    while (t--) {
        int n, type, q;
        cin >> n >> type >> q;
        vector<long long> loc(n), tp(n), st(n), ed(n);
        for (int i = 0; i < n; i++) {
            cin >> loc[i] >> tp[i] >> st[i] >> ed[i];
        }
        for (int i = 0; i < q; i++) {
            long long u, v; cin >> u >> v;
            vector<long long> cur_type(type + 1, 0);
            long long ans = 0;
            for (int j = 0; j < n; j++) {
                if(st[j]<=v && ed[j]>=v){
                    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