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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define ROF(i, a, b) for (int i = a; i >= b; --i)
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr;
typedef double DB;
constexpr ll MAXN=static_cast<ll>(2e5)+10,INF=static_cast<ll>(5e18)+3;
ll N,H,W;
struct BAR{
ll x,y,len,idx;
bool operator<(const BAR &other) const{
if(x!=other.x) return x>other.x;
if(y!=other.y) return y<other.y;
if(len!=other.len) return len<other.len;
return false;
}
};
struct SegTreeRMQ{
ll l=0,r=0,val=INF;
}tr[MAXN*4];
ll lazy[MAXN*4];
inline ll ls(ll x){return x<<1;}
inline ll rs(ll x){return x<<1|1;}
inline bool isDisj(ll l,ll r,ll l_,ll r_){
return (r_<l || l_>r);
}
inline void pushdown(ll node){
if(tr[node].l==tr[node].r) return;
if(lazy[node]!=0){
tr[ls(node)].val=lazy[node];
tr[rs(node)].val=lazy[node];
lazy[ls(node)]=lazy[node];
lazy[rs(node)]=lazy[node];
lazy[node]=0;
}
}
inline void pushup(ll node){
node>>=1;
while(node){
tr[node].val=min(tr[ls(node)].val,tr[rs(node)].val);
node>>=1;
}
}
void build(ll node,ll l,ll r){
if(l>r) return;
if(l==r){
tr[node].l=l;
tr[node].r=r;
return;
}
ll mid=l+r>>1;
tr[node].l=l;
tr[node].r=r;
build(ls(node),l,mid);
build(rs(node),mid+1,r);
}
void modify(ll node,ll l,ll r,ll val){
if(isDisj(l,r,tr[node].l,tr[node].r)) return;
pushdown(node);
if(l<=tr[node].l && tr[node].r<=r){
tr[node].val=val;
lazy[node]=val;
pushup(node);
return;
}
if(!isDisj(l,r,tr[ls(node)].l,tr[ls(node)].r)) modify(ls(node),l,r,val);
if(!isDisj(l,r,tr[rs(node)].l,tr[rs(node)].r)) modify(rs(node),l,r,val);
}
ll query(ll node,ll l,ll r){
if(isDisj(l,r,tr[node].l,tr[node].r)) return INF;
pushdown(node);
if(l<=tr[node].l && tr[node].r<=r){
return tr[node].val;
}
ll res=INF;
if(!isDisj(l,r,tr[ls(node)].l,tr[ls(node)].r)) res=min(res,query(ls(node),l,r));
if(!isDisj(l,r,tr[rs(node)].l,tr[rs(node)].r)) res=min(res,query(rs(node),l,r));
return res;
}
ll ans[MAXN];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>H>>W>>N;
vector<BAR> bar(N+5,(BAR){0,0,0});
FOR(i, 1, N){
cin>>bar[i].x>>bar[i].y>>bar[i].len;
bar[i].idx=i;
}
sort(bar.begin()+1,bar.begin()+1+N);
build(1,1,W);
FOR(i,1,N){
ll x=bar[i].x,y=bar[i].y,len=bar[i].len,idx=bar[i].idx;
ll res=query(1,y,y+len-1);
if(res==INF) ans[idx]=H;
else ans[idx]=res-1;
modify(1,y,y+len-1,ans[idx]);
}
FOR(i,1,N){
cout<<ans[i]<<"\n";
}
return 0;
}
|