# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690504 | mansur | Trading (IZhO13_trading) | C++17 | 307 ms | 35260 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include<bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define pf push_front
#define pb push_back
#define vt vector
#define s second
#define f first
#define nl '\n'
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vt<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vt<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
const int N = 2e6 + 6, mod = 998244353;
const ll inf = 1e9;
double eps = 1e-15;
bool fl = 0;
void slv() {
int n, m;
cin >> n >> m;
vt<int> add[n + 1], del[n + 1];
for (int i = 1; i <= m; i++) {
int l, r, x;
cin >> l >> r >> x;
add[l].pb(x - l);
if (r < n) del[r + 1].pb(x - l);
}
multiset<int> s;
for (int i = 1; i <= n; i++) {
for (int x: add[i]) s.insert(x);
for (int x: del[i]) {
s.erase(s.find(x));
}
if (s.empty()) cout << 0 << ' ';
else cout << *--s.end() + i << ' ';
}
}
main() {
//freopen("shops.in", "r", stdin);
//freopen("shops.out", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
int tp = 1;
if (fl) cin >> tp;
while (tp--) {
slv();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |