-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA.cpp
More file actions
60 lines (60 loc) · 1.24 KB
/
A.cpp
File metadata and controls
60 lines (60 loc) · 1.24 KB
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
#include<bits/stdc++.h>
#define vi vector<int>
#define mp map<int,int>
#define ump unordered_map <int,int>
#define ll long long int
#define pb push_back
#define mod 1000000007
#define int long long
#define loop(i,x,n) for(int i=x;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define test int t; cin>>t; while(t--)
using namespace std;
/*************************************************************************************************/
void solve()
{
int n,m,x,y,z,count=0;
cin>>n>>m;
vi v(n+1,-1);
mp ma;
for(int i=1;i<=n;i++)
ma[i]=0;
loop(i,0,m)
{
cin>>x>>y>>z;
set<int> s;
auto it=ma.lower_bound(x);
while(it->first<=y)
{
//count++;
if(it==ma.end())
break;
if(it->first==z)
{
it++;
continue;
}
s.insert(it->first);
v[it->first]=z;
it++;
}
for(int j:s)
ma.erase(j);
}
for(int i=1;i<=n;i++)
{
if(v[i]==-1)
cout<<"0 ";
else
cout<<v[i]<<' ';
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//test
solve();
return 0;
}