oj.uz

Submission #470822

# Submission time Handle Problem Language Result Execution time Memory
470822 2021-09-05T20:29:28 Z MarcoMeijer Fireworks (APIO16_fireworks) C++14
100 / 100
 411 ms 101852 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 3e5+10;
const int N = (1<<20);

ll n, m;
ll p[MX], c[MX];
vi chl[MX];

struct Func {
    ll y = 0, delta = 0;
    multiset<ll> ms;
};

void combine(Func& res, Func& b) {
    if(res.ms.size() < b.ms.size())
        swap(res,b);
    res.y += b.y;
    res.delta += b.delta;
    FOR(x,b.ms)
        res.ms.insert(x);
}
ll computeMin(Func& f) {
    ll v = f.y;
    ll delta = f.delta;
    ll lx = 0;
    FOR(i,f.ms) {
        ll cx = i;
        if(cx >= 0) {
            v += delta*(cx-lx);
            lx = cx;
        }
        delta++;
        if(delta == 0)
            return v;
    }
    return v;
}

Func f[MX];

void program() {
    IN(n,m);
    p[1] = 0, c[1] = 0;
    REP(u,2,n+m+1) IN(p[u],c[u]);
    n += m;
    RE1(u,n) chl[p[u]].pb(u);


    REV(u,1,n+1) {
        if(chl[u].empty()) {
            // base case
            f[u].y = c[u];
            f[u].delta = -1;
            f[u].ms.insert(c[u]);
            f[u].ms.insert(c[u]);
        } else {
            FOR(v,chl[u])
                combine(f[u], f[v]);

            // assume graph is shifted to the right

            // remove slopes bigger then 1
            while(f[u].delta + f[u].ms.size() > 1)
                f[u].ms.erase(--f[u].ms.end());

            // remember positions op last two elements
            ll x2 = *(--f[u].ms.end()) + c[u]; f[u].ms.erase(--f[u].ms.end()); // delta 1
            ll x1 = *(--f[u].ms.end()) + c[u]; f[u].ms.erase(--f[u].ms.end()); // delta 0

            // shift graph back to the left
            f[u].y += c[u];

            // reinsert last two elements
            f[u].ms.insert(x1);
            f[u].ms.insert(x2);
        }

    }

    OUTL(computeMin(f[1]));
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 26060 KB Output is correct
2 Correct 16 ms 26132 KB Output is correct
3 Correct 16 ms 26112 KB Output is correct
4 Correct 16 ms 26156 KB Output is correct
5 Correct 16 ms 26060 KB Output is correct
6 Correct 16 ms 26156 KB Output is correct
7 Correct 17 ms 26144 KB Output is correct
8 Correct 17 ms 26120 KB Output is correct
9 Correct 16 ms 26160 KB Output is correct
10 Correct 16 ms 26120 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 26168 KB Output is correct
2 Correct 16 ms 26096 KB Output is correct
3 Correct 16 ms 26116 KB Output is correct
4 Correct 15 ms 26120 KB Output is correct
5 Correct 18 ms 26096 KB Output is correct
6 Correct 16 ms 26060 KB Output is correct
7 Correct 16 ms 26280 KB Output is correct
8 Correct 15 ms 26164 KB Output is correct
9 Correct 19 ms 26136 KB Output is correct
10 Correct 16 ms 26188 KB Output is correct
11 Correct 17 ms 26148 KB Output is correct
12 Correct 16 ms 26188 KB Output is correct
13 Correct 16 ms 26140 KB Output is correct
14 Correct 16 ms 26060 KB Output is correct
15 Correct 16 ms 26188 KB Output is correct
16 Correct 16 ms 26188 KB Output is correct
17 Correct 16 ms 26144 KB Output is correct
18 Correct 16 ms 26156 KB Output is correct
19 Correct 16 ms 26168 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 26060 KB Output is correct
2 Correct 16 ms 26132 KB Output is correct
3 Correct 16 ms 26112 KB Output is correct
4 Correct 16 ms 26156 KB Output is correct
5 Correct 16 ms 26060 KB Output is correct
6 Correct 16 ms 26156 KB Output is correct
7 Correct 17 ms 26144 KB Output is correct
8 Correct 17 ms 26120 KB Output is correct
9 Correct 16 ms 26160 KB Output is correct
10 Correct 16 ms 26120 KB Output is correct
11 Correct 16 ms 26168 KB Output is correct
12 Correct 16 ms 26096 KB Output is correct
13 Correct 16 ms 26116 KB Output is correct
14 Correct 15 ms 26120 KB Output is correct
15 Correct 18 ms 26096 KB Output is correct
16 Correct 16 ms 26060 KB Output is correct
17 Correct 16 ms 26280 KB Output is correct
18 Correct 15 ms 26164 KB Output is correct
19 Correct 19 ms 26136 KB Output is correct
20 Correct 16 ms 26188 KB Output is correct
21 Correct 17 ms 26148 KB Output is correct
22 Correct 16 ms 26188 KB Output is correct
23 Correct 16 ms 26140 KB Output is correct
24 Correct 16 ms 26060 KB Output is correct
25 Correct 16 ms 26188 KB Output is correct
26 Correct 16 ms 26188 KB Output is correct
27 Correct 16 ms 26144 KB Output is correct
28 Correct 16 ms 26156 KB Output is correct
29 Correct 16 ms 26168 KB Output is correct
30 Correct 16 ms 26148 KB Output is correct
31 Correct 16 ms 26188 KB Output is correct
32 Correct 16 ms 26376 KB Output is correct
33 Correct 17 ms 26380 KB Output is correct
34 Correct 20 ms 26420 KB Output is correct
35 Correct 18 ms 26544 KB Output is correct
36 Correct 21 ms 26604 KB Output is correct
37 Correct 20 ms 26756 KB Output is correct
38 Correct 19 ms 26700 KB Output is correct
39 Correct 19 ms 26828 KB Output is correct
40 Correct 18 ms 26444 KB Output is correct
41 Correct 18 ms 26432 KB Output is correct
42 Correct 18 ms 26376 KB Output is correct
43 Correct 19 ms 26676 KB Output is correct
44 Correct 20 ms 26772 KB Output is correct
45 Correct 19 ms 26700 KB Output is correct
46 Correct 20 ms 27264 KB Output is correct
47 Correct 22 ms 27212 KB Output is correct
48 Correct 20 ms 27040 KB Output is correct
49 Correct 20 ms 27212 KB Output is correct
50 Correct 19 ms 27032 KB Output is correct
51 Correct 20 ms 26924 KB Output is correct
52 Correct 20 ms 27028 KB Output is correct
53 Correct 22 ms 27024 KB Output is correct
54 Correct 19 ms 27212 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 26060 KB Output is correct
2 Correct 16 ms 26132 KB Output is correct
3 Correct 16 ms 26112 KB Output is correct
4 Correct 16 ms 26156 KB Output is correct
5 Correct 16 ms 26060 KB Output is correct
6 Correct 16 ms 26156 KB Output is correct
7 Correct 17 ms 26144 KB Output is correct
8 Correct 17 ms 26120 KB Output is correct
9 Correct 16 ms 26160 KB Output is correct
10 Correct 16 ms 26120 KB Output is correct
11 Correct 16 ms 26168 KB Output is correct
12 Correct 16 ms 26096 KB Output is correct
13 Correct 16 ms 26116 KB Output is correct
14 Correct 15 ms 26120 KB Output is correct
15 Correct 18 ms 26096 KB Output is correct
16 Correct 16 ms 26060 KB Output is correct
17 Correct 16 ms 26280 KB Output is correct
18 Correct 15 ms 26164 KB Output is correct
19 Correct 19 ms 26136 KB Output is correct
20 Correct 16 ms 26188 KB Output is correct
21 Correct 17 ms 26148 KB Output is correct
22 Correct 16 ms 26188 KB Output is correct
23 Correct 16 ms 26140 KB Output is correct
24 Correct 16 ms 26060 KB Output is correct
25 Correct 16 ms 26188 KB Output is correct
26 Correct 16 ms 26188 KB Output is correct
27 Correct 16 ms 26144 KB Output is correct
28 Correct 16 ms 26156 KB Output is correct
29 Correct 16 ms 26168 KB Output is correct
30 Correct 16 ms 26148 KB Output is correct
31 Correct 16 ms 26188 KB Output is correct
32 Correct 16 ms 26376 KB Output is correct
33 Correct 17 ms 26380 KB Output is correct
34 Correct 20 ms 26420 KB Output is correct
35 Correct 18 ms 26544 KB Output is correct
36 Correct 21 ms 26604 KB Output is correct
37 Correct 20 ms 26756 KB Output is correct
38 Correct 19 ms 26700 KB Output is correct
39 Correct 19 ms 26828 KB Output is correct
40 Correct 18 ms 26444 KB Output is correct
41 Correct 18 ms 26432 KB Output is correct
42 Correct 18 ms 26376 KB Output is correct
43 Correct 19 ms 26676 KB Output is correct
44 Correct 20 ms 26772 KB Output is correct
45 Correct 19 ms 26700 KB Output is correct
46 Correct 20 ms 27264 KB Output is correct
47 Correct 22 ms 27212 KB Output is correct
48 Correct 20 ms 27040 KB Output is correct
49 Correct 20 ms 27212 KB Output is correct
50 Correct 19 ms 27032 KB Output is correct
51 Correct 20 ms 26924 KB Output is correct
52 Correct 20 ms 27028 KB Output is correct
53 Correct 22 ms 27024 KB Output is correct
54 Correct 19 ms 27212 KB Output is correct
55 Correct 24 ms 27932 KB Output is correct
56 Correct 52 ms 32704 KB Output is correct
57 Correct 93 ms 37572 KB Output is correct
58 Correct 123 ms 41156 KB Output is correct
59 Correct 159 ms 45800 KB Output is correct
60 Correct 221 ms 50944 KB Output is correct
61 Correct 217 ms 54216 KB Output is correct
62 Correct 280 ms 57752 KB Output is correct
63 Correct 297 ms 64636 KB Output is correct
64 Correct 325 ms 65156 KB Output is correct
65 Correct 156 ms 40388 KB Output is correct
66 Correct 141 ms 40376 KB Output is correct
67 Correct 159 ms 40608 KB Output is correct
68 Correct 224 ms 56880 KB Output is correct
69 Correct 265 ms 57164 KB Output is correct
70 Correct 249 ms 57208 KB Output is correct
71 Correct 345 ms 101852 KB Output is correct
72 Correct 401 ms 101316 KB Output is correct
73 Correct 391 ms 88772 KB Output is correct
74 Correct 342 ms 88844 KB Output is correct
75 Correct 364 ms 88492 KB Output is correct
76 Correct 363 ms 88532 KB Output is correct
77 Correct 381 ms 86344 KB Output is correct
78 Correct 390 ms 83624 KB Output is correct
79 Correct 411 ms 88564 KB Output is correct