oj.uz

답안 #807375

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
807375 2023-08-04T16:32:17 Z GrindMachine 별자리 3 (JOI20_constellation3) C++17
100 / 100
 310 ms 140252 KB 
// Om Namah Shivaya

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

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

template<typename T>
struct sparse_table {
    /*============================*/

    T merge(T a, T b) {
        return max(a,b);
    }

    /*============================*/

    vector<vector<T>> table;
    vector<int> bin_log;
    int LOG = 0;

    sparse_table() {

    }

    sparse_table(vector<T> &a, int n) {
        while ((1 << LOG) <= n) LOG++;

        table = vector<vector<T>>(n, vector<T>(LOG));
        bin_log = vector<int>(n + 1);

        rep(i, n) table[i][0] = a[i];

        rep1(j, LOG - 1) {
            rep(i, n) {
                int jump = 1 << (j - 1);
                if (i + jump >= n) {
                    break;
                }

                table[i][j] = merge(table[i][j - 1], table[i + jump][j - 1]);
            }
        }

        bin_log[1] = 0;
        for (int i = 2; i <= n; ++i) {
            bin_log[i] = bin_log[i / 2] + 1;
        }
    }

    T query(int l, int r) {
        int len = r - l + 1;
        int k = bin_log[len];

        T val1 = table[l][k];
        T val2 = table[r - (1 << k) + 1][k];

        return merge(val1, val2);
    }
};

struct inc_ds{
    map<ll,ll> mp;

    void insert(ll x, ll y){
        { 
            auto it = mp.upper_bound(x);
            if(it != mp.begin()){
                it--;
                if(it->second >= y){
                    return;
                }
            } 
        }

        mp[x] = y;
        auto it = mp.find(x);

        it++;
        vector<ll> toerase;

        for(; it != mp.end(); ++it){
            if(y < it->second) break;
            toerase.pb(it->first);
        }

        trav(key,toerase){
            mp.erase(key);
        }
    }

    ll query(ll x){
        auto it = mp.upper_bound(x);
        if(it == mp.begin()) return 0;
        it--;
        return it->second;
    }
};

ll n,m;
vector<ll> a(N);
vector<array<ll,3>> b(N);
vector<pll> here[N];
inc_ds mp[N];
vector<ll> add(N);
sparse_table<pll> st;

ll go(ll l, ll r){
    if(l > r) return 0;

    auto [val,u] = st.query(l,r);
    
    ll lv = go(l,u-1);
    ll rv = go(u+1,r);

    ll siz1 = sz(mp[lv].mp);
    ll siz2 = sz(mp[rv].mp);

    if(siz1 < siz2){
        swap(lv,rv);
    }

    ll lv_val = mp[lv].query(val) + add[lv];
    ll rv_val = mp[rv].query(val) + add[rv];

    swap(mp[u],mp[lv]);
    add[u] = add[lv] + rv_val;

    trav(px,mp[rv].mp){
        mp[u].insert(px.ff, (px.ss+add[rv]-add[u]) + lv_val);
    }

    ll best = 0;

    for(auto [y,c] : here[u]){
        amax(best,c);
        mp[u].insert(y, best + lv_val + rv_val - add[u]);
    }

    return u;
}

void solve(int test_case)
{
    cin >> n;
    rep1(i,n) cin >> a[i];
    cin >> m;
    rep1(i,m) rep(j,3) cin >> b[i][j];

    vector<pll> aind(n+5);
    rep1(i,n) aind[i] = {a[i],i};

    st = sparse_table<pll>(aind,n+1);

    ll sum = 0;

    rep1(i,m){
        auto [x,y,c] = b[i];
        sum += c;
        here[x].pb({y,c});
    }

    rep1(i,n) sort(all(here[i]));

    ll root = go(1,n);
    ll mx_stay = mp[root].query(n) + add[root];

    ll ans = sum-mx_stay;
    cout << ans << endl;
}

