Submission #734797

#TimeUsernameProblemLanguageResultExecution timeMemory
734797keisuke6New Home (APIO18_new_home)C++14
5 / 100
5053 ms18536 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main(){ int N,K,Q; cin>>N>>K>>Q; vector<int> X(N),T(N),A(N),B(N); for(int i=0;i<N;i++){ cin>>X[i]>>T[i]>>A[i]>>B[i]; T[i]--; } while(Q--){ int x,t; cin>>x>>t; vector<int> S(K,1e18); for(int i=0;i<N;i++){ if(A[i] > t || B[i] < t) continue; S[T[i]] = min(S[T[i]],abs(X[i]-x)); } sort(S.rbegin(),S.rend()); cout<<(S[0] == 1e18 ? -1 : S[0])<<endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...