제출 #217686

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
217686		Vimmer	새 집 (APIO18_new_home)	C++14	0 / 100	5082 ms	7904 KiB

new_home

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>


#define F first
#define S second
#define sz(x) int(x.size())
#define N 100005
#define M ll(998244353)

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
//typedef tree<int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> oredered_set;


int main()
{
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, q, k;

    cin >> n >> k >> q;

    vector <pair <pair <pair <int, int>, int>, int> > g(n);

    for (int i = 0; i < n; i++) cin >> g[i].F.F.F >> g[i].F.F.S >> g[i].F.S >> g[i].S;

    for (;q > 0; q--)
    {
        int x, y;

        cin >> x >> y;

        set <int> se; se.clear();

        int mx = 0;

        for (int i = 0; i < n; i++)
        {
            if (y < g[i].F.S  || g[i].S < y) continue;

            se.insert(g[i].F.F.S);

            mx = max(mx, abs(x - g[i].F.F.F));
        }

        if (sz(se) != k) {cout << -1 << endl; continue;}

        cout << mx << 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