제출 #1192556

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1192556		stefanopulos	Trading (IZhO13_trading)	C++20	100 / 100	167 ms	23244 KiB

trading

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 300005; 

int n, m;

vector<pii> in[mxN];

int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> m;
    ff(i,1,m){
        int l, r, x;
        cin >> l >> r >> x;
        in[l].pb({x - l, 1});
        in[r + 1].pb({x - l, -1});
    }

    multiset<int> ms;
    ff(i,1,n){
        for(auto c : in[i]){
            if(c.se == 1)ms.insert(c.fi);
            else ms.erase(ms.find(c.fi));
        }

        cout << (sz(ms) == 0 ? 0 : i + *ms.rbegin()) << " ";

    }

    cout << '\n';

    return 0;
}
/*



// probati bojenje sahovski
*/
 
 
 
 
 

• Subtask 1: 100 / 100