Submission #1133694

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133694		steveonalex	Trading (IZhO13_trading)	C++20	100 / 100	67 ms	18624 KiB

trading

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll gcd(ll a, ll b){return __gcd(a, b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n"){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }


template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }


struct FastIO{
    string buffer;
    vector<ll> king;
    void init(ll _n = 0){
        getline(cin, buffer, '\0');
        buffer += "\n";
        king.reserve(_n);
        ll cur = 0;
        for(char c: buffer){
            if (c <= '9' && c >= '0'){
                if (cur == -1) cur = 0;
                cur = cur * 10 + (c - '0');
            }
            else{
                if (cur != -1) king.push_back(cur);
                cur = -1;
            }
        }
        
        reverse(ALL(king));
    }
    
    template <class T>
    FastIO& operator >> (T &x){
        x = 0;
        if (king.empty()) return *this;
        x = king.back(); king.pop_back();
        return *this;
    }
 
    bool isEmpty(){return king.empty();}
};
 
FastIO fin;

const int INF = 1e9 + 69;

struct SegmentTree{
    int n;
    vector<int> a;

    SegmentTree(int _n){
        n = _n;
        a.resize(n * 2 + 2, -INF);
    }

    int get(int i){
        i += n; 
        int ans = -INF;
        while(i > 0){
            maximize(ans, a[i]);
            i >>= 1;
        }
        return ans;
    }

    void update(int l, int r, int v){
        l += n; r += n + 1;
        while(l < r){
            if (l & 1) maximize(a[l++], v);
            if (r & 1) maximize(a[--r], v);
            l >>= 1; r >>= 1;
        }
    }
};

void solve(){
    int n, q; fin >> n >> q;
    SegmentTree st(n);
    while(q--){
        int l, r, w; fin >> l >> r >> w;
        st.update(l, r, w - l);
    }
    int ans[n+1];
    for(int i = 1; i <= n; ++i){
        ans[i] = max(0, st.get(i) + i);
    }
    for(int i = 1; i <= n; ++i) cout << ans[i] << " ";
    cout << "\n";
}

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

    clock_t start = clock();
    
    fin.init(1e6);
    solve();

    cerr << "Time elapsed: " << clock() - start << "ms!\n";
    return 0;
}

• Subtask 1: 100 / 100