Submission #1167234

#	Time	Username	Problem	Language	Result	Execution time	Memory
1167234		steveonalex	Constellation 3 (JOI20_constellation3)	C++20	0 / 100	3 ms	5192 KiB

constellation3

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1ULL << (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 lcm(ll a, ll b){return a / gcd(a, b) * b;}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}

//mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
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", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

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

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

    SegmentTree(int _n, vector<int> b){
        n = _n;
        a.resize(n*2+2, {0, 0});
        for(int i = 1; i<= n; ++i) a[i+n] = make_pair(b[i], i);
        for(int i = n; i >= 1; --i) a[i] = max(a[i * 2], a[i * 2 + 1]);
    }

    pair<int, int> get(int l, int r){
        l += n; r += n + 1;
        pair<int, int> ans = {0, 0};
        while(l < r){
            if (l & 1) maximize(ans, a[l++]);
            if (r & 1) maximize(ans, a[--r]);
            l >>= 1; r >>= 1;
        }
        return ans;
    }
};

const ll INF = 1e18 + 69;

struct SexSet{
    set<pair<int, ll>> S;
    ll offset;

    SexSet(){
        offset = 0;
        S.insert(make_pair(0, 0));
    }

    void increase_offset(ll x){
        offset += x;
    }

    void add_element(pair<int, ll> x){
        x.second -= offset;
        while(true){
            pair<int, ll> cur = make_pair(x.first, -INF);
            auto it = S.lower_bound(cur);
            if (it == S.end()) break;
            cur = *it;
            if (cur.first == x.first && cur.second >= x.second) return;
            if (cur.second > x.second) break;
            S.erase(it);
        }
        S.insert(x);
    }

    pair<int, ll> front(){
        pair<int, ll> ans = *S.begin();
        ans.second += offset;
        return ans;
    }

    void pop_front(){
        S.erase(S.begin());
    }

    int size(){
        return S.size();
    }

    vector<pair<int, ll>> convert(){
        vector<pair<int, ll>> arr;
        for(auto i: S){
            i.second += offset;
            arr.push_back(i);
        }
        return arr;
    }

    void clear(){
        offset = 0;
        S.clear();
    }
};

const int N = 2e5 + 69, LOG_N = 18;

int n, m;
vector<int> b;
vector<pair<int, ll>> stars[N];
SexSet dp[LOG_N * 2];

void gate_keep(SexSet &arr, int lobo){
    ll ma = 0;
    while(arr.size()){
        pair<int, ll> f = arr.front();
        if (f.first > lobo) break;
        arr.pop_front();
        maximize(ma, f.second);
    }

    arr.add_element(make_pair(lobo, ma));
}

void dnc(int l, int r, SegmentTree &st, int layer){
    if (l > r) return;

    int mid = st.get(l, r).second;
    if (r - mid > mid - l){
        dnc(mid+1, r, st, layer);

        SexSet mid_part;
        for(auto i: stars[mid]) mid_part.add_element(i);

        SexSet left_part;
        dp[layer+1].clear();
        dnc(l, mid-1, st, layer + 1);
        left_part = dp[layer+1];

        gate_keep(dp[layer], b[mid]);
        gate_keep(mid_part, b[mid]);
        gate_keep(left_part, b[mid]);

        ll s1 = dp[layer].front().second, s2 = mid_part.front().second, s3 = left_part.front().second;
        ll s = s1 + s2 + s3;
        dp[layer].increase_offset(s - s1);
        mid_part.increase_offset(s - s2);
        left_part.increase_offset(s - s3);

        vector<pair<int, ll>> real = mid_part.convert();
        for(auto i: real) dp[layer].add_element(i);
        real = left_part.convert();
        for(auto i: real) dp[layer].add_element(i);
    }
    else{
        dnc(l, mid-1, st, layer);

        SexSet mid_part;
        for(auto i: stars[mid]) mid_part.add_element(i);

        SexSet right_part;
        dp[layer+1].clear();
        dnc(mid+1, r, st, layer + 1);
        right_part = dp[layer+1];

        gate_keep(dp[layer], b[mid]);
        gate_keep(mid_part, b[mid]);
        gate_keep(right_part, b[mid]);


        ll s1 = dp[layer].front().second, s2 = mid_part.front().second, s3 = right_part.front().second;
        ll s = s1 + s2 + s3;
        dp[layer].increase_offset(s - s1);
        mid_part.increase_offset(s - s2);
        right_part.increase_offset(s - s3);

        vector<pair<int, ll>> real = mid_part.convert();
        for(auto i: real) dp[layer].add_element(i);
        real = right_part.convert();
        for(auto i: real) dp[layer].add_element(i);
    }
}

void solve(){
    cin >> n;

    b.resize(n+1);
    for(int i = 1; i <= n; ++i) cin >> b[i];

    cin >> m;

    ll sum = 0;
    for(int i = 0; i < m; ++i){
        int x, y, z; cin >> x >> y >> z;
        stars[x].push_back(make_pair(y, z));
        sum += z;
    }

    SegmentTree st(n, b);

    dnc(1, n, st, 0);

    ll ans = sum;
    vector<pair<int, ll>> arr = dp[0].convert();

    if (arr.size()) ans -= arr.back().second;
//    if (dp[0].size()) ans -= dp[0].back().second;

    cout << ans << "\n";
}

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

    clock_t start = clock();

    solve();

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

    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 65