oj.uz

Submission #969877

# Submission time Handle Problem Language Result Execution time Memory
969877 2024-04-25T17:54:18 Z VMaksimoski008 Trading (IZhO13_trading) C++17
100 / 100
 360 ms 29328 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, q, l, r, k;
    cin >> n >> q;

    vector<int> L[n+1], R[n+1];
    for(int i=0; i<q; i++) {
        cin >> l >> r >> k;
        L[l].push_back(k - l);
        R[r].push_back(k - l);
    }

    multiset<int> ms;
    for(int i=1; i<=n; i++) {
        for(int &x : L[i]) ms.insert(x);
        if(ms.empty()) cout << 0 << " ";
        else cout << i + *ms.rbegin() << " ";
        for(int &x : R[i]) ms.erase(ms.find(x));
    }

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 159 ms 15692 KB Output is correct
8 Correct 173 ms 17228 KB Output is correct
9 Correct 196 ms 17512 KB Output is correct
10 Correct 222 ms 19096 KB Output is correct
11 Correct 227 ms 20388 KB Output is correct
12 Correct 245 ms 21956 KB Output is correct
13 Correct 249 ms 21928 KB Output is correct
14 Correct 257 ms 23312 KB Output is correct
15 Correct 292 ms 24412 KB Output is correct
16 Correct 295 ms 24792 KB Output is correct
17 Correct 337 ms 25656 KB Output is correct
18 Correct 302 ms 28480 KB Output is correct
19 Correct 297 ms 26564 KB Output is correct
20 Correct 360 ms 29328 KB Output is correct