oj.uz

답안 #577160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
577160 2022-06-14T08:06:53 Z balbit Worst Reporter 4 (JOI21_worst_reporter4) C++14
79 / 100
 1263 ms 76140 KB 
#include <bits/stdc++.h>
#define int ll
#undef BALBIT

using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<ll, ll>
#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 = 0x3f3f3f3f3f3f3f3f;
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;

int C[maxn], H[maxn];

// BIT
struct BIT{
    vector<ll> s;
    int MXN;

    ll QU(int e) {ll re = 0; for (++e; e>0; e-=e&-e) re += s[e]; return re;}
    void MO(int e, ll v) {for (++e; e<MXN; e+=e&-e) s[e] += v;}

    BIT(int ss){
        s.resize(ss+1,0); MXN = ss+1;
    }
    BIT(){}
};

vector<int> g[maxn];
int to[maxn];
bool oncyc[maxn];
ll curval[maxn];
int fa[18][maxn];
int inid[maxn], outid[maxn]; // get(i) = inbit(inid[i])  - outbit(outid[i])
int inpos[maxn], outpos[maxn]; // where to update

vector<int> inord;
vector<int> outord;

BIT inbit, outbit;

void dfs(int v, int p) {
    if (p == -1) fa[0][v] = v;
//    bug(v,p);
    inord.pb(v);
    inid[v] = SZ(inord)-1;
    outid[v] = SZ(outord)-1;
    inpos[v] = SZ(inord)-1;
    for (int u : g[v]) {
        if (!oncyc[u] && u != p) {

            fa[0][u] = v;
            dfs(u,v);
        }
    }
    outord.pb(v);
    outpos[v] = SZ(outord)-1;
}

ll get(int v) {
    // get prefix sum!!
    return inbit.QU(inid[v]) - outbit.QU(outid[v]);
}

void upd(int v, ll w) {
    curval[v] += w;
    inbit.MO(inpos[v], w);
    outbit.MO(outpos[v], w);
}


int nxtset(int v) { // lowest (strict) ancestor of v that is set
    if (oncyc[v]) return -1;
    v = fa[0][v];
    int gv = get(v);
    for (int j = 18-1; j>=0; --j) {
        if (gv - get(fa[j][v]) == 0) {
            v = fa[j][v];
        }
    }
    if (curval[v] == 0) {
        assert(oncyc[v]); return -1;
    }
    return v;
}

pair<ll, ll> run(int v) {
    inord.clear(); outord.clear();
    dfs(v, -1);

    for( int e : inord) curval[e] = 0;

    for (int j = 1; j<18; ++j) {
        for (int tmp : inord){
            fa[j][tmp] = fa[j-1][fa[j-1][tmp]];
        }
    }

    int sz = SZ(inord);
    inbit = BIT(sz);
    outbit = BIT(sz);

    vector<pii> run;
    for (int x : inord) {
        run.pb({H[x], x});
    }

    sort(ALL(run), [&](pii a, pii b){return a.f != b.f? a.f > b.f : inid[a.s] > inid[b.s];});

    ll re = 0;
    ll re2 = 0;

    for (pii p : run) {
        int x = p.s;
        int y = nxtset(x);
        ll tochg = C[x];
        upd(x, tochg);
        bug(x,y,"plus", tochg);
        re += tochg;
        while (y != -1) {
            int yo = min(tochg, curval[y]);
            upd(y, -yo); tochg -= yo;
            bug(x,y,-yo);
            re -= yo;
            if (curval[y] > 0 || tochg == 0) break;
            y = nxtset(y);
        }

        bug(re);

        if (x == v) {
            re2 = re;
            upd(x, -C[x]); re -= C[x];
        }

    }

    return {re, re2};
}

bool done[maxn], seen[maxn];

void clr(int v) {
    done[v] = 1;
    for (int u : g[v]) {
        if (!done[u]) {
            clr(u);
        }
    }
}

ll getans(int v) {
    assert(!done[v]);

    bug("working", v);

    clr(v);
    int at = v;
    vector<int> walk;
    while (!seen[at]) {
        walk.pb(at);
        seen[at] = 1;
        at = to[at];
    }

    vector<int> cyc;
    while (walk.back() != at) {
        cyc.pb(walk.back()); walk.pop_back();
    }
    cyc.pb(at);

    #ifdef BALBIT
    bug(SZ(cyc));
    for (int e : cyc) cout<<e<<' ';
    cout<<endl;
    #endif // BALBIT

    // case 1: make everything the minimum

    ll mn = inf;
    for (int t : cyc) MN(mn, H[t]), oncyc[t] = 1;

    const ll BIG = 0;

    ll ans1 = 0;
    ll ans2 = 0;

    for (int t : cyc) {
        if (H[t] != mn) {
            H[t] = mn; C[t] = 0;
        }
        pii gt = run(t);
        ans1 += gt.f; ans2+=gt.s;
//        ans1 += run(t) - BIG;
    }


    bug(v, ans1, ans2);


//    for (int t : cyc) {
//        C[t] = 0;
//        ans2 += run(t);
//    }
//
//    bug(ans2);

    return max(ans1, ans2);
}

signed main(){
    IOS();

    int n; cin>>n;
    ll totc = 0;
    REP(i,n) {
        cin>>to[i]; --to[i];
        g[i].pb(to[i]); g[to[i]].pb(i);
        cin>>H[i]>>C[i];
        totc += C[i];
    }
    ll re = 0;
    REP(i,n) {
        if (!done[i]) {
            re += getans(i);
        }
    }
    bug(totc, re);
    cout<<totc - re<<endl;



}

Compilation message

worst_reporter2.cpp: In function 'long long int getans(long long int)':
worst_reporter2.cpp:227:14: warning: unused variable 'BIG' [-Wunused-variable]
  227 |     const ll BIG = 0;
      |              ^~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 3 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 8 ms 6868 KB Output is correct
