This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n,k,q;
int x[409];
int t[409];
int a[409];
int b[409];
int dis[409];
int inf=1000000009;
int main(){
    cin>>n>>k>>q;
    for(int i=0;i<n;i++){
        cin>>x[i]>>t[i]>>a[i]>>b[i];
    }
    while(q--){
        for(int i=1;i<=k;i++){
            dis[i]=inf;
        }
        int l,y;
        cin>>l>>y;
        for(int i=0;i<n;i++){
            if(a[i]<=y && y<=b[i]){
                dis[t[i]]=min(dis[t[i]],abs(x[i]-l));
            }   
        }
        int ans=0;
        for(int i=1;i<=k;i++){
            ans=max(ans,dis[i]);
        }
        if(ans==inf)cout<<-1<<endl;
        else cout<<ans<<endl;
    }
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |