oj.uz

Submission #972716

# Submission time Handle Problem Language Result Execution time Memory
972716 2024-05-01T04:25:48 Z huutuan Worst Reporter 4 (JOI21_worst_reporter4) C++14
100 / 100
 351 ms 123716 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long

const int N=2e5+10;
map<int, int> mp[N];
int n, a[N], h[N], c[N], sz[N];
vector<int> g[N];
int vis[N];

void dfs_sz(int u){
   vis[u]=1;
   sz[u]=1;
   for (int &v:g[u]){
      dfs_sz(v);
      sz[u]+=sz[v];
      if (sz[v]>sz[g[u][0]]) swap(v, g[u][0]);
   }
}

void dfs_merge(int u){
   if (g[u].empty()){
      mp[u][1]=c[u];
      mp[u][h[u]+1]=-c[u];
      return;
   }
   for (int &v:g[u]){
      dfs_merge(v);
      if (v==g[u][0]) mp[u].swap(mp[v]);
      else{
         for (auto &i:mp[v]){
            mp[u][i.first]+=i.second;
         }
      }
   }
   mp[u][h[u]+1]-=c[u];
   auto it=mp[u].find(h[u]+1);
   int cur=c[u];
   while (it!=mp[u].begin()){
      --it;
      if (it->second<0 && cur>=-it->second){
         cur-=-it->second;
         it=mp[u].erase(it);
      }else{
         it->second+=cur;
         cur=0;
         break;
      }
   }
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n;
   vector<int> vals{-1};
   for (int i=1; i<=n; ++i){
      cin >> a[i] >> h[i] >> c[i];
      vals.push_back(h[i]);
      if (a[i]!=i) g[a[i]].push_back(i);
   }
   sort(vals.begin(), vals.end());
   vals.resize(unique(vals.begin(), vals.end())-vals.begin());
   for (int i=1; i<=n; ++i) h[i]=lower_bound(vals.begin(), vals.end(), h[i])-vals.begin();
   int ans=0;
   for (int i=1; i<=n; ++i) if (!vis[i]){
      int u=i;
      vector<int> tmp;
      while (!vis[u]){
         tmp.push_back(u);
         vis[u]=1;
         u=a[u];
      }
      vector<int> cycle(find(tmp.begin(), tmp.end(), u), tmp.end());
      for (int j:cycle) vis[j]=2;
      vector<int> child;
      for (int j:cycle) for (int k:g[j]) if (vis[k]!=2) child.push_back(k);
      for (int &v:child){
         dfs_sz(v);
         if (sz[v]>sz[child[0]]) swap(v, child[0]);
      }
      map<int, int> mpp;
      for (int &v:child){
         dfs_merge(v);
         if (v==child[0]){
            mpp.swap(mp[v]);
         }else{
            for (auto &j:mp[v]) mpp[j.first]+=j.second;
         }
      }
      int cur=mpp.empty()?0:mpp.begin()->second;
      map<int, int> cc;
      for (int v:cycle) cc[h[v]]+=c[v];
      vector<pair<int, int>> vv;
      vv.emplace_back(0, 0);
      for (auto &j:mpp) vv.emplace_back(j.first, vv.back().second+j.second);
      for (auto &j:cc){
         auto it=lower_bound(vv.begin(), vv.end(), make_pair(j.first+1, (int)-1e18))-1;
         cur=max(cur, it->second+j.second);
      }
      ans+=cur;
   }
   cout << accumulate(c+1, c+n+1, 0ll)-ans << '\n';
   return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 22108 KB Output is correct
2 Correct 6 ms 22208 KB Output is correct
3 Correct 5 ms 22108 KB Output is correct
4 Correct 5 ms 22108 KB Output is correct
5 Correct 10 ms 23720 KB Output is correct
6 Correct 8 ms 22944 KB Output is correct
7 Correct 9 ms 22876 KB Output is correct
8 Correct 11 ms 23644 KB Output is correct
9 Correct 8 ms 23132 KB Output is correct
10 Correct 8 ms 23132 KB Output is correct
11 Correct 7 ms 22820 KB Output is correct
12 Correct 8 ms 23132 KB Output is correct
13 Correct 7 ms 23132 KB Output is correct
14 Correct 8 ms 22888 KB Output is correct
15 Correct 8 ms 22876 KB Output is correct
16 Correct 11 ms 24156 KB Output is correct
17 Correct 9 ms 23232 KB Output is correct
18 Correct 6 ms 22616 KB Output is correct
19 Correct 8 ms 23384 KB Output is correct
20 Correct 9 ms 22876 KB Output is correct
21 Correct 9 ms 23148 KB Output is correct
22 Correct 8 ms 23388 KB Output is correct
23 Correct 10 ms 22876 KB Output is correct
24 Correct 9 ms 23444 KB Output is correct
25 Correct 11 ms 23220 KB Output is correct
26 Correct 8 ms 23132 KB Output is correct
27 Correct 11 ms 23388 KB Output is correct
28 Correct 8 ms 23388 KB Output is correct
29 Correct 8 ms 23388 KB Output is correct
30 Correct 9 ms 23388 KB Output is correct
31 Correct 10 ms 23388 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 22108 KB Output is correct
2 Correct 6 ms 22208 KB Output is correct
3 Correct 5 ms 22108 KB Output is correct
4 Correct 5 ms 22108 KB Output is correct
5 Correct 10 ms 23720 KB Output is correct
6 Correct 8 ms 22944 KB Output is correct
7 Correct 9 ms 22876 KB Output is correct
8 Correct 11 ms 23644 KB Output is correct
9 Correct 8 ms 23132 KB Output is correct
10 Correct 8 ms 23132 KB Output is correct
11 Correct 7 ms 22820 KB Output is correct
12 Correct 8 ms 23132 KB Output is correct
13 Correct 7 ms 23132 KB Output is correct
14 Correct 8 ms 22888 KB Output is correct
15 Correct 8 ms 22876 KB Output is correct
16 Correct 11 ms 24156 KB Output is correct
17 Correct 9 ms 23232 KB Output is correct
18 Correct 6 ms 22616 KB Output is correct
19 Correct 8 ms 23384 KB Output is correct
20 Correct 9 ms 22876 KB Output is correct
21 Correct 9 ms 23148 KB Output is correct
22 Correct 8 ms 23388 KB Output is correct
23 Correct 10 ms 22876 KB Output is correct
24 Correct 9 ms 23444 KB Output is correct
25 Correct 11 ms 23220 KB Output is correct
26 Correct 8 ms 23132 KB Output is correct
27 Correct 11 ms 23388 KB Output is correct
28 Correct 8 ms 23388 KB Output is correct
29 Correct 8 ms 23388 KB Output is correct
30 Correct 9 ms 23388 KB Output is correct
31 Correct 10 ms 23388 KB Output is correct
32 Correct 11 ms 23644 KB Output is correct
33 Correct 351 ms 96120 KB Output is correct
34 Correct 242 ms 67004 KB Output is correct
35 Correct 339 ms 94192 KB Output is correct
36 Correct 251 ms 67004 KB Output is correct
37 Correct 165 ms 48616 KB Output is correct
38 Correct 136 ms 43876 KB Output is correct
39 Correct 153 ms 59584 KB Output is correct
40 Correct 128 ms 59452 KB Output is correct
41 Correct 89 ms 59580 KB Output is correct
42 Correct 144 ms 47296 KB Output is correct
43 Correct 125 ms 46784 KB Output is correct
44 Correct 327 ms 123716 KB Output is correct
45 Correct 217 ms 83296 KB Output is correct
46 Correct 80 ms 43452 KB Output is correct
47 Correct 210 ms 66240 KB Output is correct
48 Correct 116 ms 56100 KB Output is correct
49 Correct 90 ms 55992 KB Output is correct
50 Correct 262 ms 73644 KB Output is correct
51 Correct 111 ms 55792 KB Output is correct
52 Correct 240 ms 67364 KB Output is correct
53 Correct 119 ms 57280 KB Output is correct
54 Correct 99 ms 59580 KB Output is correct
55 Correct 193 ms 71228 KB Output is correct
56 Correct 167 ms 71616 KB Output is correct
57 Correct 155 ms 73052 KB Output is correct
58 Correct 164 ms 69440 KB Output is correct
59 Correct 168 ms 68672 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 22108 KB Output is correct
2 Correct 6 ms 22208 KB Output is correct
3 Correct 5 ms 22108 KB Output is correct
4 Correct 5 ms 22108 KB Output is correct
5 Correct 10 ms 23720 KB Output is correct
6 Correct 8 ms 22944 KB Output is correct
7 Correct 9 ms 22876 KB Output is correct
8 Correct 11 ms 23644 KB Output is correct
9 Correct 8 ms 23132 KB Output is correct
10 Correct 8 ms 23132 KB Output is correct
11 Correct 7 ms 22820 KB Output is correct
12 Correct 8 ms 23132 KB Output is correct
13 Correct 7 ms 23132 KB Output is correct
14 Correct 8 ms 22888 KB Output is correct
15 Correct 8 ms 22876 KB Output is correct
16 Correct 11 ms 24156 KB Output is correct
17 Correct 9 ms 23232 KB Output is correct
18 Correct 6 ms 22616 KB Output is correct
19 Correct 8 ms 23384 KB Output is correct
20 Correct 9 ms 22876 KB Output is correct
21 Correct 9 ms 23148 KB Output is correct
22 Correct 8 ms 23388 KB Output is correct
23 Correct 10 ms 22876 KB Output is correct
24 Correct 9 ms 23444 KB Output is correct
25 Correct 11 ms 23220 KB Output is correct
26 Correct 8 ms 23132 KB Output is correct
27 Correct 11 ms 23388 KB Output is correct
28 Correct 8 ms 23388 KB Output is correct
29 Correct 8 ms 23388 KB Output is correct
30 Correct 9 ms 23388 KB Output is correct
31 Correct 10 ms 23388 KB Output is correct
32 Correct 11 ms 23644 KB Output is correct
33 Correct 351 ms 96120 KB Output is correct
34 Correct 242 ms 67004 KB Output is correct
35 Correct 339 ms 94192 KB Output is correct
36 Correct 251 ms 67004 KB Output is correct
37 Correct 165 ms 48616 KB Output is correct
38 Correct 136 ms 43876 KB Output is correct
39 Correct 153 ms 59584 KB Output is correct
40 Correct 128 ms 59452 KB Output is correct
41 Correct 89 ms 59580 KB Output is correct
42 Correct 144 ms 47296 KB Output is correct
43 Correct 125 ms 46784 KB Output is correct
44 Correct 327 ms 123716 KB Output is correct
45 Correct 217 ms 83296 KB Output is correct
46 Correct 80 ms 43452 KB Output is correct
47 Correct 210 ms 66240 KB Output is correct
48 Correct 116 ms 56100 KB Output is correct
49 Correct 90 ms 55992 KB Output is correct
50 Correct 262 ms 73644 KB Output is correct
51 Correct 111 ms 55792 KB Output is correct
52 Correct 240 ms 67364 KB Output is correct
53 Correct 119 ms 57280 KB Output is correct
54 Correct 99 ms 59580 KB Output is correct
55 Correct 193 ms 71228 KB Output is correct
56 Correct 167 ms 71616 KB Output is correct
57 Correct 155 ms 73052 KB Output is correct
58 Correct 164 ms 69440 KB Output is correct
59 Correct 168 ms 68672 KB Output is correct
60 Correct 4 ms 22108 KB Output is correct
61 Correct 5 ms 22104 KB Output is correct
62 Correct 4 ms 22108 KB Output is correct
63 Correct 7 ms 22108 KB Output is correct
64 Correct 302 ms 78460 KB Output is correct
65 Correct 246 ms 58808 KB Output is correct
66 Correct 288 ms 72740 KB Output is correct
67 Correct 223 ms 59008 KB Output is correct
68 Correct 158 ms 45796 KB Output is correct
69 Correct 144 ms 42436 KB Output is correct
70 Correct 180 ms 46016 KB Output is correct
71 Correct 115 ms 37144 KB Output is correct
72 Correct 188 ms 50740 KB Output is correct
73 Correct 114 ms 38364 KB Output is correct
74 Correct 275 ms 62596 KB Output is correct
75 Correct 151 ms 47040 KB Output is correct
76 Correct 123 ms 46856 KB Output is correct
77 Correct 225 ms 63496 KB Output is correct
78 Correct 125 ms 47904 KB Output is correct
79 Correct 258 ms 73152 KB Output is correct
80 Correct 175 ms 53436 KB Output is correct
81 Correct 127 ms 43968 KB Output is correct
82 Correct 164 ms 50996 KB Output is correct
83 Correct 102 ms 29032 KB Output is correct
84 Correct 260 ms 62912 KB Output is correct
85 Correct 245 ms 62744 KB Output is correct
86 Correct 230 ms 59752 KB Output is correct
87 Correct 256 ms 62920 KB Output is correct
88 Correct 244 ms 63036 KB Output is correct