제출 #287205

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
287205		ScarletS	새 집 (APIO18_new_home)	C++17	5 / 100	5054 ms	15888 KiB

new_home

#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size();
using namespace std;

const int MAXN=3e5+7;
int n,k,x,y,cur,ans,INF=1e9,a[MAXN][4];
vector<int> present[MAXN];

ll solve()
{
	ans=0;
	cin>>x>>y;
	for (int i=1;i<=k;++i)
		present[i].clear();
	for (int i=0;i<n;++i)
		if (a[i][2]<=y&&y<=a[i][3])
			present[a[i][1]].push_back(a[i][0]);
	for (int i=1;i<=k;++i)
	{
		if (present[i].empty())
			return -1;
		cur=INF;
		for (int j : present[i])
			cur=min(cur,abs(j-x));
		//cout<<cur<<"\n";
		ans=max(cur,ans);
	}
	return ans;
}

int main()
{
	int q;
	cin>>n>>k>>q;
	for (int i=0;i<n;++i)
		for (int j=0;j<4;++j)
			cin>>a[i][j];
	while (q--)
		cout<<solve()<<"\n";
}

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