int main()
{
    fastio;

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

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 22228 KB Output is correct
2 Correct 11 ms 22276 KB Output is correct
3 Correct 11 ms 22228 KB Output is correct
4 Correct 10 ms 22228 KB Output is correct
5 Correct 11 ms 22228 KB Output is correct
6 Correct 10 ms 22228 KB Output is correct
7 Correct 11 ms 22260 KB Output is correct
8 Correct 10 ms 22228 KB Output is correct
9 Correct 10 ms 22228 KB Output is correct
10 Correct 12 ms 22276 KB Output is correct
11 Correct 10 ms 22228 KB Output is correct
12 Correct 10 ms 22272 KB Output is correct
13 Correct 10 ms 22228 KB Output is correct
14 Correct 10 ms 22228 KB Output is correct
15 Correct 10 ms 22228 KB Output is correct
16 Correct 10 ms 22356 KB Output is correct
17 Correct 11 ms 22260 KB Output is correct
18 Correct 10 ms 22356 KB Output is correct
19 Correct 10 ms 22272 KB Output is correct
20 Correct 13 ms 22260 KB Output is correct
21 Correct 10 ms 22252 KB Output is correct
22 Correct 10 ms 22224 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 22228 KB Output is correct
2 Correct 11 ms 22276 KB Output is correct
3 Correct 11 ms 22228 KB Output is correct
4 Correct 10 ms 22228 KB Output is correct
5 Correct 11 ms 22228 KB Output is correct
6 Correct 10 ms 22228 KB Output is correct
7 Correct 11 ms 22260 KB Output is correct
8 Correct 10 ms 22228 KB Output is correct
9 Correct 10 ms 22228 KB Output is correct
10 Correct 12 ms 22276 KB Output is correct
11 Correct 10 ms 22228 KB Output is correct
12 Correct 10 ms 22272 KB Output is correct
13 Correct 10 ms 22228 KB Output is correct
14 Correct 10 ms 22228 KB Output is correct
15 Correct 10 ms 22228 KB Output is correct
16 Correct 10 ms 22356 KB Output is correct
17 Correct 11 ms 22260 KB Output is correct
18 Correct 10 ms 22356 KB Output is correct
19 Correct 10 ms 22272 KB Output is correct
20 Correct 13 ms 22260 KB Output is correct
21 Correct 10 ms 22252 KB Output is correct
22 Correct 10 ms 22224 KB Output is correct
23 Correct 11 ms 22740 KB Output is correct
24 Correct 11 ms 22716 KB Output is correct
25 Correct 11 ms 22796 KB Output is correct
26 Correct 12 ms 22740 KB Output is correct
27 Correct 11 ms 22740 KB Output is correct
28 Correct 11 ms 22740 KB Output is correct
29 Correct 11 ms 22740 KB Output is correct
30 Correct 11 ms 22828 KB Output is correct
31 Correct 11 ms 22712 KB Output is correct
32 Correct 12 ms 22880 KB Output is correct
33 Correct 11 ms 22868 KB Output is correct
34 Correct 11 ms 22868 KB Output is correct
35 Correct 11 ms 22928 KB Output is correct
36 Correct 12 ms 22868 KB Output is correct
37 Correct 14 ms 22868 KB Output is correct
38 Correct 12 ms 23160 KB Output is correct
39 Correct 12 ms 22868 KB Output is correct
40 Correct 11 ms 23024 KB Output is correct
41 Correct 12 ms 22744 KB Output is correct
42 Correct 12 ms 22868 KB Output is correct
43 Correct 12 ms 22996 KB Output is correct
44 Correct 15 ms 22828 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 22228 KB Output is correct
2 Correct 11 ms 22276 KB Output is correct
3 Correct 11 ms 22228 KB Output is correct
4 Correct 10 ms 22228 KB Output is correct
5 Correct 11 ms 22228 KB Output is correct
6 Correct 10 ms 22228 KB Output is correct
7 Correct 11 ms 22260 KB Output is correct
8 Correct 10 ms 22228 KB Output is correct
9 Correct 10 ms 22228 KB Output is correct
10 Correct 12 ms 22276 KB Output is correct
11 Correct 10 ms 22228 KB Output is correct
12 Correct 10 ms 22272 KB Output is correct
13 Correct 10 ms 22228 KB Output is correct
14 Correct 10 ms 22228 KB Output is correct
15 Correct 10 ms 22228 KB Output is correct
16 Correct 10 ms 22356 KB Output is correct
17 Correct 11 ms 22260 KB Output is correct
18 Correct 10 ms 22356 KB Output is correct
19 Correct 10 ms 22272 KB Output is correct
20 Correct 13 ms 22260 KB Output is correct
21 Correct 10 ms 22252 KB Output is correct
22 Correct 10 ms 22224 KB Output is correct
23 Correct 11 ms 22740 KB Output is correct
24 Correct 11 ms 22716 KB Output is correct
25 Correct 11 ms 22796 KB Output is correct
26 Correct 12 ms 22740 KB Output is correct
27 Correct 11 ms 22740 KB Output is correct
28 Correct 11 ms 22740 KB Output is correct
29 Correct 11 ms 22740 KB Output is correct
30 Correct 11 ms 22828 KB Output is correct
31 Correct 11 ms 22712 KB Output is correct
32 Correct 12 ms 22880 KB Output is correct
33 Correct 11 ms 22868 KB Output is correct
34 Correct 11 ms 22868 KB Output is correct
35 Correct 11 ms 22928 KB Output is correct
36 Correct 12 ms 22868 KB Output is correct
37 Correct 14 ms 22868 KB Output is correct
38 Correct 12 ms 23160 KB Output is correct
39 Correct 12 ms 22868 KB Output is correct
40 Correct 11 ms 23024 KB Output is correct
41 Correct 12 ms 22744 KB Output is correct
42 Correct 12 ms 22868 KB Output is correct
43 Correct 12 ms 22996 KB Output is correct
44 Correct 15 ms 22828 KB Output is correct
45 Correct 218 ms 102732 KB Output is correct
46 Correct 207 ms 101724 KB Output is correct
47 Correct 218 ms 100908 KB Output is correct
48 Correct 213 ms 102776 KB Output is correct
49 Correct 211 ms 100160 KB Output is correct
50 Correct 215 ms 100168 KB Output is correct
51 Correct 211 ms 100468 KB Output is correct
52 Correct 222 ms 102108 KB Output is correct
53 Correct 217 ms 101912 KB Output is correct
54 Correct 212 ms 121476 KB Output is correct
55 Correct 220 ms 120140 KB Output is correct
56 Correct 262 ms 116436 KB Output is correct
57 Correct 206 ms 113872 KB Output is correct
58 Correct 183 ms 114768 KB Output is correct
59 Correct 192 ms 114508 KB Output is correct
60 Correct 289 ms 140252 KB Output is correct
61 Correct 224 ms 112832 KB Output is correct
62 Correct 273 ms 130588 KB Output is correct
63 Correct 220 ms 109404 KB Output is correct
64 Correct 210 ms 109936 KB Output is correct
65 Correct 310 ms 131868 KB Output is correct
66 Correct 213 ms 109224 KB Output is correct