oj.uz

Submission #47576

# Submission time Handle Problem Language Result Execution time Memory
47576 2018-05-05T04:52:29 Z fallingstar Trading (IZhO13_trading) C++17
100 / 100
 685 ms 31244 KB 
#include <iostream>
#include <vector>
#include <set>

using namespace std;

const int N = 3e5 + 2;

int n, m;
vector<pair<int, int> > begpoint[N], endpoint[N];

int main()
{
    cin >> n >> m;
    for (int i = 0; i < m; ++i)
    {
        int l, r, x;
        cin >> l >> r >> x;
        begpoint[l].push_back({x - l, i});
        endpoint[r].push_back({x - l, i});
    }

    set<pair<int, int> > s;
    for (int i = 1; i <= n; ++i)
    {
        for (auto p: begpoint[i]) s.insert(p);
        if (!s.empty())
            cout << i + prev(s.end())->first << ' ';
        else
            cout << 0 << ' ';
        for (auto p: endpoint[i]) s.erase(p);
    }
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14456 KB Output is correct
2 Correct 12 ms 14456 KB Output is correct
3 Correct 12 ms 14620 KB Output is correct
4 Correct 14 ms 14620 KB Output is correct
5 Correct 15 ms 14876 KB Output is correct
6 Correct 17 ms 14876 KB Output is correct
7 Correct 330 ms 23772 KB Output is correct
8 Correct 366 ms 24312 KB Output is correct
9 Correct 379 ms 24952 KB Output is correct
10 Correct 428 ms 25812 KB Output is correct
11 Correct 404 ms 25812 KB Output is correct
12 Correct 483 ms 27892 KB Output is correct
13 Correct 479 ms 27892 KB Output is correct
14 Correct 500 ms 28040 KB Output is correct
15 Correct 562 ms 28164 KB Output is correct
16 Correct 581 ms 28292 KB Output is correct
17 Correct 553 ms 28576 KB Output is correct
18 Correct 632 ms 31244 KB Output is correct
19 Correct 589 ms 31244 KB Output is correct
20 Correct 685 ms 31244 KB Output is correct