oj.uz

Submission #763581

# Submission time Handle Problem Language Result Execution time Memory
763581 2023-06-22T13:17:52 Z Blagoj Trading (IZhO13_trading) C++17
100 / 100
 213 ms 27640 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast,unroll-loops")

using namespace std;

#define endl '\n'
#define ll long long
#define all(x) x.begin(), x.end()

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> v[n + 2];
    for (int i = 0; i < m; i++) {
        int l, r, x;
        cin >> l >> r >> x;
        v[l].push_back({0, x - l});
        v[r + 1].push_back({1, x - l});
    }
    multiset<int> s;
    for (int i = 1; i <= n; i++) {
        for (auto x : v[i]) {
            if (x.first == 0) s.insert(x.second);
            else s.erase(s.find(x.second));
        }
        if (!s.size()) cout << 0 << " ";
        else cout << *s.rbegin() + i << " ";
    }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 100 ms 14284 KB Output is correct
8 Correct 116 ms 16304 KB Output is correct
9 Correct 111 ms 17200 KB Output is correct
10 Correct 139 ms 18848 KB Output is correct
11 Correct 129 ms 19212 KB Output is correct
12 Correct 161 ms 21952 KB Output is correct
13 Correct 139 ms 20364 KB Output is correct
14 Correct 181 ms 21448 KB Output is correct
15 Correct 193 ms 23764 KB Output is correct
16 Correct 213 ms 23164 KB Output is correct
17 Correct 172 ms 23740 KB Output is correct
18 Correct 201 ms 27572 KB Output is correct
19 Correct 183 ms 24728 KB Output is correct
20 Correct 201 ms 27640 KB Output is correct