Submission #1218521

#TimeUsernameProblemLanguageResultExecution timeMemory
1218521toast12Trading (IZhO13_trading)C++20
100 / 100
289 ms22528 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<pair<bool, int>>> v(n+2);
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        v[a].push_back({true, c-a});
        v[b+1].push_back({false, c-a});
    }
    multiset<int> s;
    for (int i = 1; i <= n; i++) {
        for (auto x : v[i]) {
            if (x.first) s.insert(x.second);
            else s.erase(s.find(x.second));
        }
        if (s.empty()) cout << 0 << ' ';
        else cout << *(--s.end())+i << ' ';
    }
    cout << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...