oj.uz

Submission #470817

# Submission time Handle Problem Language Result Execution time Memory
470817 2021-09-05T20:21:56 Z MarcoMeijer Fireworks (APIO16_fireworks) C++17
26 / 100
 23 ms 28588 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);

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

struct Func {
    ll y = 0, delta = 0, shift = 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 + b.shift - res.shift);
}
void shiftLeft(Func& f, ll x) {
    ll cx = 0;
    ll delta = f.delta;
    while(!f.ms.empty() && *(f.ms.begin()) + f.shift <= x) {
        ll nx = *(f.ms.begin()) + f.shift;
        f.y += (nx-cx)*delta;
        delta++;
        cx = nx;
        f.ms.erase(f.ms.begin());
    }
    f.y += (x-cx)*delta;
    f.shift -= x;
}
ll computeMin(Func& f) {
    ll v = f.y;
    ll delta = f.delta;
    ll lx = 0;
    FOR(i,f.ms) {
        ll cx = i + f.shift;
        if(cx >= 0) {
            v += delta*(cx-lx);
            lx = cx;
        }
        delta++;
        if(delta == 0)
            return v;
    }
    return v;
}
ll computePos(Func& f, ll x) {
    ll v = f.y;
    ll delta = f.delta;
    ll lx = 0;
    FOR(i,f.ms) {
        ll cx = i + f.shift;
        if(cx >= x) {
            v += delta*(x-lx);
            return v;
        }
        if(cx >= 0) {
            v += delta*(cx-lx);
            lx = cx;
        }
        delta++;
    }
    v += delta*(x-lx);
    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].shift = 0;
            f[u].ms.insert(c[u]);
            f[u].ms.insert(c[u]);
        } else {
            FOR(v,chl[u])
                combine(f[u], f[v]);

            // move graph to right
            f[u].shift += c[u];
            f[u].y     -= f[u].delta*c[u];

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

            if(f[u].ms.size() >= 2) {
                // remember positions op last two elements
                int x2 = *(--f[u].ms.end()) + f[u].shift; f[u].ms.erase(--f[u].ms.end()); // delta 1
                int x1 = *(--f[u].ms.end()) + f[u].shift; f[u].ms.erase(--f[u].ms.end()); // delta 0

                // shift graph to left
                shiftLeft(f[u],c[u]);
                f[u].y += c[u];

                // reinsert last two elements
                f[u].ms.insert(x1 - f[u].shift);
                f[u].ms.insert(x2 - f[u].shift);
            } else if(f[u].ms.size() >= 1) {
                // remember positions op last element
                int x1 = *(--f[u].ms.end()) + f[u].shift; f[u].ms.erase(--f[u].ms.end());

                // shift graph to left
                shiftLeft(f[u],c[u]);
                f[u].y += c[u];

                // reinsert last two elements
                f[u].ms.insert(x1 - f[u].shift);
            } else {
                // shift graph to left
                shiftLeft(f[u],c[u]);
                f[u].y += c[u];
            }
        }

    }

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

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28492 KB Output is correct
2 Correct 23 ms 28492 KB Output is correct
3 Correct 15 ms 28492 KB Output is correct
4 Correct 17 ms 28504 KB Output is correct
5 Correct 17 ms 28448 KB Output is correct
6 Correct 15 ms 28556 KB Output is correct
7 Correct 18 ms 28524 KB Output is correct
8 Correct 15 ms 28492 KB Output is correct
9 Correct 15 ms 28492 KB Output is correct
10 Correct 16 ms 28492 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28416 KB Output is correct
2 Correct 15 ms 28512 KB Output is correct
3 Correct 15 ms 28492 KB Output is correct
4 Correct 16 ms 28492 KB Output is correct
5 Correct 16 ms 28448 KB Output is correct
6 Correct 15 ms 28492 KB Output is correct
7 Correct 16 ms 28476 KB Output is correct
8 Correct 18 ms 28528 KB Output is correct
9 Correct 15 ms 28448 KB Output is correct
10 Correct 15 ms 28480 KB Output is correct
11 Correct 16 ms 28432 KB Output is correct
12 Correct 17 ms 28588 KB Output is correct
13 Correct 16 ms 28532 KB Output is correct
14 Correct 16 ms 28432 KB Output is correct
15 Correct 15 ms 28492 KB Output is correct
16 Correct 16 ms 28484 KB Output is correct
17 Correct 15 ms 28544 KB Output is correct
18 Correct 15 ms 28532 KB Output is correct
19 Correct 15 ms 28476 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28492 KB Output is correct
2 Correct 23 ms 28492 KB Output is correct
3 Correct 15 ms 28492 KB Output is correct
4 Correct 17 ms 28504 KB Output is correct
5 Correct 17 ms 28448 KB Output is correct
6 Correct 15 ms 28556 KB Output is correct
7 Correct 18 ms 28524 KB Output is correct
8 Correct 15 ms 28492 KB Output is correct
9 Correct 15 ms 28492 KB Output is correct
10 Correct 16 ms 28492 KB Output is correct
11 Correct 15 ms 28416 KB Output is correct
12 Correct 15 ms 28512 KB Output is correct
13 Correct 15 ms 28492 KB Output is correct
14 Correct 16 ms 28492 KB Output is correct
15 Correct 16 ms 28448 KB Output is correct
16 Correct 15 ms 28492 KB Output is correct
17 Correct 16 ms 28476 KB Output is correct
18 Correct 18 ms 28528 KB Output is correct
19 Correct 15 ms 28448 KB Output is correct
20 Correct 15 ms 28480 KB Output is correct
21 Correct 16 ms 28432 KB Output is correct
22 Correct 17 ms 28588 KB Output is correct
23 Correct 16 ms 28532 KB Output is correct
24 Correct 16 ms 28432 KB Output is correct
25 Correct 15 ms 28492 KB Output is correct
26 Correct 16 ms 28484 KB Output is correct
27 Correct 15 ms 28544 KB Output is correct
28 Correct 15 ms 28532 KB Output is correct
29 Correct 15 ms 28476 KB Output is correct
30 Incorrect 16 ms 28532 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28492 KB Output is correct
2 Correct 23 ms 28492 KB Output is correct
3 Correct 15 ms 28492 KB Output is correct
4 Correct 17 ms 28504 KB Output is correct
5 Correct 17 ms 28448 KB Output is correct
6 Correct 15 ms 28556 KB Output is correct
7 Correct 18 ms 28524 KB Output is correct
8 Correct 15 ms 28492 KB Output is correct
9 Correct 15 ms 28492 KB Output is correct
10 Correct 16 ms 28492 KB Output is correct
11 Correct 15 ms 28416 KB Output is correct
12 Correct 15 ms 28512 KB Output is correct
13 Correct 15 ms 28492 KB Output is correct
14 Correct 16 ms 28492 KB Output is correct
15 Correct 16 ms 28448 KB Output is correct
16 Correct 15 ms 28492 KB Output is correct
17 Correct 16 ms 28476 KB Output is correct
18 Correct 18 ms 28528 KB Output is correct
19 Correct 15 ms 28448 KB Output is correct
20 Correct 15 ms 28480 KB Output is correct
21 Correct 16 ms 28432 KB Output is correct
22 Correct 17 ms 28588 KB Output is correct
23 Correct 16 ms 28532 KB Output is correct
24 Correct 16 ms 28432 KB Output is correct
25 Correct 15 ms 28492 KB Output is correct
26 Correct 16 ms 28484 KB Output is correct
27 Correct 15 ms 28544 KB Output is correct
28 Correct 15 ms 28532 KB Output is correct
29 Correct 15 ms 28476 KB Output is correct
30 Incorrect 16 ms 28532 KB Output isn't correct
31 Halted 0 ms 0 KB -