# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402250 | A_D | New Home (APIO18_new_home) | C++14 | 3 ms | 460 KiB |
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>
#define int long long
#define ii pair<int,int>
#define F first
#define S second
#define du long double
using namespace std;
const int N=410;
int x[N];
int a[N];
int b[N];
int t[N];
void solve()
{
int n,k,q;
cin>>n>>k>>q;
for(int i=1;i<=n;i++){
cin>>x[i];
cin>>t[i];
cin>>a[i];
cin>>b[i];
t[i]--;
}
while(q--){
int l,y;
scanf("%lld",&l);
scanf("%lld",&y);
vector<int> vec(k,1e8+1);
for(int i=1;i<=n;i++){
if(a[i]<=y&&y<=b[i]){
vec[t[i]]=min(vec[t[i]],abs(x[i]-l));
}
}
int ans=0,bo=0;
for(auto x:vec){
if(x==1e8+1)bo=1;
ans=max(ans,x);
}
if(bo)ans=-1;
cout<<ans<<endl;
}
}
main()
{
int t=1;
// cin>>t;
while(t--)solve();
}
/*
4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10
2 1 3
1 1 1 4
1 1 2 6
1 3
1 5
1 7
1 1 1
100000000 1 1 1
1 1
*/
Compilation message (stderr)
# | 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... |