oj.uz

Submission #336570

# Submission time Handle Problem Language Result Execution time Memory
336570 2020-12-15T18:05:25 Z nickmet2004 Trading (IZhO13_trading) C++11
100 / 100
 375 ms 31072 KB 
#include<bits/stdc++.h>

using namespace std;
const int N = 3e5  +5;
int n , m , ans[N] , oo = -2e9;
vector<int> L[N], R[N];
int main (){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= m; ++i){
        int l , r , c;
        cin >> l >> r >> c;
        L[l].emplace_back(c - l); R[r].emplace_back(c - l);
    }
    multiset<int> s;
    s.insert(oo);
    for(int i = 1; i <= n; ++i){
        for(int x : L[i])s.insert(x);
        int y = *s.rbegin();
        if(y == oo) ans[i] = 0;
        else ans[i] = i + y;
        for(int x : R[i])s.erase(s.find(x));
    }
    for(int i = 1; i<= n; ++i) cout << ans[i] << " ";
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 9 ms 14444 KB Output is correct
4 Correct 10 ms 14444 KB Output is correct
5 Correct 10 ms 14572 KB Output is correct
6 Correct 11 ms 14572 KB Output is correct
7 Correct 177 ms 23396 KB Output is correct
8 Correct 208 ms 24292 KB Output is correct
9 Correct 196 ms 24292 KB Output is correct
10 Correct 225 ms 25060 KB Output is correct
11 Correct 228 ms 25828 KB Output is correct
12 Correct 249 ms 27232 KB Output is correct
13 Correct 250 ms 26336 KB Output is correct
14 Correct 263 ms 27488 KB Output is correct
15 Correct 297 ms 27876 KB Output is correct
16 Correct 319 ms 27876 KB Output is correct
17 Correct 333 ms 28512 KB Output is correct
18 Correct 331 ms 31072 KB Output is correct
19 Correct 310 ms 28512 KB Output is correct
20 Correct 375 ms 30556 KB Output is correct