oj.uz

Submission #332085

# Submission time Handle Problem Language Result Execution time Memory
332085 2020-12-01T12:20:13 Z nvmdava Trading (IZhO13_trading) C++17
100 / 100
 219 ms 21864 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 300'005;
const ll MOD = 1'000'000'007;
const int INF = 0x3f3f3f3f;

priority_queue<pair<int, int> > pq;
vector<pair<int, int> > add[N];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin>>n>>m;

    while(m--){
        int l, r, x;
        cin>>l>>r>>x;
        add[l].push_back({x - l, r});
    }

    for(int i = 1; i <= n; ++i){
        for(auto& x : add[i])
            pq.push(x);
        while(!pq.empty() && pq.top().ss < i)
            pq.pop();
        if(pq.empty())
            cout<<"0 ";
        else
            cout<<pq.top().ff + i<<' ';
    }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7404 KB Output is correct
3 Correct 5 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7532 KB Output is correct
6 Correct 7 ms 7660 KB Output is correct
7 Correct 106 ms 14564 KB Output is correct
8 Correct 117 ms 15708 KB Output is correct
9 Correct 126 ms 16220 KB Output is correct
10 Correct 120 ms 16096 KB Output is correct
11 Correct 129 ms 16728 KB Output is correct
12 Correct 143 ms 17944 KB Output is correct
13 Correct 149 ms 17116 KB Output is correct
14 Correct 144 ms 17360 KB Output is correct
15 Correct 187 ms 19552 KB Output is correct
16 Correct 180 ms 18532 KB Output is correct
17 Correct 181 ms 18916 KB Output is correct
18 Correct 204 ms 20196 KB Output is correct
19 Correct 170 ms 19224 KB Output is correct
20 Correct 219 ms 21864 KB Output is correct