Submission #71952

#	Time	Username	Problem	Language	Result	Execution time	Memory
71952		KLPP	New Home (APIO18_new_home)	C++14	5 / 100	5091 ms	24780 KiB

new_home

#include<iostream>
#include<stdio.h>
#include<vector>
#include<queue>
#include<algorithm>

using namespace std;
typedef long long int lld;
int abs(int x){
	if(x>0)return x;
	return -x;
}
int main(){
	int n,q,k;
	cin>>n>>k>>q;
	int stores[n][4];
	for(int i=0;i<n;i++){
		cin>>stores[i][0]>>stores[i][1]>>stores[i][2]>>stores[i][3];
	}
	/*for(int i=0;i<n;i++){
		cout<<stores[i][0]<<stores[i][1]<<stores[i][2]<<stores[i][3]<<endl;
	}cout<<endl;*/
	while(q--){
		int x,y;
		cin>>x>>y;
		int best[k];	
		for(int i=0;i<k;i++)best[i]=100000001;
		for(int i=0;i<n;i++){//cout<<stores[i][2]<<" "<<stores[i][3]<<endl;
if(stores[i][2]<=y && y<=stores[i][3]){//cout<<i<<" ";
	best[stores[i][1]-1]=min(best[stores[i][1]-1],abs(x-stores[i][0]));
}
		}//cout<<endl;
		int ans=0;
		for(int i=0;i<k;i++){
			ans=max(ans,best[i]);
			//cout<<best[i]<<" ";
		}
		if(ans<100000001)cout<<ans<<endl;
		else cout<<-1<<endl;
	}
	

	return 0;	
}

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