제출 #848613

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
848613		wakandaaa	거래 (IZhO13_trading)	C++17	100 / 100	203 ms	42476 KiB

trading

#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n, m;
vector<pair<int, int> > a[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
    	int l, r, x;
    	cin >> l >> r >> x;
    	a[l].emplace_back(0, x - l);
    	a[r + 1].emplace_back(1, x - l);
    }

    multiset<int> s;
    for (int i = 1; i <= n; ++i) {
    	for (auto [type, val] : a[i]) {
    		if (type == 0) s.insert(val);
    		else s.erase(s.find(val));
    	}
    	cout << ((int) s.size() ? *s.rbegin() + i : 0) << ' ';
    }

    return 0;
}

/*

*/

• Subtask 1: 100 / 100