oj.uz

Submission #322006

# Submission time Handle Problem Language Result Execution time Memory
322006 2020-11-13T16:57:06 Z jovan_b Trading (IZhO13_trading) C++17
100 / 100
 222 ms 6252 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

int seg[2000005];

void upd(int node, int l, int r, int tl, int tr, int val){
    if(tl > r || l > tr) return;
    if(tl <= l && r <= tr){
        seg[node] = max(seg[node], val);
        return;
    }
    int mid = (l+r)/2;
    upd(node*2, l, mid, tl, tr, val);
    upd(node*2+1, mid+1, r, tl, tr, val);
}

void ispisi(int node, int l, int r){
    if(l == r){
        cout << seg[node]+l << " ";
        return;
    }
    seg[node*2] = max(seg[node*2], seg[node]);
    seg[node*2+1] = max(seg[node*2+1], seg[node]);
    int mid = (l+r)/2;
    ispisi(node*2, l, mid);
    ispisi(node*2+1, mid+1, r);
}

void init(int node, int l, int r){
    if(l == r){
        seg[node] = -l;
        return;
    }
    seg[node] = -1000000000;
    int mid = (l+r)/2;
    init(node*2, l, mid);
    init(node*2+1, mid+1, r);
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;

    int n, m;
    cin >> n >> m;
    init(1, 1, n);
    for(int i=1; i<=m; i++){
        int l, r, x;
        cin >> l >> r >> x;
        upd(1, 1, n, l, r, x-l);
    }
    ispisi(1, 1, n);
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 107 ms 3308 KB Output is correct
8 Correct 118 ms 3564 KB Output is correct
9 Correct 123 ms 3436 KB Output is correct
10 Correct 130 ms 3180 KB Output is correct
11 Correct 148 ms 3988 KB Output is correct
12 Correct 151 ms 3692 KB Output is correct
13 Correct 158 ms 3948 KB Output is correct
14 Correct 160 ms 3564 KB Output is correct
15 Correct 179 ms 3820 KB Output is correct
16 Correct 185 ms 3692 KB Output is correct
17 Correct 181 ms 5868 KB Output is correct
18 Correct 196 ms 6040 KB Output is correct
19 Correct 190 ms 5852 KB Output is correct
20 Correct 222 ms 6252 KB Output is correct