oj.uz

Submission #867472

# Submission time Handle Problem Language Result Execution time Memory
867472 2023-10-28T12:57:45 Z sleepntsheep Trading (IZhO13_trading) C++17
100 / 100
 120 ms 6600 KB 
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
using ll = long long;
#define N 200005

int n, m, j;
vector<tuple<int, int, int>> v;
priority_queue<pair<int, int>> q;

int main()
{
    ShinLena;
    cin >> n >> m;
    v.resize(m);
    for (auto &[l, r, x] : v) cin >> l >> r >> x;
    sort(ALL(v));
    for (int f, i = 1; i <= n; ++i)
    {
        for (; get<0>(v[j]) == i; q.emplace(get<2>(v[j]) - get<0>(v[j]), get<1>(v[j])), ++j);
        for (f = 0; q.size() && !f; )
        {
            auto [z, r] = q.top();
            if (r >= i) { cout << i + z << ' '; f=1; }
            else q.pop();
        }
        if (!f) cout << "0 ";
    }
    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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 57 ms 3652 KB Output is correct
8 Correct 74 ms 4052 KB Output is correct
9 Correct 70 ms 4392 KB Output is correct
10 Correct 73 ms 5136 KB Output is correct
11 Correct 74 ms 4748 KB Output is correct
12 Correct 83 ms 5584 KB Output is correct
13 Correct 86 ms 4900 KB Output is correct
14 Correct 88 ms 5072 KB Output is correct
15 Correct 96 ms 6196 KB Output is correct
16 Correct 103 ms 5348 KB Output is correct
17 Correct 97 ms 5768 KB Output is correct
18 Correct 106 ms 6232 KB Output is correct
19 Correct 102 ms 6472 KB Output is correct
20 Correct 120 ms 6600 KB Output is correct