제출 #396765

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
396765		SavicS	거래 (IZhO13_trading)	C++14	100 / 100	397 ms	36596 KiB

trading

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 300005;
const int inf = 1e9 + 5;

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)

int n, m;

vector<int> in[maxn];
vector<int> out[maxn];

int res[maxn];

int main() 
{
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    cin >> n >> m;
    ff(i,1,m) {
        int L, R, X;
        cin >> L >> R >> X;

        in[L].pb(X - L);
        out[R + 1].pb(X - L);

    }

    multiset<int> ms;
    ff(i,1,n) {
        for(auto c : in[i])ms.insert(c);
        for(auto c : out[i])ms.erase(ms.find(c));

        res[i] = (sz(ms) == 0 ? 0 : i + *ms.rbegin());

    }

    ff(i,1,n)cout << res[i] << " ";
    cout << endl;

    return 0;
}
/**



// probati bojenje sahovski ili slicno

**/

• Subtask 1: 100 / 100