oj.uz

Submission #307580

# Submission time Handle Problem Language Result Execution time Memory
307580 2020-09-28T16:51:03 Z kaplanbar Trading (IZhO13_trading) C++14
100 / 100
 607 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 3e5+5;
int n, q;
multiset<int> add[N], rem[N];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> q;
    for(int i = 0; i < q; i++) {
        int l, r, x;
        cin >> l >> r >> x;
        l--;
        r--;
        add[l].insert(x - l);
        rem[r + 1].insert(x - l);
    }
    multiset<int> cur;
    for(int i = 0; i < n; i++) {
        for(int x : rem[i]) {
            cur.erase(cur.find(-x));
        }
        for(int x : add[i]) {
            cur.insert(-x);
        }
        int now = 0;
        if(cur.size()) now = -(*cur.begin()) + i;
        cout << now << " ";
    }
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 28544 KB Output is correct
2 Correct 17 ms 28544 KB Output is correct
3 Correct 18 ms 28544 KB Output is correct
4 Correct 19 ms 28672 KB Output is correct
5 Correct 19 ms 28800 KB Output is correct
6 Correct 21 ms 28920 KB Output is correct
7 Correct 290 ms 49016 KB Output is correct
8 Correct 309 ms 50552 KB Output is correct
9 Correct 360 ms 52344 KB Output is correct
10 Correct 403 ms 56056 KB Output is correct
11 Correct 367 ms 53496 KB Output is correct
12 Correct 480 ms 59768 KB Output is correct
13 Correct 441 ms 57212 KB Output is correct
14 Correct 474 ms 59512 KB Output is correct
15 Correct 518 ms 62200 KB Output is correct
16 Correct 529 ms 62328 KB Output is correct
17 Correct 520 ms 62584 KB Output is correct
18 Correct 560 ms 65536 KB Output is correct
19 Correct 569 ms 63864 KB Output is correct
20 Correct 607 ms 65536 KB Output is correct