제출 #860218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
860218		AtabayRajabli	거래 (IZhO13_trading)	C++17	100 / 100	196 ms	30592 KiB

trading

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

// author : AtabeyR

#define pb          push_back
#define pii         pair<int, int>
#define pll         pair<ll, ll>
#define all(v)      v.begin(), v.end()
#define OPT         ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define sec         second
#define fi          first
#define int         ll
#define print(k)    cerr << "Ans : "; cout << k << endl;
#define ins         insert
#define bpc         __builtin_popcountll
#define skip        continue
#define endll        '\n'
#define gcd(a, b)   __gcd(a, b)

typedef long long ll;
typedef unsigned long long ull;
const int oo = 0x3F3F3F3F;
const int ooo = 0x3F3F3F3F3F3F3F3FLL;
const int mod = 998244353;
const int sz = 3e5+6;
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;

int lcm(int a, int b)
{
    return a*b / (__gcd(a, b));
}
int n, m, k, a[sz], b[sz];

struct dt
{
    int l, r, x;
};

bool cmp(dt a, dt b)
{
    return a.x - a.l > b.x - b.l;
}

void solve(int t)
{  
    cin >> n >> m;

    dt g[m+1];
    for(int i = 1; i<=m; i++)
    {
        cin >> g[i].l >> g[i].r >> g[i].x;
    }

    sort(g+1, g+1+m, cmp);

    set<int> s;
    vector<int> temp;
    for(int i = 1; i<=n; i++)s.ins(i);

    int ans[n+1] = {0};
    for(int i = 1; i<=m; i++)
    {
        auto it = s.lower_bound(g[i].l);
        if(it == s.end())skip;

        for(; it != s.end() && *it <= g[i].r; it++)
        {
            ans[*it] = g[i].x + *it - g[i].l;
            temp.pb(*it);
        }

        for(int i : temp)s.erase(i);
        temp.clear();
    }

    for(int i = 1; i<=n; i++)cout << ans[i] << " " ;
    cout << endll;
}

int32_t main()  
{

    // freopen("i.txt", "r", stdin);
    // freopen("o.txt", "w", stdout);

    OPT
    int t = 1;
    //cin >> t;

    for(int i = 1; i<=t; i++)
        solve(i);
}

• Subtask 1: 100 / 100