oj.uz

Submission #874440

# Submission time Handle Problem Language Result Execution time Memory
874440 2023-11-17T03:57:38 Z 12345678 Trading (IZhO13_trading) C++17
100 / 100
 143 ms 25264 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=3e5+5;

int n, m, l, r, x;
bool op[nx];
priority_queue<pair<int, int>> pq;
vector<pair<int, int>> v[nx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=m; i++) cin>>l>>r>>x, v[l].push_back({-l+x, i}), v[r+1].push_back({i, i});
    for (int i=1; i<=n; i++)
    {
        for (auto [x, y]:v[i])
        {
            if (!op[y]) op[y]=1, pq.push({x, y});
            else op[y]=0;
        }
        while (!pq.empty()&&!op[pq.top().second]) pq.pop();
        cout<<(pq.empty()?0:pq.top().first+i)<<' ';
    }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7260 KB Output is correct
2 Correct 2 ms 7336 KB Output is correct
3 Correct 2 ms 7508 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 2 ms 7580 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 67 ms 16164 KB Output is correct
8 Correct 75 ms 17980 KB Output is correct
9 Correct 78 ms 18288 KB Output is correct
10 Correct 85 ms 18616 KB Output is correct
11 Correct 89 ms 20236 KB Output is correct
12 Correct 102 ms 20488 KB Output is correct
13 Correct 101 ms 20152 KB Output is correct
14 Correct 106 ms 19788 KB Output is correct
15 Correct 118 ms 22724 KB Output is correct
16 Correct 122 ms 22180 KB Output is correct
17 Correct 114 ms 21676 KB Output is correct
18 Correct 132 ms 23492 KB Output is correct
19 Correct 125 ms 23048 KB Output is correct
20 Correct 143 ms 25264 KB Output is correct