# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690684 | Kaztaev_Alisher | Trading (IZhO13_trading) | C++17 | 330 ms | 30432 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 ll N = 300005 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;
ll n , q;
vector<pair<ll,ll>> v[N];
multiset<ll> st;
void solve(){
cin >> n >> q;
while(q--){
ll l , r , x;
cin >> l >> r >> x;
v[l].push_back({1 , x-l});
v[r+1].push_back({0 , x-l});
}
for(ll i = 1; i <= n; i++){
sort(all(v[i]));
for(pair<ll,ll> x : v[i]){
if(x.F == 1) st.insert(x.S);
else st.erase(st.find(x.S));
}
if(st.size() == 0) cout << "0 ";
else cout << *st.rbegin()+i <<" ";
}
}
/*
*/
signed main(){
ios;
file("trading");
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |