oj.uz

Submission #725827

# Submission time Handle Problem Language Result Execution time Memory
725827 2023-04-18T06:45:38 Z MohammadAghil Worst Reporter 4 (JOI21_worst_reporter4) C++17
79 / 100
 397 ms 50244 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i = (l); i < (r); i++)
#define per(i,r,l) for(int i = (r); i >= (l); i--)
#define all(x) begin(x), end(x)
#define sz(x) (int)size(x)
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pp;

void dbg(){
     cerr << endl;
}
template<typename H, typename... T> void dbg(H h, T... t){
     cerr << h << ", ";
     dbg(t...);
}

void IOS(){
     cin.tie(0) -> sync_with_stdio(0);
     #ifndef ONLINE_JUDGE

          #define er(...) cerr << __LINE__ << " <" << #__VA_ARGS__ << ">: ", dbg(__VA_ARGS__)
     #else
          #define er(...) 0
     #endif
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll mod = 1e9 + 7, mod2 = 1e9 + 9, maxn = 2e5 + 5, lg = 21, inf = ll(1e9) + 5;

ll pw(ll a, ll b){
     if(b == 0) return 1;
     ll k = pw(a, b>>1);
     return k*k*(b&1ll?a:1);
}

vector<int> adj[maxn];
ll par[maxn], H[maxn], C[maxn], nxt[maxn];
int h[maxn], cnt[maxn], top[maxn], st[maxn], en[maxn], t, eu[maxn];
ll dp[maxn];


int seg[maxn<<2];

int get(int l, int r, int x = 1, int lx = 0, int rx = t){
     if(l <= lx && r >= rx) return seg[x];
     int mid = (lx + rx)>>1;
     int res = -1;
     if(mid < r) res = get(l, r, x<<1|1, mid, rx);
     if(res + 1) return res;
     if(l < mid) return get(l, r, x<<1, lx, mid);
     return -1;
}

void upd(int i, bool act, int x = 1, int lx = 0, int rx = t){
     if(lx + 1 == rx){
          seg[x] = act? i: -1;
          return;
     }
     int mid = (lx + rx)>>1;
     if(i < mid) upd(i, act, x<<1, lx, mid);
     else upd(i, act, x<<1|1, mid, rx);
     seg[x] = max(seg[x<<1], seg[x<<1|1]);
}

ll fen[maxn];
ll getf(int i){
     ll res = 0;
     for(i++; i; i -= i&-i) res += fen[i];
     return res;
}
ll getf(int l, int r){
     return getf(r-1) - getf(l-1);
}
ll getu(int u){
     return getf(st[u], en[u]);
}
void updf(int i, ll k){
     for(i++; i < maxn; i += i&-i) fen[i] += k;
}

void dfs(int r, int p){
     par[r] = p;
     cnt[r] = 1;
     for(int c: adj[r]){
          h[c] = h[r] + 1;
          dfs(c, r);
          cnt[r] += cnt[c];
     }
}

void dfsHLD(int r, int tp){
     eu[t] = r;
     top[r] = tp, st[r] = t++;
     pp bst = {-1, -1};
     for(int c: adj[r]) bst = max(bst, {cnt[c], c});
     if(bst.ff + 1){
          dfsHLD(bst.ss, tp);
          for(int c: adj[r]) if(c - bst.ss) dfsHLD(c, c);
     }
     en[r] = t;
}

void add(int u){
     dp[u] = getu(u) + C[u];
     ll sm = C[u], cr = u;
     upd(st[u], true);
     u = par[u];
     if(u + 1){
          updf(st[u], sm);
     }
     while(u + 1){
          int x = get(st[top[u]], st[u] + 1);
          if(x + 1){
               x = eu[x];
               if(par[x] + 1) updf(st[par[x]], -sm);
               ll t = getu(x);
               if(t > dp[x]){
                    sm = t - dp[x];
                    upd(st[x], false);
                    u = par[x];
                    if(u + 1) updf(st[u], sm);
               } else break;
          } else u = par[top[u]];
     }
}

int main(){ IOS();  
     int n; cin >> n;
     ll sum = 0;
     rep(i,0,n){
          cin >> nxt[i] >> H[i] >> C[i];
          nxt[i]--;
          sum += C[i];
          if(i) assert(nxt[i] < i);
     }
     rep(i,1,n){
          adj[nxt[i]].pb(i);
     }
     dfs(0, -1);
     dfsHLD(0, 0);
     fill(seg, seg + (maxn<<2), -1);
     vector<int> srt(n);
     iota(all(srt), 0);
     sort(all(srt), [&](int i, int j){
          return pp(H[i], h[i]) > pp(H[j], h[j]);
     });
     rep(i,0,n){
          // er(i, srt[i]);
          add(srt[i]);
          // er(i);
     }
     // rep(i,0,n) er(i+1, dp[i], getu(i));
     // er(sum, max(getu(0), dp[0]));
     cout << sum - max(getu(0), dp[0]) << '\n';
     return 0;
}

Compilation message

worst_reporter2.cpp: In function 'void add(int)':
worst_reporter2.cpp:109:20: warning: unused variable 'cr' [-Wunused-variable]
  109 |      ll sm = C[u], cr = u;
      |                    ^~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 5 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 4 ms 8236 KB Output is correct
5 Correct 8 ms 8788 KB Output is correct
6 Correct 11 ms 8752 KB Output is correct
7 Correct 9 ms 8788 KB Output is correct
8 Correct 8 ms 8756 KB Output is correct
9 Correct 9 ms 8788 KB Output is correct
10 Correct 9 ms 8788 KB Output is correct
11 Correct 8 ms 8788 KB Output is correct
12 Correct 9 ms 9264 KB Output is correct
13 Correct 9 ms 9172 KB Output is correct
14 Correct 9 ms 9100 KB Output is correct
15 Correct 10 ms 9008 KB Output is correct
16 Correct 9 ms 8728 KB Output is correct
17 Correct 9 ms 8824 KB Output is correct
18 Correct 7 ms 8744 KB Output is correct
19 Correct 9 ms 8880 KB Output is correct
20 Correct 8 ms 8876 KB Output is correct
21 Correct 8 ms 8996 KB Output is correct
22 Correct 7 ms 8740 KB Output is correct
23 Correct 7 ms 8660 KB Output is correct
24 Correct 8 ms 8940 KB Output is correct
25 Correct 8 ms 8916 KB Output is correct
26 Correct 8 ms 9268 KB Output is correct
27 Correct 10 ms 8916 KB Output is correct
28 Correct 8 ms 9044 KB Output is correct
29 Correct 8 ms 9080 KB Output is correct
30 Correct 8 ms 9044 KB Output is correct
31 Correct 10 ms 9044 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 5 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 4 ms 8236 KB Output is correct
5 Correct 8 ms 8788 KB Output is correct
6 Correct 11 ms 8752 KB Output is correct
7 Correct 9 ms 8788 KB Output is correct
8 Correct 8 ms 8756 KB Output is correct
9 Correct 9 ms 8788 KB Output is correct
10 Correct 9 ms 8788 KB Output is correct
11 Correct 8 ms 8788 KB Output is correct
12 Correct 9 ms 9264 KB Output is correct
13 Correct 9 ms 9172 KB Output is correct
14 Correct 9 ms 9100 KB Output is correct
15 Correct 10 ms 9008 KB Output is correct
16 Correct 9 ms 8728 KB Output is correct
17 Correct 9 ms 8824 KB Output is correct
18 Correct 7 ms 8744 KB Output is correct
19 Correct 9 ms 8880 KB Output is correct
20 Correct 8 ms 8876 KB Output is correct
21 Correct 8 ms 8996 KB Output is correct
22 Correct 7 ms 8740 KB Output is correct
23 Correct 7 ms 8660 KB Output is correct
24 Correct 8 ms 8940 KB Output is correct
25 Correct 8 ms 8916 KB Output is correct
26 Correct 8 ms 9268 KB Output is correct
27 Correct 10 ms 8916 KB Output is correct
28 Correct 8 ms 9044 KB Output is correct
29 Correct 8 ms 9080 KB Output is correct
30 Correct 8 ms 9044 KB Output is correct
31 Correct 10 ms 9044 KB Output is correct
32 Correct 8 ms 8788 KB Output is correct
33 Correct 393 ms 31272 KB Output is correct
34 Correct 393 ms 31356 KB Output is correct
35 Correct 397 ms 31180 KB Output is correct
36 Correct 372 ms 31244 KB Output is correct
37 Correct 342 ms 31308 KB Output is correct
38 Correct 319 ms 31116 KB Output is correct
39 Correct 340 ms 50064 KB Output is correct
40 Correct 332 ms 50028 KB Output is correct
41 Correct 200 ms 49960 KB Output is correct
42 Correct 340 ms 42152 KB Output is correct
43 Correct 332 ms 42300 KB Output is correct
44 Correct 397 ms 31160 KB Output is correct
45 Correct 392 ms 31108 KB Output is correct
46 Correct 225 ms 31168 KB Output is correct
47 Correct 280 ms 38156 KB Output is correct
48 Correct 246 ms 38168 KB Output is correct
49 Correct 180 ms 38268 KB Output is correct
50 Correct 150 ms 26676 KB Output is correct
51 Correct 156 ms 26568 KB Output is correct
52 Correct 263 ms 38944 KB Output is correct
53 Correct 242 ms 38824 KB Output is correct
54 Correct 138 ms 50244 KB Output is correct
55 Correct 229 ms 37708 KB Output is correct
56 Correct 229 ms 43168 KB Output is correct
57 Correct 223 ms 45516 KB Output is correct
58 Correct 215 ms 41552 KB Output is correct
59 Correct 223 ms 41464 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 5 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 4 ms 8236 KB Output is correct
5 Correct 8 ms 8788 KB Output is correct
6 Correct 11 ms 8752 KB Output is correct
7 Correct 9 ms 8788 KB Output is correct
8 Correct 8 ms 8756 KB Output is correct
9 Correct 9 ms 8788 KB Output is correct
10 Correct 9 ms 8788 KB Output is correct
11 Correct 8 ms 8788 KB Output is correct
12 Correct 9 ms 9264 KB Output is correct
13 Correct 9 ms 9172 KB Output is correct
14 Correct 9 ms 9100 KB Output is correct
15 Correct 10 ms 9008 KB Output is correct
16 Correct 9 ms 8728 KB Output is correct
17 Correct 9 ms 8824 KB Output is correct
18 Correct 7 ms 8744 KB Output is correct
19 Correct 9 ms 8880 KB Output is correct
20 Correct 8 ms 8876 KB Output is correct
21 Correct 8 ms 8996 KB Output is correct
22 Correct 7 ms 8740 KB Output is correct
23 Correct 7 ms 8660 KB Output is correct
24 Correct 8 ms 8940 KB Output is correct
25 Correct 8 ms 8916 KB Output is correct
26 Correct 8 ms 9268 KB Output is correct
27 Correct 10 ms 8916 KB Output is correct
28 Correct 8 ms 9044 KB Output is correct
29 Correct 8 ms 9080 KB Output is correct
30 Correct 8 ms 9044 KB Output is correct
31 Correct 10 ms 9044 KB Output is correct
32 Correct 8 ms 8788 KB Output is correct
33 Correct 393 ms 31272 KB Output is correct
34 Correct 393 ms 31356 KB Output is correct
35 Correct 397 ms 31180 KB Output is correct
36 Correct 372 ms 31244 KB Output is correct
37 Correct 342 ms 31308 KB Output is correct
38 Correct 319 ms 31116 KB Output is correct
39 Correct 340 ms 50064 KB Output is correct
40 Correct 332 ms 50028 KB Output is correct
41 Correct 200 ms 49960 KB Output is correct
42 Correct 340 ms 42152 KB Output is correct
43 Correct 332 ms 42300 KB Output is correct
44 Correct 397 ms 31160 KB Output is correct
45 Correct 392 ms 31108 KB Output is correct
46 Correct 225 ms 31168 KB Output is correct
47 Correct 280 ms 38156 KB Output is correct
48 Correct 246 ms 38168 KB Output is correct
49 Correct 180 ms 38268 KB Output is correct
50 Correct 150 ms 26676 KB Output is correct
51 Correct 156 ms 26568 KB Output is correct
52 Correct 263 ms 38944 KB Output is correct
53 Correct 242 ms 38824 KB Output is correct
54 Correct 138 ms 50244 KB Output is correct
55 Correct 229 ms 37708 KB Output is correct
56 Correct 229 ms 43168 KB Output is correct
57 Correct 223 ms 45516 KB Output is correct
58 Correct 215 ms 41552 KB Output is correct
59 Correct 223 ms 41464 KB Output is correct
60 Correct 4 ms 8224 KB Output is correct
61 Runtime error 7 ms 10068 KB Execution killed with signal 6
62 Halted 0 ms 0 KB -