#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
using namespace std;
using ll = long long;
const int N = 3e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;
vector<pair<int,int>> vec[N];
void solve(int tc) {
int n , m;
cin >> n >> m;
for(int i = 1; i <= m; i ++) {
int l , r, x;
cin >> l >> r >> x;
vec[l].push_back({x-(l-1), 1});
vec[r+1].push_back({x-(l-1), -1});
}
multiset<int> st;
for(int i = 1; i <= n; i ++) {
for(auto to: vec[i]) {
int x = to.F;
int y = to.S;
if(y == 1) {
st.insert(x);
}
else {
st.erase(st.find(x));
}
}
if(st.empty()) {
cout << "0 ";
}
else
cout << *(--st.end())+i-1 << ' ';
}
}
/*
*/
main() {
ios;
int tt = 1 , tc = 0;
// cin >> tt;
while(tt --) {
solve(++tc);
}
return 0;
}
Compilation message
trading.cpp:47:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
47 | main() {
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
7276 KB |
Output is correct |
2 |
Correct |
5 ms |
7252 KB |
Output is correct |
3 |
Correct |
6 ms |
7380 KB |
Output is correct |
4 |
Correct |
5 ms |
7380 KB |
Output is correct |
5 |
Correct |
5 ms |
7380 KB |
Output is correct |
6 |
Correct |
6 ms |
7552 KB |
Output is correct |
7 |
Correct |
128 ms |
15084 KB |
Output is correct |
8 |
Correct |
177 ms |
16472 KB |
Output is correct |
9 |
Correct |
141 ms |
17184 KB |
Output is correct |
10 |
Correct |
160 ms |
18084 KB |
Output is correct |
11 |
Correct |
160 ms |
18036 KB |
Output is correct |
12 |
Correct |
170 ms |
20020 KB |
Output is correct |
13 |
Correct |
183 ms |
18164 KB |
Output is correct |
14 |
Correct |
185 ms |
18980 KB |
Output is correct |
15 |
Correct |
216 ms |
20336 KB |
Output is correct |
16 |
Correct |
233 ms |
19548 KB |
Output is correct |
17 |
Correct |
231 ms |
19868 KB |
Output is correct |
18 |
Correct |
232 ms |
23284 KB |
Output is correct |
19 |
Correct |
230 ms |
20276 KB |
Output is correct |
20 |
Correct |
258 ms |
21916 KB |
Output is correct |