제출 #1053048

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053048		Zbyszek99	Trading (IZhO13_trading)	C++17	100 / 100	143 ms	29892 KiB

trading

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

vector<int> starts[300001];
vector<int> ends_[300002];

void solve()
{
    int n,q;
    cin >> n >> q;
    rep(i,q)
    {
        int a,b,c;
        cin >> a >> b >> c;
        c -= a;
        starts[a].pb(c);
        ends_[b+1].pb(c);
    }
    multiset<int> s;
    rep2(i,1,n)
    {
        forall(it,starts[i]) s.insert(it);
        forall(it,ends_[i]) s.erase(s.find(it));
        if(size(s) == 0) cout << "0 ";
        else
        {
            multiset<int>::iterator it = s.end();
            it--;
            cout << *it + i<< " ";
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random();
    int t = 1;
    //cin >> t;
    while(t--) solve();
}

• Subtask 1: 100 / 100