제출 #379959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
379959		vishesh312	거래 (IZhO13_trading)	C++17	100 / 100	406 ms	35528 KiB

trading

#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ll = long long;
const int mod = 1e9+7;

void solve(int tc) {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> in(n), out(n);
    while (m--) {
        int l, r, x;
        cin >> l >> r >> x;
        --l, --r;
        in[l].push_back(x-l);
        out[r].push_back(x-l);
    }
    multiset<int> ms;
    for (int i = 0; i < n; ++i) {
        for (int x : in[i]) ms.insert(x);
        cout << (ms.empty() ? 0 : *ms.rbegin() + i) << " ";
        for (int x : out[i]) ms.erase(ms.find(x));
    }
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

• Subtask 1: 100 / 100