oj.uz

Submission #337966

# Submission time Handle Problem Language Result Execution time Memory
337966 2020-12-22T07:52:08 Z IZhO_2021_I_want_Silver Trading (IZhO13_trading) C++14
100 / 100
 400 ms 35520 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll

const int N = 3e5 + 5;
const int oo = 1e9 + 5;

int n, m;
vector <int> add[N], del[N];
multiset <int> cur;

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int l, r, x;
        cin >> l >> r >> x;
        add[l].pb(x - l);
        del[r+1].pb(x - l);
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < sz(add[i]); ++j) { cur.insert(add[i][j]); }
        for (int j = 0; j < sz(del[i]); ++j) { cur.erase(cur.find(del[i][j])); }
        if (!sz(cur)) { cout << 0 <<" "; continue; }
        cout << *cur.rbegin() + i <<" ";
    }
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message

trading.cpp:61:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 |  main () {
      |        ^

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14444 KB Output is correct
2 Correct 9 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 11 ms 14572 KB Output is correct
6 Correct 11 ms 14572 KB Output is correct
7 Correct 181 ms 22864 KB Output is correct
8 Correct 207 ms 23652 KB Output is correct
9 Correct 210 ms 23652 KB Output is correct
10 Correct 233 ms 24420 KB Output is correct
11 Correct 234 ms 24932 KB Output is correct
12 Correct 275 ms 30432 KB Output is correct
13 Correct 267 ms 29792 KB Output is correct
14 Correct 286 ms 30816 KB Output is correct
15 Correct 324 ms 31716 KB Output is correct
16 Correct 344 ms 31844 KB Output is correct
17 Correct 337 ms 32312 KB Output is correct
18 Correct 365 ms 35168 KB Output is correct
19 Correct 341 ms 32352 KB Output is correct
20 Correct 400 ms 35520 KB Output is correct