6 Correct 9 ms 6852 KB Output is correct
7 Correct 9 ms 6868 KB Output is correct
8 Correct 9 ms 6840 KB Output is correct
9 Correct 8 ms 6848 KB Output is correct
10 Correct 8 ms 6868 KB Output is correct
11 Correct 8 ms 6848 KB Output is correct
12 Correct 12 ms 7124 KB Output is correct
13 Correct 10 ms 7208 KB Output is correct
14 Correct 11 ms 6984 KB Output is correct
15 Correct 11 ms 6972 KB Output is correct
16 Correct 8 ms 6868 KB Output is correct
17 Correct 9 ms 6848 KB Output is correct
18 Correct 7 ms 6856 KB Output is correct
19 Correct 9 ms 6996 KB Output is correct
20 Correct 8 ms 6996 KB Output is correct
21 Correct 8 ms 6996 KB Output is correct
22 Correct 8 ms 6868 KB Output is correct
23 Correct 7 ms 6884 KB Output is correct
24 Correct 8 ms 6996 KB Output is correct
25 Correct 9 ms 6972 KB Output is correct
26 Correct 8 ms 7124 KB Output is correct
27 Correct 8 ms 6972 KB Output is correct
28 Correct 9 ms 6976 KB Output is correct
29 Correct 8 ms 7100 KB Output is correct
30 Correct 9 ms 7008 KB Output is correct
31 Correct 9 ms 6996 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 3 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 8 ms 6868 KB Output is correct
6 Correct 9 ms 6852 KB Output is correct
7 Correct 9 ms 6868 KB Output is correct
8 Correct 9 ms 6840 KB Output is correct
9 Correct 8 ms 6848 KB Output is correct
10 Correct 8 ms 6868 KB Output is correct
11 Correct 8 ms 6848 KB Output is correct
12 Correct 12 ms 7124 KB Output is correct
13 Correct 10 ms 7208 KB Output is correct
14 Correct 11 ms 6984 KB Output is correct
15 Correct 11 ms 6972 KB Output is correct
16 Correct 8 ms 6868 KB Output is correct
17 Correct 9 ms 6848 KB Output is correct
18 Correct 7 ms 6856 KB Output is correct
19 Correct 9 ms 6996 KB Output is correct
20 Correct 8 ms 6996 KB Output is correct
21 Correct 8 ms 6996 KB Output is correct
22 Correct 8 ms 6868 KB Output is correct
23 Correct 7 ms 6884 KB Output is correct
24 Correct 8 ms 6996 KB Output is correct
25 Correct 9 ms 6972 KB Output is correct
26 Correct 8 ms 7124 KB Output is correct
27 Correct 8 ms 6972 KB Output is correct
28 Correct 9 ms 6976 KB Output is correct
29 Correct 8 ms 7100 KB Output is correct
30 Correct 9 ms 7008 KB Output is correct
31 Correct 9 ms 6996 KB Output is correct
32 Correct 8 ms 6844 KB Output is correct
33 Correct 575 ms 64260 KB Output is correct
34 Correct 543 ms 64188 KB Output is correct
35 Correct 543 ms 64196 KB Output is correct
36 Correct 545 ms 64240 KB Output is correct
37 Correct 507 ms 64204 KB Output is correct
38 Correct 268 ms 64220 KB Output is correct
39 Correct 1258 ms 75556 KB Output is correct
40 Correct 1201 ms 76088 KB Output is correct
41 Correct 408 ms 76068 KB Output is correct
42 Correct 1263 ms 69900 KB Output is correct
43 Correct 1235 ms 69768 KB Output is correct
44 Correct 520 ms 65180 KB Output is correct
45 Correct 504 ms 65108 KB Output is correct
46 Correct 168 ms 65060 KB Output is correct
47 Correct 616 ms 71340 KB Output is correct
48 Correct 634 ms 71368 KB Output is correct
49 Correct 318 ms 71348 KB Output is correct
50 Correct 190 ms 65572 KB Output is correct
51 Correct 193 ms 65644 KB Output is correct
52 Correct 533 ms 70772 KB Output is correct
53 Correct 543 ms 70580 KB Output is correct
54 Correct 244 ms 76140 KB Output is correct
55 Correct 422 ms 71084 KB Output is correct
56 Correct 443 ms 73676 KB Output is correct
57 Correct 441 ms 74632 KB Output is correct
58 Correct 467 ms 69804 KB Output is correct
59 Correct 444 ms 69812 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 3 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 8 ms 6868 KB Output is correct
6 Correct 9 ms 6852 KB Output is correct
7 Correct 9 ms 6868 KB Output is correct
8 Correct 9 ms 6840 KB Output is correct
9 Correct 8 ms 6848 KB Output is correct
10 Correct 8 ms 6868 KB Output is correct
11 Correct 8 ms 6848 KB Output is correct
12 Correct 12 ms 7124 KB Output is correct
13 Correct 10 ms 7208 KB Output is correct
14 Correct 11 ms 6984 KB Output is correct
15 Correct 11 ms 6972 KB Output is correct
16 Correct 8 ms 6868 KB Output is correct
17 Correct 9 ms 6848 KB Output is correct
18 Correct 7 ms 6856 KB Output is correct
19 Correct 9 ms 6996 KB Output is correct
20 Correct 8 ms 6996 KB Output is correct
21 Correct 8 ms 6996 KB Output is correct
22 Correct 8 ms 6868 KB Output is correct
23 Correct 7 ms 6884 KB Output is correct
24 Correct 8 ms 6996 KB Output is correct
25 Correct 9 ms 6972 KB Output is correct
26 Correct 8 ms 7124 KB Output is correct
27 Correct 8 ms 6972 KB Output is correct
28 Correct 9 ms 6976 KB Output is correct
29 Correct 8 ms 7100 KB Output is correct
30 Correct 9 ms 7008 KB Output is correct
31 Correct 9 ms 6996 KB Output is correct
32 Correct 8 ms 6844 KB Output is correct
33 Correct 575 ms 64260 KB Output is correct
34 Correct 543 ms 64188 KB Output is correct
35 Correct 543 ms 64196 KB Output is correct
36 Correct 545 ms 64240 KB Output is correct
37 Correct 507 ms 64204 KB Output is correct
38 Correct 268 ms 64220 KB Output is correct
39 Correct 1258 ms 75556 KB Output is correct
40 Correct 1201 ms 76088 KB Output is correct
41 Correct 408 ms 76068 KB Output is correct
42 Correct 1263 ms 69900 KB Output is correct
43 Correct 1235 ms 69768 KB Output is correct
44 Correct 520 ms 65180 KB Output is correct
45 Correct 504 ms 65108 KB Output is correct
46 Correct 168 ms 65060 KB Output is correct
47 Correct 616 ms 71340 KB Output is correct
48 Correct 634 ms 71368 KB Output is correct
49 Correct 318 ms 71348 KB Output is correct
50 Correct 190 ms 65572 KB Output is correct
51 Correct 193 ms 65644 KB Output is correct
52 Correct 533 ms 70772 KB Output is correct
53 Correct 543 ms 70580 KB Output is correct
54 Correct 244 ms 76140 KB Output is correct
55 Correct 422 ms 71084 KB Output is correct
56 Correct 443 ms 73676 KB Output is correct
57 Correct 441 ms 74632 KB Output is correct
58 Correct 467 ms 69804 KB Output is correct
59 Correct 444 ms 69812 KB Output is correct
60 Incorrect 3 ms 5204 KB Output isn't correct
61 Halted 0 ms 0 KB -