oj.uz

Submission #807168

# Submission time Handle Problem Language Result Execution time Memory
807168 2023-08-04T14:22:08 Z GrindMachine Constellation 3 (JOI20_constellation3) C++17
35 / 100
 37 ms 31952 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 = 2e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

ll n,m;
vector<ll> a(N);
vector<array<ll,3>> b(N);
ll dp[N][N];
vector<pll> here[N];

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

    pll mx = {-1,-1};
    for(int i = l; i <= r; ++i){
        pll px = {a[i],i};
        amax(mx,px);
    }
        
    auto [val,ind] = mx;
    
    ll lv = go(l,ind-1);
    ll rv = go(ind+1,r);
    
    auto &c = here[ind];    
    ll siz = sz(c);
    ll ptr = 0;
    ll best = 0;

    rep1(k,n){
        while(ptr < siz and c[ptr].ff <= k){
            amax(best,c[ptr++].ss);
        }

        amax(dp[ind][k],dp[lv][k]+dp[rv][val]);
        amax(dp[ind][k],dp[lv][val]+dp[rv][k]);
        amax(dp[ind][k],best+dp[lv][val]+dp[rv][val]);        
    }

    return ind;
}

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 ans = sum-dp[root][n];
    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 2 ms 2260 KB Output is correct
2 Correct 2 ms 2132 KB Output is correct
3 Correct 2 ms 2260 KB Output is correct
4 Correct 2 ms 2132 KB Output is correct
5 Correct 2 ms 2004 KB Output is correct
6 Correct 2 ms 2004 KB Output is correct
7 Correct 1 ms 2004 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Correct 2 ms 2260 KB Output is correct
10 Correct 2 ms 2260 KB Output is correct
11 Correct 2 ms 2260 KB Output is correct
12 Correct 2 ms 2260 KB Output is correct
13 Correct 2 ms 2132 KB Output is correct
14 Correct 2 ms 2132 KB Output is correct
15 Correct 2 ms 2260 KB Output is correct
16 Correct 2 ms 2260 KB Output is correct
17 Correct 1 ms 2132 KB Output is correct
18 Correct 2 ms 2204 KB Output is correct
19 Correct 1 ms 2132 KB Output is correct
20 Correct 2 ms 2132 KB Output is correct
21 Correct 2 ms 2132 KB Output is correct
22 Correct 3 ms 2260 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Correct 2 ms 2132 KB Output is correct
3 Correct 2 ms 2260 KB Output is correct
4 Correct 2 ms 2132 KB Output is correct
5 Correct 2 ms 2004 KB Output is correct
6 Correct 2 ms 2004 KB Output is correct
7 Correct 1 ms 2004 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Correct 2 ms 2260 KB Output is correct
10 Correct 2 ms 2260 KB Output is correct
11 Correct 2 ms 2260 KB Output is correct
12 Correct 2 ms 2260 KB Output is correct
13 Correct 2 ms 2132 KB Output is correct
14 Correct 2 ms 2132 KB Output is correct
15 Correct 2 ms 2260 KB Output is correct
16 Correct 2 ms 2260 KB Output is correct
17 Correct 1 ms 2132 KB Output is correct
18 Correct 2 ms 2204 KB Output is correct
19 Correct 1 ms 2132 KB Output is correct
20 Correct 2 ms 2132 KB Output is correct
21 Correct 2 ms 2132 KB Output is correct
22 Correct 3 ms 2260 KB Output is correct
23 Correct 32 ms 30284 KB Output is correct
24 Correct 24 ms 30368 KB Output is correct
25 Correct 35 ms 30308 KB Output is correct
26 Correct 26 ms 31448 KB Output is correct
27 Correct 25 ms 30532 KB Output is correct
28 Correct 25 ms 30292 KB Output is correct
29 Correct 28 ms 30856 KB Output is correct
30 Correct 27 ms 31676 KB Output is correct
31 Correct 25 ms 30592 KB Output is correct
32 Correct 26 ms 30812 KB Output is correct
33 Correct 27 ms 31924 KB Output is correct
34 Correct 30 ms 31188 KB Output is correct
35 Correct 27 ms 31692 KB Output is correct
36 Correct 30 ms 31768 KB Output is correct
37 Correct 27 ms 31952 KB Output is correct
38 Correct 26 ms 31948 KB Output is correct
39 Correct 27 ms 31436 KB Output is correct
40 Correct 27 ms 30568 KB Output is correct
41 Correct 27 ms 31304 KB Output is correct
42 Correct 37 ms 31568 KB Output is correct
43 Correct 28 ms 30472 KB Output is correct
44 Correct 36 ms 31036 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Correct 2 ms 2132 KB Output is correct
3 Correct 2 ms 2260 KB Output is correct
4 Correct 2 ms 2132 KB Output is correct
5 Correct 2 ms 2004 KB Output is correct
6 Correct 2 ms 2004 KB Output is correct
7 Correct 1 ms 2004 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Correct 2 ms 2260 KB Output is correct
10 Correct 2 ms 2260 KB Output is correct
11 Correct 2 ms 2260 KB Output is correct
12 Correct 2 ms 2260 KB Output is correct
13 Correct 2 ms 2132 KB Output is correct
14 Correct 2 ms 2132 KB Output is correct
15 Correct 2 ms 2260 KB Output is correct
16 Correct 2 ms 2260 KB Output is correct
17 Correct 1 ms 2132 KB Output is correct
18 Correct 2 ms 2204 KB Output is correct
19 Correct 1 ms 2132 KB Output is correct
20 Correct 2 ms 2132 KB Output is correct
21 Correct 2 ms 2132 KB Output is correct
22 Correct 3 ms 2260 KB Output is correct
23 Correct 32 ms 30284 KB Output is correct
24 Correct 24 ms 30368 KB Output is correct
25 Correct 35 ms 30308 KB Output is correct
26 Correct 26 ms 31448 KB Output is correct
27 Correct 25 ms 30532 KB Output is correct
28 Correct 25 ms 30292 KB Output is correct
29 Correct 28 ms 30856 KB Output is correct
30 Correct 27 ms 31676 KB Output is correct
31 Correct 25 ms 30592 KB Output is correct
32 Correct 26 ms 30812 KB Output is correct
33 Correct 27 ms 31924 KB Output is correct
34 Correct 30 ms 31188 KB Output is correct
35 Correct 27 ms 31692 KB Output is correct
36 Correct 30 ms 31768 KB Output is correct
37 Correct 27 ms 31952 KB Output is correct
38 Correct 26 ms 31948 KB Output is correct
39 Correct 27 ms 31436 KB Output is correct
40 Correct 27 ms 30568 KB Output is correct
41 Correct 27 ms 31304 KB Output is correct
42 Correct 37 ms 31568 KB Output is correct
43 Correct 28 ms 30472 KB Output is correct
44 Correct 36 ms 31036 KB Output is correct
45 Runtime error 5 ms 1224 KB Execution killed with signal 11
46 Halted 0 ms 0 KB -