#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e5 + 10, inf = 1e9;
struct store
{
int x, t, a, b;
}s[maxn];
struct query
{
int l, y, idx;
}task[maxn];
int n, k, q;
void input()
{
cin >> n >> k >> q;
for (int i = 1; i <= n; i ++)
cin >> s[i].x >> s[i].t >> s[i].a >> s[i].b;
for (int i = 1; i <= q; i ++)
cin >> task[i].l >> task[i].y, task[i].idx = i;
}
int type[maxn];
int solve_naive(int pivot, int year)
{
for (int i = 1; i <= k; i ++)
type[i] = inf;
for (int i = 1; i <= n; i ++)
{
if (s[i].a <= year && s[i].b >= year)
type[s[i].t] = min(type[s[i].t], abs(pivot - s[i].x));
}
int ans = -1;
for (int i = 1; i <= k; i ++)
{
if (type[i] == inf)
return -1;
ans = max(ans, type[i]);
}
return ans;
}
bool cmp_query(query t1, query t2)
{
return t1.y < t2.y;
}
struct event
{
int type, cor, add, arrive;
event(int _type, int _cor, int _add, int _arrive)
{
type = _type;
cor = _cor;
add = _add;
arrive = _arrive;
}
};
bool cmp_event(event e1, event e2)
{
if (e1.arrive != e2.arrive)
return e1.arrive < e2.arrive;
if (e1.add != e2.add)
return e1.add < e2.add;
return e1.cor < e2.cor; /// could have dublicates
}
multiset < int > act[maxn];
void add_event(int type, int cor)
{
act[type].insert(cor);
}
void remove_event(int type, int cor)
{
act[type].erase(act[type].find(cor));
}
int ans[maxn];
int single_query(int cor)
{
int far = 0;
for (int i = 1; i <= k; i ++)
{
multiset < int > :: iterator it = act[i].upper_bound(cor);
int closest = inf;
///if (it != act[i].end())
///cout << "here " << cor << " " << *it << endl;
if (it != act[i].end())
closest = min(closest, *it - cor);
if (it != act[i].begin())
closest = min(closest, cor - *prev(it));
far = max(far, closest);
///cout << far << endl;
}
if (far > 2e8)
return -1;
return far;
}
void answer_queries()
{
sort(task + 1, task + q + 1, cmp_query);
vector < event > events;
for (int i = 1; i <= n; i ++)
{
events.push_back(event(s[i].t, s[i].x, 1, s[i].a));
events.push_back(event(s[i].t, s[i].x, -1, s[i].b + 1));
}
sort(events.begin(), events.end(), cmp_event);
for (int i = 1; i <= k; i ++)
{
evnets[i].insert(-inf);
events[i].insert(inf);
}
int pt = 1;
for (event cur : events)
{
while(pt <= q && task[pt].y < cur.arrive)
{
ans[task[pt].idx] = single_query(task[pt].l);
pt ++;
}
if (cur.add == 1)
add_event(cur.type, cur.cor);
else
remove_event(cur.type, cur.cor);
}
while(pt <= q)
{
ans[task[pt].idx] = single_query(task[pt].l);
pt ++;
}
for (int i = 1; i <= q; i ++)
cout << ans[i] << endl;
}
void solve()
{
input();
answer_queries();
}
int main()
{
solve();
return 0;
}
/**
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
new_home.cpp: In function 'void answer_queries()':
new_home.cpp:137:9: error: 'evnets' was not declared in this scope; did you mean 'events'?
137 | evnets[i].insert(-inf);
| ^~~~~~
| events
new_home.cpp:138:19: error: '__gnu_cxx::__alloc_traits<std::allocator<event>, event>::value_type' {aka 'struct event'} has no member named 'insert'
138 | events[i].insert(inf);
| ^~~~~~
