oj.uz

Submission #208774

# Submission time Handle Problem Language Result Execution time Memory
208774 2020-03-12T07:19:37 Z coldEr66 Designated Cities (JOI19_designated_cities) C++14
100 / 100
 647 ms 71328 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
typedef pair<int,ii> iii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define RREP(i,n) for (int i=n-1;i>=0;i--)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"LINE %d: (%s) = ",__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }

const ll MAXn=2e5+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=0x3f3f3f3f;

ll n,tot;
ll ans[MAXn],dp1[MAXn][2],dptt;
ii dp2[MAXn][2];
ll in[MAXn],out[MAXn],idx;
ii fa[MAXn];
ii seg[MAXn*4];
ll tg[MAXn*4],num[MAXn];
vector<ii> e[MAXn];
bool vis[MAXn];
ll bst,bstmx;
void push(ll id){
    if (!tg[id]) return;
    seg[id].X += tg[id];
    tg[id*2+1] += tg[id];
    tg[id*2+2] += tg[id];
    tg[id] = 0;
}
void pull(ll id){
    ll lc = seg[id*2+1].X + tg[id*2+1];
    ll rc = seg[id*2+2].X + tg[id*2+2];
    if (lc > rc) {
        seg[id].X = lc;
        seg[id].Y = seg[id*2+1].Y;
    }
    else {
        seg[id].X = rc;
        seg[id].Y = seg[id*2+2].Y;
    }
}
void build(ll id,ll L,ll R){
    if (L == R-1) {
        seg[id] = ii(0,num[L]);
        return;
    }
    ll mid = (L+R)>>1;
    build(id*2+1,L,mid);
    build(id*2+2,mid,R);
}
void ins(ll id,ll L,ll R,ll l,ll r,ll val){
    if (L == l && R == r) {
        tg[id] += val;
        return;
    }
    push(id);
    ll mid = (L+R)>>1;
    if (l >= mid) ins(id*2+2,mid,R,l,r,val);
    else if (r <= mid) ins(id*2+1,L,mid,l,r,val);
    else {
        ins(id*2+1,L,mid,l,mid,val);
        ins(id*2+2,mid,R,mid,r,val);
    }
    pull(id);
}
ii qr(ll id,ll L,ll R,ll l,ll r){
    if (L == l && R == r) {
        return ii(seg[id].X+tg[id],seg[id].Y);
    }
    push(id);
    ll mid = (L+R)>>1;
    if (l >= mid) return qr(id*2+2,mid,R,l,r);
    else if (r <= mid) return qr(id*2+1,L,mid,l,r);
    else {
        return max(qr(id*2+1,L,mid,l,r),qr(id*2+2,mid,R,l,r));
    }
}
void del(ll x){
    debug(x);
    for (;x != -1 && !vis[x];x = fa[x].X) {
        ll w = fa[x].Y;
        debug(x,in[x],out[x],w);
        ins(0,0,n,in[x],out[x],-w);
        vis[x] = true;
    }
}
void dfs1(ll x,ll p){
    for (auto i:e[x]) {
        if (i.X == p) dp1[x][0] = dp1[p][0] + i.Y;
    }
    for (auto i:e[x]) {
        if (i.X == p) continue;
        else {
            dp1[i.X][1] = dp1[x][1] + i.Y;
            dptt += i.Y;
            dfs1(i.X,x);
        }
    }
}
void dfs2(ll x,ll p){
    dp2[x][0] = ii(0,x);
    dp2[x][1] = ii(0,-1);
    for (auto i:e[x]) {
        if (i.X == p) continue;
        dptt += i.Y;
        dfs2(i.X,x);
        ll cur = dp2[i.X][0].X + i.Y;
        if (cur > dp2[x][0].X) {
            swap(dp2[x][0],dp2[x][1]);
            dp2[x][0].X = cur;
            dp2[x][0].Y = dp2[i.X][0].Y;
        }
        else if (cur > dp2[x][1].X) {
            dp2[x][1].X = cur;
            dp2[x][1].Y = dp2[i.X][0].Y;
        }
    }
    debug(x,dp2[x][0].X,dp2[x][1].X,dp1[x][1],dp1[x][0]);
    ll mx = dp2[x][0].X + dp2[x][1].X + dp1[x][1] - dp1[x][0];
    if (bstmx < mx) {
        bst = x;
        bstmx = mx;
    }
}
void dfstime(ll x,ll p){
    in[x] = idx;
    num[idx++] = x;
    fa[x].X = p;
    for (auto i:e[x]) {
        if (i.X == p) continue;
        dfstime(i.X,x);
        fa[i.X].Y = i.Y;
    }
    out[x] = idx;
}
void dfs3(ll x,ll p){
    debug(x,p);
    for (auto i:e[x]) {
        if (i.X == p) continue;
        debug(i,in[i.X],out[i.X],i.Y);
        ins(0,0,n,in[i.X],out[i.X],i.Y);
        dfs3(i.X,x);
    }
}
void gogo(ll x){
    ii ret = qr(0,0,n,0,n);
    ans[x] = ans[x-1] - ret.X;
    debug(x,ret);
    del(ret.Y);
}
int main(){
    IOS();
    cin >> n;
    REP (i,n-1) {
        ll a,b,c,d;
        cin >> a >> b >> c >> d;
        a--, b--;
        e[a].eb(b,c);
        e[b].eb(a,d);
        tot += c, tot += d;
    }

    dfs1(0,-1);
    ll tmp = dptt;
    REP (i,n) tmp = min(tmp,dptt + dp1[i][0] - dp1[i][1]);
    REP (i,n) debug(dp1[i][0],dp1[i][1]);
    debug(tot,dptt,tmp);
    ans[1] = tmp;
    debug(ans[1]);

    dptt = 0, tmp = 0;
    dfs2(0,0);
    debug(dptt);
    REP (i,n) debug(dp2[i][0],dp2[i][1]);
    debug(dptt,bstmx);
    ans[2] = dptt - bstmx;
    debug(ans[2]);
    pary(fa,fa+n);
    dfstime(dp2[bst][0].Y,dp2[bst][0].Y);
    build(0,0,n);
    dfs3(dp2[bst][0].Y,dp2[bst][0].Y);
    debug("ALIVE");
    debug(dp2[bst][0].Y,dp2[bst][1].Y);
    del(dp2[bst][1].Y);

    for (ll i=3;i<=n;i++) gogo(i);
    ll q;
    cin >> q;
    while (q--) {
        ll x;
        cin >> x;
        cout << ans[x] << endl;
    }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 8 ms 5112 KB Output is correct
5 Correct 7 ms 5112 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 7 ms 5112 KB Output is correct
8 Correct 7 ms 5116 KB Output is correct
9 Correct 7 ms 5112 KB Output is correct
10 Correct 8 ms 5112 KB Output is correct
11 Correct 8 ms 5112 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 538 ms 46564 KB Output is correct
3 Correct 511 ms 62072 KB Output is correct
4 Correct 488 ms 46632 KB Output is correct
5 Correct 509 ms 46568 KB Output is correct
6 Correct 545 ms 48860 KB Output is correct
7 Correct 459 ms 46060 KB Output is correct
8 Correct 586 ms 62456 KB Output is correct
9 Correct 387 ms 45916 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 535 ms 46720 KB Output is correct
3 Correct 536 ms 70904 KB Output is correct
4 Correct 500 ms 51576 KB Output is correct
5 Correct 504 ms 53052 KB Output is correct
6 Correct 553 ms 55684 KB Output is correct
7 Correct 400 ms 52240 KB Output is correct
8 Correct 579 ms 63224 KB Output is correct
9 Correct 372 ms 51804 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 8 ms 5112 KB Output is correct
5 Correct 7 ms 5112 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 7 ms 5112 KB Output is correct
8 Correct 7 ms 5116 KB Output is correct
9 Correct 7 ms 5112 KB Output is correct
10 Correct 8 ms 5112 KB Output is correct
11 Correct 8 ms 5112 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 11 ms 5624 KB Output is correct
14 Correct 10 ms 5756 KB Output is correct
15 Correct 11 ms 5672 KB Output is correct
16 Correct 11 ms 5624 KB Output is correct
17 Correct 10 ms 5624 KB Output is correct
18 Correct 11 ms 5628 KB Output is correct
19 Correct 10 ms 5496 KB Output is correct
20 Correct 11 ms 5624 KB Output is correct
21 Correct 10 ms 5624 KB Output is correct
22 Correct 11 ms 5624 KB Output is correct
23 Correct 10 ms 5624 KB Output is correct
24 Correct 11 ms 5624 KB Output is correct
25 Correct 11 ms 5752 KB Output is correct
26 Correct 11 ms 5624 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 538 ms 46564 KB Output is correct
3 Correct 511 ms 62072 KB Output is correct
4 Correct 488 ms 46632 KB Output is correct
5 Correct 509 ms 46568 KB Output is correct
6 Correct 545 ms 48860 KB Output is correct
7 Correct 459 ms 46060 KB Output is correct
8 Correct 586 ms 62456 KB Output is correct
9 Correct 387 ms 45916 KB Output is correct
10 Correct 7 ms 5112 KB Output is correct
11 Correct 535 ms 46720 KB Output is correct
12 Correct 536 ms 70904 KB Output is correct
13 Correct 500 ms 51576 KB Output is correct
14 Correct 504 ms 53052 KB Output is correct
15 Correct 553 ms 55684 KB Output is correct
16 Correct 400 ms 52240 KB Output is correct
17 Correct 579 ms 63224 KB Output is correct
18 Correct 372 ms 51804 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 540 ms 53096 KB Output is correct
21 Correct 531 ms 71328 KB Output is correct
22 Correct 517 ms 51488 KB Output is correct
23 Correct 546 ms 53436 KB Output is correct
24 Correct 534 ms 52168 KB Output is correct
25 Correct 517 ms 53240 KB Output is correct
26 Correct 515 ms 52088 KB Output is correct
27 Correct 512 ms 52976 KB Output is correct
28 Correct 537 ms 55416 KB Output is correct
29 Correct 524 ms 53496 KB Output is correct
30 Correct 508 ms 51948 KB Output is correct
31 Correct 440 ms 52324 KB Output is correct
32 Correct 585 ms 63740 KB Output is correct
33 Correct 381 ms 52288 KB Output is correct

Subtask #6
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 8 ms 5112 KB Output is correct
5 Correct 7 ms 5112 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 7 ms 5112 KB Output is correct
8 Correct 7 ms 5116 KB Output is correct
9 Correct 7 ms 5112 KB Output is correct
10 Correct 8 ms 5112 KB Output is correct
11 Correct 8 ms 5112 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 538 ms 46564 KB Output is correct
14 Correct 511 ms 62072 KB Output is correct
15 Correct 488 ms 46632 KB Output is correct
16 Correct 509 ms 46568 KB Output is correct
17 Correct 545 ms 48860 KB Output is correct
18 Correct 459 ms 46060 KB Output is correct
19 Correct 586 ms 62456 KB Output is correct
20 Correct 387 ms 45916 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 535 ms 46720 KB Output is correct
23 Correct 536 ms 70904 KB Output is correct
24 Correct 500 ms 51576 KB Output is correct
25 Correct 504 ms 53052 KB Output is correct
26 Correct 553 ms 55684 KB Output is correct
27 Correct 400 ms 52240 KB Output is correct
28 Correct 579 ms 63224 KB Output is correct
29 Correct 372 ms 51804 KB Output is correct
30 Correct 7 ms 5112 KB Output is correct
31 Correct 11 ms 5624 KB Output is correct
32 Correct 10 ms 5756 KB Output is correct
33 Correct 11 ms 5672 KB Output is correct
34 Correct 11 ms 5624 KB Output is correct
35 Correct 10 ms 5624 KB Output is correct
36 Correct 11 ms 5628 KB Output is correct
37 Correct 10 ms 5496 KB Output is correct
38 Correct 11 ms 5624 KB Output is correct
39 Correct 10 ms 5624 KB Output is correct
40 Correct 11 ms 5624 KB Output is correct
41 Correct 10 ms 5624 KB Output is correct
42 Correct 11 ms 5624 KB Output is correct
43 Correct 11 ms 5752 KB Output is correct
44 Correct 11 ms 5624 KB Output is correct
45 Correct 7 ms 5112 KB Output is correct
46 Correct 540 ms 53096 KB Output is correct
47 Correct 531 ms 71328 KB Output is correct
48 Correct 517 ms 51488 KB Output is correct
49 Correct 546 ms 53436 KB Output is correct
50 Correct 534 ms 52168 KB Output is correct
51 Correct 517 ms 53240 KB Output is correct
52 Correct 515 ms 52088 KB Output is correct
53 Correct 512 ms 52976 KB Output is correct
54 Correct 537 ms 55416 KB Output is correct
55 Correct 524 ms 53496 KB Output is correct
56 Correct 508 ms 51948 KB Output is correct
57 Correct 440 ms 52324 KB Output is correct
58 Correct 585 ms 63740 KB Output is correct
59 Correct 381 ms 52288 KB Output is correct
60 Correct 7 ms 5112 KB Output is correct
61 Correct 568 ms 55672 KB Output is correct
62 Correct 568 ms 70264 KB Output is correct
63 Correct 519 ms 54240 KB Output is correct
64 Correct 570 ms 56056 KB Output is correct
65 Correct 553 ms 54520 KB Output is correct
66 Correct 581 ms 55908 KB Output is correct
67 Correct 562 ms 54532 KB Output is correct
68 Correct 542 ms 55916 KB Output is correct
69 Correct 589 ms 57848 KB Output is correct
70 Correct 553 ms 56312 KB Output is correct
71 Correct 525 ms 54636 KB Output is correct
72 Correct 479 ms 55804 KB Output is correct
73 Correct 647 ms 64608 KB Output is correct
74 Correct 432 ms 56736 KB Output is correct