oj.uz

Submission #970841

# Submission time Handle Problem Language Result Execution time Memory
970841 2024-04-27T11:14:42 Z AlperenT_ Road Closures (APIO21_roads) C++17
31 / 100
 2000 ms 53708 KB 
#include "roads.h"
#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define ld long double
#define aint(a) a.begin(),a.end()
#define pii pair <int,int>
#define PII pair<pii , pii>
#define ll long long 
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= (b);i++)
#define per(i , a , b) for(int i=a;i >= (b);i--)
#define deb(x) cout <<#x << " : " << x << "\n" ;
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll maxn = 1e6 , maxq = 32, inf = 1e15+10 , lg = 19  ,sq = 707 ,mod = 998244353 ;
vector <pii> G[maxn] ;
ll dp[maxn][2]  , k;

void dfs(int v , int W = 0 , int p = -1){
  dp[v][0] = dp[v][1] = 0;
  int x = max(0ll,sz(G[v])-k) ;
  priority_queue <ll> pq ;
  for(auto [u,w] : G[v]){
    if(u == p)continue ;
    dfs(u , w , v) ;
    if(dp[u][0] <= dp[u][1]){
      dp[v][0] += dp[u][0] ;
      x=max(x-1 , 0) ;
    }else{
      dp[v][0] += dp[u][1] ;
      pq.push((-dp[u][1] + dp[u][0]));
      while(sz(pq) > x)pq.pop();
    }
  }
  dp[v][1] = dp[v][0] ;
  dp[v][0] += W ; 
  if(x==0)return ;
  while(sz(pq) > x)pq.pop();
  if(sz(pq) < x){
    while(sz(pq)){
      dp[v][0] += pq.top() ; pq.pop() ;
    }
    dp[v][1] = inf ;
  }else{
    bool ok =0 ;
    while(sz(pq)){
      ll z = pq.top() ;pq.pop() ;
      if(ok)dp[v][0] += z ;
      ok = 1; 
      dp[v][1] += z; 
    }
  }
}

  vector<ll> ans ;

void sl(int l , int r , ll a =-1 , ll b= -1){
  if(a==-1){
    k = l ;dfs(0);
    a =dp[0][1];
  }
  if(b==-1){
    k = r ;dfs(0);
    b =dp[0][1];
  }
  if(a==b){
    rep(i , l , r)ans.pb(a);
  }else{
    int mid = (l+r)/2 ;
    sl(l , mid , a , -1);
    sl(mid+1,r,-1,b); 
  }
}

