제출 #337965

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
337965		IZhO_2021_I_want_Silver	거래 (IZhO13_trading)	C++14	0 / 100	247 ms	42852 KiB

trading

#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 = 2e5 + 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!
*/

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 0 / 100