oj.uz

Submission #227700

# Submission time Handle Problem Language Result Execution time Memory
227700 2020-04-28T13:38:35 Z emil_physmath Trading (IZhO13_trading) C++17
100 / 100
 377 ms 35424 KB 
#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(n + 1), b(n + 1);
    for (int i = 0; i < m; ++i)
    {
        int l, r, x;
        cin >> l >> r >> x;
        --l; --r;
        a[l].push_back(x - l);
        b[r + 1].push_back(x - l);
    }
    multiset<int> s;
    for (int i = 0; i < n; ++i)
    {
        for (int x: a[i])
            s.insert(x);
        for (int x: b[i])
            s.erase(s.find(x));
         if (s.empty())
            cout << 0 << ' ';
         else
            cout << i + *s.rbegin() << ' ';
    }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 171 ms 18672 KB Output is correct
8 Correct 186 ms 20464 KB Output is correct
9 Correct 211 ms 21164 KB Output is correct
10 Correct 216 ms 22768 KB Output is correct
11 Correct 216 ms 24176 KB Output is correct
12 Correct 248 ms 26220 KB Output is correct
13 Correct 250 ms 26220 KB Output is correct
14 Correct 277 ms 27888 KB Output is correct
15 Correct 303 ms 29168 KB Output is correct
16 Correct 373 ms 29868 KB Output is correct
17 Correct 310 ms 30572 KB Output is correct
18 Correct 352 ms 34004 KB Output is correct
19 Correct 320 ms 31760 KB Output is correct
20 Correct 377 ms 35424 KB Output is correct