vector<ll> minimum_closure_costs(int n, vector<int> U,vector<int> V,vector<int> W) {
  rep(i ,0 , n-2){
    G[V[i]].pb({U[i] , W[i]}) ;
    G[U[i]].pb({V[i] , W[i]}) ;
  }
  sl(0 ,n-1);
  return ans ;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24924 KB Output is correct
2 Correct 455 ms 25244 KB Output is correct
3 Correct 529 ms 25256 KB Output is correct
4 Correct 171 ms 25264 KB Output is correct
5 Correct 7 ms 24920 KB Output is correct
6 Correct 9 ms 24924 KB Output is correct
7 Correct 7 ms 24924 KB Output is correct
8 Correct 300 ms 25468 KB Output is correct
9 Correct 468 ms 25248 KB Output is correct
10 Correct 8 ms 24924 KB Output is correct
11 Correct 8 ms 24920 KB Output is correct
12 Execution timed out 2037 ms 32824 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24920 KB Output is correct
2 Correct 212 ms 49060 KB Output is correct
3 Correct 237 ms 51884 KB Output is correct
4 Correct 278 ms 53708 KB Output is correct
5 Correct 239 ms 53708 KB Output is correct
6 Correct 8 ms 25436 KB Output is correct
7 Correct 8 ms 25436 KB Output is correct
8 Correct 7 ms 25688 KB Output is correct
9 Correct 5 ms 24924 KB Output is correct
10 Correct 7 ms 24924 KB Output is correct
11 Correct 6 ms 25104 KB Output is correct
12 Correct 111 ms 42704 KB Output is correct
13 Correct 260 ms 53200 KB Output is correct
14 Correct 6 ms 24924 KB Output is correct
15 Correct 216 ms 50372 KB Output is correct
16 Correct 246 ms 53012 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24924 KB Output is correct
2 Correct 5 ms 24924 KB Output is correct
3 Correct 6 ms 25040 KB Output is correct
4 Correct 6 ms 25252 KB Output is correct
5 Correct 6 ms 24924 KB Output is correct
6 Correct 6 ms 24924 KB Output is correct
7 Correct 6 ms 24924 KB Output is correct
8 Correct 6 ms 24924 KB Output is correct
9 Correct 7 ms 24924 KB Output is correct
10 Correct 6 ms 25104 KB Output is correct
11 Correct 6 ms 24920 KB Output is correct
12 Correct 7 ms 24924 KB Output is correct
13 Correct 9 ms 24924 KB Output is correct
14 Correct 10 ms 24924 KB Output is correct
15 Correct 7 ms 25004 KB Output is correct
16 Correct 5 ms 24920 KB Output is correct
17 Correct 6 ms 24924 KB Output is correct
18 Correct 6 ms 24924 KB Output is correct
19 Correct 10 ms 24924 KB Output is correct
20 Correct 9 ms 24924 KB Output is correct
21 Correct 5 ms 24924 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24924 KB Output is correct
2 Correct 5 ms 24924 KB Output is correct
3 Correct 6 ms 25040 KB Output is correct
4 Correct 6 ms 25252 KB Output is correct
5 Correct 6 ms 24924 KB Output is correct
6 Correct 6 ms 24924 KB Output is correct
7 Correct 6 ms 24924 KB Output is correct
8 Correct 6 ms 24924 KB Output is correct
9 Correct 7 ms 24924 KB Output is correct
10 Correct 6 ms 25104 KB Output is correct
11 Correct 6 ms 24920 KB Output is correct
12 Correct 7 ms 24924 KB Output is correct
13 Correct 9 ms 24924 KB Output is correct
14 Correct 10 ms 24924 KB Output is correct
15 Correct 7 ms 25004 KB Output is correct
16 Correct 5 ms 24920 KB Output is correct
17 Correct 6 ms 24924 KB Output is correct
18 Correct 6 ms 24924 KB Output is correct
19 Correct 10 ms 24924 KB Output is correct
20 Correct 9 ms 24924 KB Output is correct
21 Correct 5 ms 24924 KB Output is correct
22 Correct 6 ms 24924 KB Output is correct
23 Correct 7 ms 25208 KB Output is correct
24 Correct 9 ms 25180 KB Output is correct
25 Correct 8 ms 25180 KB Output is correct
26 Correct 18 ms 25500 KB Output is correct
27 Correct 71 ms 25256 KB Output is correct
28 Correct 32 ms 25176 KB Output is correct
29 Correct 8 ms 25180 KB Output is correct
30 Correct 15 ms 25260 KB Output is correct
31 Correct 15 ms 25376 KB Output is correct
32 Correct 74 ms 25240 KB Output is correct
33 Correct 8 ms 25432 KB Output is correct
34 Correct 8 ms 25436 KB Output is correct
35 Correct 8 ms 25436 KB Output is correct
36 Correct 485 ms 25248 KB Output is correct
37 Correct 528 ms 25256 KB Output is correct
38 Correct 169 ms 25260 KB Output is correct
39 Correct 5 ms 24924 KB Output is correct
40 Correct 5 ms 24924 KB Output is correct
41 Correct 6 ms 24924 KB Output is correct
42 Correct 7 ms 24924 KB Output is correct
43 Correct 6 ms 24924 KB Output is correct
44 Correct 6 ms 24920 KB Output is correct
45 Correct 7 ms 25020 KB Output is correct
46 Correct 7 ms 24924 KB Output is correct
47 Correct 6 ms 25100 KB Output is correct
48 Correct 6 ms 24924 KB Output is correct
49 Correct 6 ms 24924 KB Output is correct
50 Correct 7 ms 24924 KB Output is correct
51 Correct 11 ms 25012 KB Output is correct
52 Correct 7 ms 24924 KB Output is correct
53 Correct 9 ms 25040 KB Output is correct
54 Correct 11 ms 25176 KB Output is correct
55 Correct 64 ms 25432 KB Output is correct
56 Correct 308 ms 25216 KB Output is correct
57 Correct 477 ms 25432 KB Output is correct
58 Correct 6 ms 24920 KB Output is correct
59 Correct 6 ms 24924 KB Output is correct
60 Correct 6 ms 24924 KB Output is correct
61 Correct 8 ms 25020 KB Output is correct
62 Correct 9 ms 24924 KB Output is correct
63 Correct 6 ms 24920 KB Output is correct
64 Correct 9 ms 25176 KB Output is correct
65 Correct 9 ms 25176 KB Output is correct
66 Correct 11 ms 25180 KB Output is correct
67 Correct 76 ms 25176 KB Output is correct
68 Correct 11 ms 25176 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 372 ms 34604 KB Output is correct
2 Correct 325 ms 36120 KB Output is correct
3 Execution timed out 2058 ms 35380 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 372 ms 34604 KB Output is correct
2 Correct 325 ms 36120 KB Output is correct
3 Execution timed out 2058 ms 35380 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24924 KB Output is correct
2 Correct 455 ms 25244 KB Output is correct
3 Correct 529 ms 25256 KB Output is correct
4 Correct 171 ms 25264 KB Output is correct
5 Correct 7 ms 24920 KB Output is correct
6 Correct 9 ms 24924 KB Output is correct
7 Correct 7 ms 24924 KB Output is correct
8 Correct 300 ms 25468 KB Output is correct
9 Correct 468 ms 25248 KB Output is correct
10 Correct 8 ms 24924 KB Output is correct
11 Correct 8 ms 24920 KB Output is correct
12 Execution timed out 2037 ms 32824 KB Time limit exceeded
13 Halted 0 ms 0 KB -