Submission #1192703

#TimeUsernameProblemLanguageResultExecution timeMemory
1192703warrennTrading (IZhO13_trading)C++20
100 / 100
568 ms62088 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long 

signed main(){
    int n,m;
    cin>>n>>m;
    map<int,vector<int> >in;
    map<int,vector<int> >out;
    for(int q=1;q<=m;q++){
        int l,r,x;
        cin>>l>>r>>x;
        in[l].push_back(x-l);
        out[r+1].push_back(x-l);
    }
    multiset<int>cur;
    for(int q=1;q<=n;q++){
        for(auto r : in[q]){
            cur.insert(r);
        }
        for(auto r : out[q]){
            cur.erase(cur.find(r));
        }
        if(cur.empty()){
            cout<<0<<" ";
            continue;
        }
       // cout<<cur.size()<<endl;
        int maks=*--cur.end();
        cout<<maks+q<<" ";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...