# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89989 | tjdgus4384 | New Home (APIO18_new_home) | C++14 | 5141 ms | 564988 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<cstdio>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
using namespace std;
multimap<pair<int, int>, int> m;
multiset<int> typeyear[300001];
multiset<int> yearnum;
vector<pair<int, int> > v[300001];
int main(){
int n, q, k, x, t, a, b, l, y;
scanf("%d %d %d", &n, &k, &q);
for(int i = 0;i < n;i++){
scanf("%d %d %d %d", &x, &t, &a, &b);
for(int j = a;j <= b;j++){
if(typeyear[t].count(j) == 0){
yearnum.insert(j);
typeyear[t].insert(j);
}
m.insert({{j, t}, x});
v[t].push_back({j, x});
}
}
for(int i = 0;i <= k;i++) sort(v[i].begin(), v[i].end());
for(int i = 0;i < q;i++){
scanf("%d %d", &l, &y);
if(yearnum.count(y) < k) printf("-1\n");
else{
int ans = 0;
for(int j = 1;j <= k;j++){
int iter = (int)(lower_bound(v[j].begin(), v[j].end(), make_pair(y, l)) - v[j].begin());
if(v[j][iter].first != y) iter--;
int k = abs(v[j][iter].second - l);
iter--;
if(v[j][iter].first == y){
k = min(k, abs(v[j][iter].second - l));
}
ans = max(ans, k);
}
printf("%d\n", ans);
}
}
return 0;
}
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... |