-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path128E_Roadwork.cpp
51 lines (46 loc) · 1 KB
/
128E_Roadwork.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <bits/stdc++.h>
#define int long long
#define X first
#define Y second
#define Cheng0928 ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define size(a) signed(a.size())
using namespace std;
struct data{
int S;
int T;
int X;
bool operator<(const data b) const{
return X < b.X;
}
};
void sol(){
int n, q;
cin >> n >> q;
struct data d[n];
for(int i = 0;i<n;i++){
cin >> d[i].S >> d[i].T >> d[i].X;
}
sort(d, d+n);
set<pair<int,int>> p;
for(int i = 0;i<q;i++){
int x;
cin >> x;
p.insert({x,i});
}
vector<int> ans(q);
for(int i = 0;i<n;i++){
auto start = p.lower_bound({d[i].S - d[i].X, 0});
auto it = start;
for(it;it != p.end() && it->first < d[i].T - d[i].X;it++) ans[it->second] = d[i].X;
p.erase(start, it);
}
for(int &it : ans) cout << (it ? it : -1) << '\n';
}
signed main()
{
Cheng0928
/*int t;
cin >> t;
while(t--) */sol();
return 0;
}