oj.uz

Submission #969876

# Submission time Handle Problem Language Result Execution time Memory
969876 2024-04-25T17:52:25 Z VMaksimoski008 Trading (IZhO13_trading) C++17
100 / 100
 402 ms 34156 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int n, q;
    cin >> n >> q;

    vector<int> L[n+1], R[n+1];
    for(int i=0; i<q; i++) {
        int l, r, k;
        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 1 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 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 160 ms 18344 KB Output is correct
8 Correct 188 ms 20072 KB Output is correct
9 Correct 196 ms 20560 KB Output is correct
10 Correct 218 ms 22216 KB Output is correct
11 Correct 206 ms 23512 KB Output is correct
12 Correct 264 ms 25600 KB Output is correct
13 Correct 237 ms 25544 KB Output is correct
14 Correct 278 ms 27116 KB Output is correct
15 Correct 282 ms 28240 KB Output is correct
16 Correct 295 ms 28984 KB Output is correct
17 Correct 307 ms 29768 KB Output is correct
18 Correct 326 ms 32712 KB Output is correct
19 Correct 299 ms 30660 KB Output is correct
20 Correct 402 ms 34156 KB Output is correct