제출 #252693

#제출 시각아이디문제언어결과실행 시간메모리
252693Sugardorj새 집 (APIO18_new_home)C++14
5 / 100
5064 ms12920 KiB
#include <bits/stdc++.h> using namespace std; long long b[323567],c[223456],a[323456],tt,d[234564],e[456744]; long long x,m,n,t,k,l; long long i , j,r,s,y,z; string p,q; int main(){ l = 2345688789456; cin >> n>>k>>m; for (i = 0; i <n; i ++) cin >> a[i]>>b[i]>>c[i]>>d[i]; for (i = 0; i<m; i ++){ cin >>x>>y; for (j = 1; j<=k; j ++) e[j]=l; t=0; for (j = 0; j<n; j ++){ if (y<=d[j]&&y>=c[j]){ r= abs(x-a[j]); e[b[j]]=min(e[b[j]],r); } } s = 0; for (j = 1; j<=k; j ++){ s=max(s,e[j]); } if (s == l) s=-1; cout << s<<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...