# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690551 | Kalashnikov | Trading (IZhO13_trading) | C++17 | 258 ms | 23284 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.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |