#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll, ll>;
#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 3e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int N, M;
int dp[MAX];
int l[MAX], r[MAX], x[MAX];
int vis[MAX];
void Whisper(){
cin >> N >> M;
priority_queue<T, vector<T>, greater<T>> q;
for (int i = 1; i <= M; ++i){
cin >> l[i] >> r[i] >> x[i];
x[i] = -x[i];
q.emplace(x[i], i, l[i], 1);
q.emplace(x[i] - (r[i] - l[i]), i, r[i], 0);
minimize(dp[r[i]], x[i] - (r[i] - l[i]));
minimize(dp[l[i]], x[i]);
}
while (!q.empty()){
auto[du, u, curPos, t] = q.top(); q.pop();
if (vis[curPos]) continue;
vis[curPos] = 1;
if (t == 1){
if (curPos + 1 <= r[u]){
if (minimize(dp[curPos + 1], du - 1)){
q.emplace(dp[curPos + 1], u, curPos + 1, t);
}
}
}
else{
if (curPos - 1 >= l[u]){
if (minimize(dp[curPos - 1], du + 1)){
q.emplace(dp[curPos - 1], u, curPos - 1, t);
}
}
}
}
for (int i = 1; i <= N; ++i) cout << -dp[i] << " ";
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
Compilation message
trading.cpp: In function 'void Whisper()':
trading.cpp:71:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
71 | auto[du, u, curPos, t] = q.top(); q.pop();
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 2 |
Correct |
2 ms |
6488 KB |
Output is correct |
| 3 |
Correct |
1 ms |
6612 KB |
Output is correct |
| 4 |
Correct |
2 ms |
6748 KB |
Output is correct |
| 5 |
Correct |
2 ms |
6748 KB |
Output is correct |
| 6 |
Correct |
3 ms |
7004 KB |
Output is correct |
| 7 |
Incorrect |
99 ms |
26840 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
