제출 #698646

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

new_home

#include <bits/stdc++.h>
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int ll
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
using namespace std;
const int N = 1e8 + 10, mod = 1e9 + 7;
int n, k, q;
vector<int> x, a , b, type;
signed main()
{
    FAST;
    cin >> n >> k >> q;
    for(int i = 0; i < n; i++) {
        int time, t, x1, y1;
        cin >> time >> t >> x1 >> y1;
        x.push_back(time);
        a.push_back(x1);
        b.push_back(y1);
        type.push_back(t);
    }
    while(q--) {
        int l, y;
        cin >> y >> l;
        vector<int> v;
        bool vis[k+1];
        for(int i = 1; i <= k; i++) vis[i] = 0;
        for(int i = 0; i < n; i++) {
            if(a[i] <= l && b[i] >= l) {
                v.push_back(x[i]);
                vis[type[i]] = 1;
            }
        }
        bool ans = 1;
        for(int i = 1; i <= k; i++) if(vis[i] == 0) ans = 0;
        if(!ans) cout << -1 << endl;
        else {
            sort(all(v));
            // cout << v[0] << ' ' << v[v.size() - 1] << ' ' << y << endl;
            cout << max(abs(v[0] - y), abs(v[v.size() - 1] - y)) << endl;
        }
    }
}

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