# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671877 | Alihan_8 | Trading (IZhO13_trading) | C++17 | 267 ms | 32180 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>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, q; cin >> n >> q;
vector <pair<int,bool>> p[n+2];
while ( q-- ){
int l, r, x; cin >> l >> r >> x;
p[l].pb({x-l, true}), p[r+1].pb({x-l, false});
}
multiset <int> st;
for ( int i = 1; i <= n; i++ ){
for ( auto [val, flag]: p[i] ){
if ( flag ) st.insert(val);
else st.erase(st.find(val));
}
if ( st.empty() ) cout << "0 ";
else cout << *st.rbegin()+i << ' ';
}
cout << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |