oj.uz

Submission #487965

# Submission time Handle Problem Language Result Execution time Memory
487965 2021-11-17T09:23:50 Z balbit Designated Cities (JOI19_designated_cities) C++14
100 / 100
 729 ms 77152 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 2e5+5;

vector<pii> g[maxn]; // to, value
int up[maxn], updown[maxn], par[maxn];
ll sigup[maxn];

pii deep[maxn]; // dep, where
int dep[maxn];
ll RT = inf;
int p1, p2;
ll all[maxn], L[maxn], R[maxn];


void dfs1(int v, int p) {
    par[v] = p;
    for (pii u : g[v]) {
        if (u.f != p) {
            updown[u.f] = u.s;
            dfs1(u.f, v);
        }
        else up[v] = u.s;
    }
}

void dfs2(int v, int p) {
    for (pii u : g[v]) {
        if (u.f != p) {
            dep[u.f] = dep[v] + up[u.f];
            dfs2(u.f, v);
            sigup[v] += sigup[u.f] + up[u.f];
        }
    }
}

void dfs3(int v, int p) {
    if (p != -1) all[v] = all[p] - up[v] + updown[v];
    else all[v] = sigup[v];

    vector<pii>here; here.pb({dep[v], v});
    for (pii u : g[v]) {
        if (u.f != p) {
            dfs3(u.f,v);
            here.pb(deep[u.f]);
        }
    }
    sort(ALL(here), greater<pii>());
    if (SZ(here) > 1) {
        ll df = all[v] - here[0].f - here[1].f + dep[v]*2;
        bug(here[0].f, here[1].f, here[0].s, here[1].s);
        if (df < RT) {
            RT = df;
            p1 = here[0].s; p2 = here[1].s;
        }
    }
    deep[v] = here[0];
}

pii s[maxn*4];
ll tg[maxn*4];
bool rem[maxn];

void push(int o, int l, int r){
    if (tg[o]) {
        s[o].f += tg[o];
        if (l!=r) {
            tg[o*2] += tg[o];
            tg[o*2+1] += tg[o];
        }
        tg[o] = 0;
    }
}
void MO(int L, int R, ll v, int o=1, int l=0, int r=maxn-1) {
    push(o,l,r);
    if (l>R || r<L) return;
    if (l >= L && r <= R) {
        tg[o] += v;
        push(o,l,r);
        return;
    }
    int mid = (l+r)/2;
    MO(L,R,v,o*2,l,mid);
    MO(L,R,v,o*2+1,mid+1,r);
    s[o] = max(s[o*2], s[o*2+1]);
}


void MOpt(int p, pii v, int o=1, int l=0, int r=maxn-1) {
    if (l>p || r<p) return;
    if (l == r) {
        s[o] = v;
        return;
    }
    int mid = (l+r)/2;
    MOpt(p,v,o*2,l,mid);
    MOpt(p,v,o*2+1,mid+1,r);
    s[o] = max(s[o*2], s[o*2+1]);
}

int IT = 0;

void dfs4(int v, int p) {
    L[v] = R[v] = IT++;
    for (pii u : g[v]) {
        if (u.f != p) {
            dfs4(u.f,v);
            R[v] = R[u.f];
        }
    }
}

ll ans[maxn];

void clr(int v) {
    while (!rem[v]) {
        rem[v] = 1;
        int p = par[v];
        MO(L[v], R[v], -up[v]);
        v = p;
    }
}

signed main(){
    IOS();
    int n; cin>>n;
    REP(i,n-1) {
        int a,b,c,d; cin>>a>>b>>c>>d; swap(c,d);
        g[a].pb({b,c});
        g[b].pb({a,d});
    }

    dfs1(1,-1); dfs2(1,-1); dfs3(1,-1);

    memset(ans, 0x3f, sizeof ans);

    REP1(i,n) {
        bug(i, up[i], dep[i], sigup[i], all[i]);
        MN(ans[1], all[i]);
    }

    bug(RT, p1, p2);
    ans[2] = RT;

    dep[p1] = up[p1] = 0;

    dfs1(p1, -1); dfs2(p1, -1); dfs4(p1, -1);
    rem[p1] = 1;

    REP1(i,n) {
        bug(i, L[i], dep[i], up[i]);
        MOpt(L[i], {dep[i], i});
    }

    bug(s[1].f, s[1].s, dep[p2]);
    clr(p2);


    for (int k = 3; k<=n; ++k) {
        pii hi = s[1];
        bug (hi.f, hi.s);
        RT -= hi.f;
        clr(hi.s);
        ans[k] = RT;
    }

    int qq; cin>>qq;
    while (qq--) {
        int x; cin>>x;
        cout<<ans[x]<<endl;
    }





}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6604 KB Output is correct
2 Correct 3 ms 6604 KB Output is correct
3 Correct 3 ms 6684 KB Output is correct
4 Correct 3 ms 6680 KB Output is correct
5 Correct 3 ms 6732 KB Output is correct
6 Correct 3 ms 6688 KB Output is correct
7 Correct 3 ms 6732 KB Output is correct
8 Correct 3 ms 6732 KB Output is correct
9 Correct 3 ms 6688 KB Output is correct
10 Correct 3 ms 6680 KB Output is correct
11 Correct 4 ms 6732 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6604 KB Output is correct
2 Correct 556 ms 44868 KB Output is correct
3 Correct 729 ms 70084 KB Output is correct
4 Correct 513 ms 44996 KB Output is correct
5 Correct 525 ms 45032 KB Output is correct
6 Correct 592 ms 48684 KB Output is correct
7 Correct 466 ms 44448 KB Output is correct
8 Correct 638 ms 70844 KB Output is correct
9 Correct 405 ms 42696 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6604 KB Output is correct
2 Correct 558 ms 44984 KB Output is correct
3 Correct 645 ms 76652 KB Output is correct
4 Correct 511 ms 47300 KB Output is correct
5 Correct 560 ms 47488 KB Output is correct
6 Correct 582 ms 51740 KB Output is correct
7 Correct 415 ms 46588 KB Output is correct
8 Correct 614 ms 63556 KB Output is correct
9 Correct 413 ms 45240 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6604 KB Output is correct
2 Correct 3 ms 6604 KB Output is correct
3 Correct 3 ms 6684 KB Output is correct
4 Correct 3 ms 6680 KB Output is correct
5 Correct 3 ms 6732 KB Output is correct
6 Correct 3 ms 6688 KB Output is correct
7 Correct 3 ms 6732 KB Output is correct
8 Correct 3 ms 6732 KB Output is correct
9 Correct 3 ms 6688 KB Output is correct
10 Correct 3 ms 6680 KB Output is correct
11 Correct 4 ms 6732 KB Output is correct
12 Correct 3 ms 6604 KB Output is correct
13 Correct 6 ms 7116 KB Output is correct
14 Correct 6 ms 7336 KB Output is correct
15 Correct 6 ms 7116 KB Output is correct
16 Correct 6 ms 7116 KB Output is correct
17 Correct 6 ms 7212 KB Output is correct
18 Correct 6 ms 7116 KB Output is correct
19 Correct 6 ms 7116 KB Output is correct
20 Correct 6 ms 7208 KB Output is correct
21 Correct 6 ms 7244 KB Output is correct
22 Correct 8 ms 7116 KB Output is correct
23 Correct 7 ms 7116 KB Output is correct
24 Correct 6 ms 7244 KB Output is correct
25 Correct 7 ms 7464 KB Output is correct
26 Correct 6 ms 7244 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6604 KB Output is correct
2 Correct 556 ms 44868 KB Output is correct
3 Correct 729 ms 70084 KB Output is correct
4 Correct 513 ms 44996 KB Output is correct
5 Correct 525 ms 45032 KB Output is correct
6 Correct 592 ms 48684 KB Output is correct
7 Correct 466 ms 44448 KB Output is correct
8 Correct 638 ms 70844 KB Output is correct
9 Correct 405 ms 42696 KB Output is correct
10 Correct 3 ms 6604 KB Output is correct
11 Correct 558 ms 44984 KB Output is correct
12 Correct 645 ms 76652 KB Output is correct
13 Correct 511 ms 47300 KB Output is correct
14 Correct 560 ms 47488 KB Output is correct
15 Correct 582 ms 51740 KB Output is correct
16 Correct 415 ms 46588 KB Output is correct
17 Correct 614 ms 63556 KB Output is correct
18 Correct 413 ms 45240 KB Output is correct
19 Correct 3 ms 6604 KB Output is correct
20 Correct 555 ms 47404 KB Output is correct
21 Correct 660 ms 77152 KB Output is correct
22 Correct 529 ms 47364 KB Output is correct
23 Correct 557 ms 47616 KB Output is correct
24 Correct 540 ms 47684 KB Output is correct
25 Correct 554 ms 47708 KB Output is correct
26 Correct 548 ms 47756 KB Output is correct
27 Correct 567 ms 47416 KB Output is correct
28 Correct 596 ms 51020 KB Output is correct
29 Correct 549 ms 47948 KB Output is correct
30 Correct 520 ms 47488 KB Output is correct
31 Correct 498 ms 46776 KB Output is correct
32 Correct 623 ms 64744 KB Output is correct
33 Correct 409 ms 45152 KB Output is correct

