oj.uz

Submission #964941

# Submission time Handle Problem Language Result Execution time Memory
964941 2024-04-17T18:15:09 Z Younis_Dwai Race (IOI11_race) C++14
21 / 100
 3000 ms 44116 KB 
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "race.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
using namespace std ;
const int MN=1e6+1;
int res,k;
vector<int> dp(MN),sz(MN);
vector<bool> vis(MN);
vector<pair<int,int>> adj[MN];
void dfs_sz(int node , int par){
     sz[node]=1;
     for(auto u : adj[node]){
         if(vis[u.F] || u.F==par) continue ;
         dfs_sz(u.F,node);
     }
     return ;
}
int  get_centroid(int node ,int par , int d){
     for(auto u : adj[node]){
         if(vis[u.F] || u.F==par || sz[u.F]<=d) continue ;
         return get_centroid(u.F,node,d);
     }
     return node;
}
void dfs_calc(int node, int par , int done ,int dis){
     res=min(res,dp[k-dis]+done);
     for(auto u : adj[node]){
         if(u.F==par || vis[u.F] || dis+u.S>k) continue ;
         dfs_calc(u.F,node,done+1,dis+u.S);
     }
     return ;
}
void dfs_upd(int node , int par , int done , int dis){
     dp[dis]=min(done,dp[dis]);
     for(auto u : adj[node]){
         if(u.F==par || vis[u.F] || dis+u.S>k) continue ;
         dfs_upd(u.F,node,done+1,dis+u.S);
     }
     return ;
}
void dfs_fill(int node , int par ,int dis){
     if(dp[dis]!=1e9) dp[dis]=1e9;
     for(auto u : adj[node]){
         if(u.F==par || vis[u.F] || dis+u.S>k) continue ;
         dfs_fill(u.F,node,dis+u.S);
     }
     return ;
}
void dfs(int node){
     dfs_sz(node,node);
     int centroid=get_centroid(node,node,800);
     vis[centroid]=1;
     dp[0]=0;
     for(auto u : adj[centroid]){
         if(vis[u.F] || u.S>k) continue ;
         dfs_calc(u.F,centroid,1,u.S);
         dfs_upd(u.F,centroid,1,u.S);
     }
     for(auto u : adj[centroid]){
         if(u.S>k || vis[u.F]) continue ;
         dfs_fill(u.F,centroid,u.S);
     }
     for(auto u :  adj[centroid]){
         if(vis[u.F]) continue ;
         dfs(u.F);
     }
     return ;
}
int best_path(int N, int K, int H[][2], int L[]){
    res=1e9;
    k=K;
    for(int i=0;i<=K;i++) dp[i]=1e9;
    for(int i=0;i<N-1;i++){
        adj[H[i][0]].pb({H[i][1],L[i]});
        adj[H[i][1]].pb({H[i][0],L[i]});
    }
    dfs(0);
    if(res==1e9) return -1;
    else return res;
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 35420 KB Output is correct
2 Correct 10 ms 35420 KB Output is correct
3 Correct 10 ms 35420 KB Output is correct
4 Correct 10 ms 35420 KB Output is correct
5 Correct 13 ms 35420 KB Output is correct
6 Correct 10 ms 35420 KB Output is correct
7 Correct 10 ms 35416 KB Output is correct
8 Correct 9 ms 35320 KB Output is correct
9 Correct 10 ms 35416 KB Output is correct
10 Correct 9 ms 35420 KB Output is correct
11 Correct 10 ms 35332 KB Output is correct
12 Correct 13 ms 35416 KB Output is correct
13 Correct 12 ms 35420 KB Output is correct
14 Correct 10 ms 35420 KB Output is correct
15 Correct 12 ms 35420 KB Output is correct
16 Correct 10 ms 35420 KB Output is correct
17 Correct 9 ms 35420 KB Output is correct
18 Correct 12 ms 35532 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 35420 KB Output is correct
2 Correct 10 ms 35420 KB Output is correct
3 Correct 10 ms 35420 KB Output is correct
4 Correct 10 ms 35420 KB Output is correct
5 Correct 13 ms 35420 KB Output is correct
6 Correct 10 ms 35420 KB Output is correct
7 Correct 10 ms 35416 KB Output is correct
8 Correct 9 ms 35320 KB Output is correct
9 Correct 10 ms 35416 KB Output is correct
10 Correct 9 ms 35420 KB Output is correct
11 Correct 10 ms 35332 KB Output is correct
12 Correct 13 ms 35416 KB Output is correct
13 Correct 12 ms 35420 KB Output is correct
14 Correct 10 ms 35420 KB Output is correct
15 Correct 12 ms 35420 KB Output is correct
16 Correct 10 ms 35420 KB Output is correct
17 Correct 9 ms 35420 KB Output is correct
18 Correct 12 ms 35532 KB Output is correct
19 Correct 18 ms 35416 KB Output is correct
20 Correct 10 ms 35420 KB Output is correct
21 Correct 10 ms 35420 KB Output is correct
22 Correct 15 ms 35320 KB Output is correct
23 Correct 10 ms 35324 KB Output is correct
24 Correct 11 ms 35580 KB Output is correct
25 Correct 11 ms 35420 KB Output is correct
26 Correct 12 ms 35568 KB Output is correct
27 Correct 10 ms 35416 KB Output is correct
28 Correct 10 ms 35536 KB Output is correct
29 Correct 10 ms 35576 KB Output is correct
30 Correct 10 ms 35420 KB Output is correct
31 Correct 10 ms 35420 KB Output is correct
32 Correct 10 ms 35420 KB Output is correct
33 Correct 11 ms 35420 KB Output is correct
34 Correct 11 ms 35420 KB Output is correct
35 Correct 12 ms 35420 KB Output is correct
36 Correct 13 ms 35576 KB Output is correct
37 Correct 13 ms 35420 KB Output is correct
38 Correct 13 ms 35420 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 35420 KB Output is correct
2 Correct 10 ms 35420 KB Output is correct
3 Correct 10 ms 35420 KB Output is correct
4 Correct 10 ms 35420 KB Output is correct
5 Correct 13 ms 35420 KB Output is correct
6 Correct 10 ms 35420 KB Output is correct
7 Correct 10 ms 35416 KB Output is correct
8 Correct 9 ms 35320 KB Output is correct
9 Correct 10 ms 35416 KB Output is correct
10 Correct 9 ms 35420 KB Output is correct
11 Correct 10 ms 35332 KB Output is correct
12 Correct 13 ms 35416 KB Output is correct
13 Correct 12 ms 35420 KB Output is correct
14 Correct 10 ms 35420 KB Output is correct
15 Correct 12 ms 35420 KB Output is correct
16 Correct 10 ms 35420 KB Output is correct
17 Correct 9 ms 35420 KB Output is correct
18 Correct 12 ms 35532 KB Output is correct
19 Correct 229 ms 41384 KB Output is correct
20 Correct 218 ms 41296 KB Output is correct
21 Correct 233 ms 41412 KB Output is correct
22 Correct 153 ms 41304 KB Output is correct
23 Correct 88 ms 41640 KB Output is correct
24 Correct 59 ms 41456 KB Output is correct
25 Execution timed out 3040 ms 44116 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 35420 KB Output is correct
2 Correct 10 ms 35420 KB Output is correct
3 Correct 10 ms 35420 KB Output is correct
4 Correct 10 ms 35420 KB Output is correct
5 Correct 13 ms 35420 KB Output is correct
6 Correct 10 ms 35420 KB Output is correct
7 Correct 10 ms 35416 KB Output is correct
8 Correct 9 ms 35320 KB Output is correct
9 Correct 10 ms 35416 KB Output is correct
10 Correct 9 ms 35420 KB Output is correct
11 Correct 10 ms 35332 KB Output is correct
12 Correct 13 ms 35416 KB Output is correct
13 Correct 12 ms 35420 KB Output is correct
14 Correct 10 ms 35420 KB Output is correct
15 Correct 12 ms 35420 KB Output is correct
16 Correct 10 ms 35420 KB Output is correct
17 Correct 9 ms 35420 KB Output is correct
18 Correct 12 ms 35532 KB Output is correct
19 Correct 18 ms 35416 KB Output is correct
20 Correct 10 ms 35420 KB Output is correct
21 Correct 10 ms 35420 KB Output is correct
22 Correct 15 ms 35320 KB Output is correct
23 Correct 10 ms 35324 KB Output is correct
24 Correct 11 ms 35580 KB Output is correct
25 Correct 11 ms 35420 KB Output is correct
26 Correct 12 ms 35568 KB Output is correct
27 Correct 10 ms 35416 KB Output is correct
28 Correct 10 ms 35536 KB Output is correct
29 Correct 10 ms 35576 KB Output is correct
30 Correct 10 ms 35420 KB Output is correct
31 Correct 10 ms 35420 KB Output is correct
32 Correct 10 ms 35420 KB Output is correct
33 Correct 11 ms 35420 KB Output is correct
34 Correct 11 ms 35420 KB Output is correct
35 Correct 12 ms 35420 KB Output is correct
36 Correct 13 ms 35576 KB Output is correct
37 Correct 13 ms 35420 KB Output is correct
38 Correct 13 ms 35420 KB Output is correct
39 Correct 229 ms 41384 KB Output is correct
40 Correct 218 ms 41296 KB Output is correct
41 Correct 233 ms 41412 KB Output is correct
42 Correct 153 ms 41304 KB Output is correct
43 Correct 88 ms 41640 KB Output is correct
44 Correct 59 ms 41456 KB Output is correct
45 Execution timed out 3040 ms 44116 KB Time limit exceeded
46 Halted 0 ms 0 KB -