oj.uz

Submission #807371

# Submission time Handle Problem Language Result Execution time Memory
807371 2023-08-04T16:30:14 Z GrindMachine Constellation 3 (JOI20_constellation3) C++17
35 / 100
 1500 ms 40780 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;

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);

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

    // optimize with sparse table
    pll mx = {-1,-1};
    for(int i = l; i <= r; ++i){
        pll px = {a[i],i};
        amax(mx,px);
    }
        
    auto [val,u] = mx;
    
    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];

    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

# Verdict Execution time Memory Grader output
1 Correct 11 ms 22328 KB Output is correct
2 Correct 10 ms 22256 KB Output is correct
3 Correct 9 ms 22260 KB Output is correct
4 Correct 9 ms 22228 KB Output is correct
5 Correct 9 ms 22228 KB Output is correct
6 Correct 9 ms 22244 KB Output is correct
7 Correct 10 ms 22272 KB Output is correct
8 Correct 10 ms 22212 KB Output is correct
9 Correct 9 ms 22268 KB Output is correct
10 Correct 10 ms 22256 KB Output is correct
11 Correct 9 ms 22228 KB Output is correct
12 Correct 9 ms 22252 KB Output is correct
13 Correct 11 ms 22256 KB Output is correct
14 Correct 9 ms 22228 KB Output is correct
15 Correct 10 ms 22256 KB Output is correct
16 Correct 9 ms 22320 KB Output is correct
17 Correct 11 ms 22228 KB Output is correct
18 Correct 10 ms 22252 KB Output is correct
19 Correct 10 ms 22280 KB Output is correct
20 Correct 10 ms 22228 KB Output is correct
21 Correct 9 ms 22228 KB Output is correct
22 Correct 10 ms 22176 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 22328 KB Output is correct
2 Correct 10 ms 22256 KB Output is correct
3 Correct 9 ms 22260 KB Output is correct
4 Correct 9 ms 22228 KB Output is correct
5 Correct 9 ms 22228 KB Output is correct
6 Correct 9 ms 22244 KB Output is correct
7 Correct 10 ms 22272 KB Output is correct
8 Correct 10 ms 22212 KB Output is correct
9 Correct 9 ms 22268 KB Output is correct
10 Correct 10 ms 22256 KB Output is correct
11 Correct 9 ms 22228 KB Output is correct
12 Correct 9 ms 22252 KB Output is correct
13 Correct 11 ms 22256 KB Output is correct
14 Correct 9 ms 22228 KB Output is correct
15 Correct 10 ms 22256 KB Output is correct
16 Correct 9 ms 22320 KB Output is correct
17 Correct 11 ms 22228 KB Output is correct
18 Correct 10 ms 22252 KB Output is correct
19 Correct 10 ms 22280 KB Output is correct
20 Correct 10 ms 22228 KB Output is correct
21 Correct 9 ms 22228 KB Output is correct
22 Correct 10 ms 22176 KB Output is correct
23 Correct 10 ms 22344 KB Output is correct
24 Correct 10 ms 22356 KB Output is correct
25 Correct 10 ms 22388 KB Output is correct
26 Correct 10 ms 22368 KB Output is correct
27 Correct 10 ms 22392 KB Output is correct
28 Correct 10 ms 22336 KB Output is correct
29 Correct 11 ms 22356 KB Output is correct
30 Correct 11 ms 22356 KB Output is correct
31 Correct 11 ms 22392 KB Output is correct
32 Correct 11 ms 22552 KB Output is correct
33 Correct 11 ms 22496 KB Output is correct
34 Correct 11 ms 22484 KB Output is correct
35 Correct 11 ms 22528 KB Output is correct
36 Correct 14 ms 22608 KB Output is correct
37 Correct 11 ms 22484 KB Output is correct
38 Correct 12 ms 22740 KB Output is correct
39 Correct 11 ms 22392 KB Output is correct
40 Correct 12 ms 22636 KB Output is correct
41 Correct 10 ms 22356 KB Output is correct
42 Correct 10 ms 22360 KB Output is correct
43 Correct 11 ms 22680 KB Output is correct
44 Correct 10 ms 22400 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 22328 KB Output is correct
2 Correct 10 ms 22256 KB Output is correct
3 Correct 9 ms 22260 KB Output is correct
4 Correct 9 ms 22228 KB Output is correct
5 Correct 9 ms 22228 KB Output is correct
6 Correct 9 ms 22244 KB Output is correct
7 Correct 10 ms 22272 KB Output is correct
8 Correct 10 ms 22212 KB Output is correct
9 Correct 9 ms 22268 KB Output is correct
10 Correct 10 ms 22256 KB Output is correct
11 Correct 9 ms 22228 KB Output is correct
12 Correct 9 ms 22252 KB Output is correct
13 Correct 11 ms 22256 KB Output is correct
14 Correct 9 ms 22228 KB Output is correct
15 Correct 10 ms 22256 KB Output is correct
16 Correct 9 ms 22320 KB Output is correct
17 Correct 11 ms 22228 KB Output is correct
18 Correct 10 ms 22252 KB Output is correct
19 Correct 10 ms 22280 KB Output is correct
20 Correct 10 ms 22228 KB Output is correct
21 Correct 9 ms 22228 KB Output is correct
22 Correct 10 ms 22176 KB Output is correct
23 Correct 10 ms 22344 KB Output is correct
24 Correct 10 ms 22356 KB Output is correct
25 Correct 10 ms 22388 KB Output is correct
26 Correct 10 ms 22368 KB Output is correct
27 Correct 10 ms 22392 KB Output is correct
28 Correct 10 ms 22336 KB Output is correct
29 Correct 11 ms 22356 KB Output is correct
30 Correct 11 ms 22356 KB Output is correct
31 Correct 11 ms 22392 KB Output is correct
32 Correct 11 ms 22552 KB Output is correct
33 Correct 11 ms 22496 KB Output is correct
34 Correct 11 ms 22484 KB Output is correct
35 Correct 11 ms 22528 KB Output is correct
36 Correct 14 ms 22608 KB Output is correct
37 Correct 11 ms 22484 KB Output is correct
38 Correct 12 ms 22740 KB Output is correct
39 Correct 11 ms 22392 KB Output is correct
40 Correct 12 ms 22636 KB Output is correct
41 Correct 10 ms 22356 KB Output is correct
42 Correct 10 ms 22360 KB Output is correct
43 Correct 11 ms 22680 KB Output is correct
44 Correct 10 ms 22400 KB Output is correct
45 Correct 127 ms 40292 KB Output is correct
46 Correct 128 ms 40284 KB Output is correct
47 Correct 131 ms 40740 KB Output is correct
48 Correct 124 ms 40148 KB Output is correct
49 Correct 132 ms 40400 KB Output is correct
50 Correct 128 ms 40148 KB Output is correct
51 Correct 144 ms 40304 KB Output is correct
52 Correct 134 ms 40780 KB Output is correct
53 Correct 124 ms 40268 KB Output is correct
54 Execution timed out 1554 ms 35296 KB Time limit exceeded
55 Halted 0 ms 0 KB -