Subtask #6
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6604 KB Output is correct
2 Correct 3 ms 6604 KB Output is correct
3 Correct 3 ms 6684 KB Output is correct
4 Correct 3 ms 6680 KB Output is correct
5 Correct 3 ms 6732 KB Output is correct
6 Correct 3 ms 6688 KB Output is correct
7 Correct 3 ms 6732 KB Output is correct
8 Correct 3 ms 6732 KB Output is correct
9 Correct 3 ms 6688 KB Output is correct
10 Correct 3 ms 6680 KB Output is correct
11 Correct 4 ms 6732 KB Output is correct
12 Correct 3 ms 6604 KB Output is correct
13 Correct 556 ms 44868 KB Output is correct
14 Correct 729 ms 70084 KB Output is correct
15 Correct 513 ms 44996 KB Output is correct
16 Correct 525 ms 45032 KB Output is correct
17 Correct 592 ms 48684 KB Output is correct
18 Correct 466 ms 44448 KB Output is correct
19 Correct 638 ms 70844 KB Output is correct
20 Correct 405 ms 42696 KB Output is correct
21 Correct 3 ms 6604 KB Output is correct
22 Correct 558 ms 44984 KB Output is correct
23 Correct 645 ms 76652 KB Output is correct
24 Correct 511 ms 47300 KB Output is correct
25 Correct 560 ms 47488 KB Output is correct
26 Correct 582 ms 51740 KB Output is correct
27 Correct 415 ms 46588 KB Output is correct
28 Correct 614 ms 63556 KB Output is correct
29 Correct 413 ms 45240 KB Output is correct
30 Correct 3 ms 6604 KB Output is correct
31 Correct 6 ms 7116 KB Output is correct
32 Correct 6 ms 7336 KB Output is correct
33 Correct 6 ms 7116 KB Output is correct
34 Correct 6 ms 7116 KB Output is correct
35 Correct 6 ms 7212 KB Output is correct
36 Correct 6 ms 7116 KB Output is correct
37 Correct 6 ms 7116 KB Output is correct
38 Correct 6 ms 7208 KB Output is correct
39 Correct 6 ms 7244 KB Output is correct
40 Correct 8 ms 7116 KB Output is correct
41 Correct 7 ms 7116 KB Output is correct
42 Correct 6 ms 7244 KB Output is correct
43 Correct 7 ms 7464 KB Output is correct
44 Correct 6 ms 7244 KB Output is correct
45 Correct 3 ms 6604 KB Output is correct
46 Correct 555 ms 47404 KB Output is correct
47 Correct 660 ms 77152 KB Output is correct
48 Correct 529 ms 47364 KB Output is correct
49 Correct 557 ms 47616 KB Output is correct
50 Correct 540 ms 47684 KB Output is correct
51 Correct 554 ms 47708 KB Output is correct
52 Correct 548 ms 47756 KB Output is correct
53 Correct 567 ms 47416 KB Output is correct
54 Correct 596 ms 51020 KB Output is correct
55 Correct 549 ms 47948 KB Output is correct
56 Correct 520 ms 47488 KB Output is correct
57 Correct 498 ms 46776 KB Output is correct
58 Correct 623 ms 64744 KB Output is correct
59 Correct 409 ms 45152 KB Output is correct
60 Correct 3 ms 6680 KB Output is correct
61 Correct 623 ms 48796 KB Output is correct
62 Correct 663 ms 73104 KB Output is correct
63 Correct 553 ms 48776 KB Output is correct
64 Correct 599 ms 49040 KB Output is correct
65 Correct 606 ms 48752 KB Output is correct
66 Correct 596 ms 49092 KB Output is correct
67 Correct 565 ms 48908 KB Output is correct
68 Correct 574 ms 49124 KB Output is correct
69 Correct 633 ms 51784 KB Output is correct
70 Correct 602 ms 49388 KB Output is correct
71 Correct 573 ms 48832 KB Output is correct
72 Correct 512 ms 49048 KB Output is correct
73 Correct 658 ms 63300 KB Output is correct
74 Correct 415 ms 47968 KB Output is correct