oj.uz

Submission #1064646

# Submission time Handle Problem Language Result Execution time Memory
1064646 2024-08-18T16:19:58 Z Hugo1729 Race (IOI11_race) C++17
9 / 100
 363 ms 42164 KB 
#include <bits/stdc++.h>
#include "race.h"
using namespace std;
typedef long long ll;

vector<pair<int,ll>> adj[200001];
int sz[200001];
bool marked[200001]={0};

int k;

int dfs_sizes(int v, int pV){
    sz[v]=0;
    for(auto [w,d] : adj[v]){
        if(w!=pV&&!marked[w]){
            sz[v]+=dfs_sizes(w,v);
        }
    }
    return sz[v];
}

int dfs_centroid(int v, int pV, int subtree_sz){
    for(auto [w,d] : adj[v]){
        if(pV!=v&&!marked[v]&&sz[v]>=(subtree_sz/2)){
            return dfs_centroid(w,v,subtree_sz);
        }
    }
    return v;
}

void dfs_paths(int v, int pV,int dist,int l, vector<pair<ll,int>> &a){
    for(auto [w,d] : adj[v]){
        if(w!=pV&&!marked[w]){
            if(dist+d<=1000000){
                a.push_back({dist+d,l+1});
                dfs_paths(w,v,dist+d,l+1,a);
            }
        }
    }
}


int centroid_decomposition(int v){
    int c = dfs_centroid(v,v,dfs_sizes(v,v));


    marked[c]=1;
    
    int ans=1000001;
    map<ll,int> m;
    m[0]=0;

    for(auto [w,d] : adj[c]){
        if(!marked[w]){
            vector<pair<ll,int>> a;
            dfs_paths(w,c,d,1,a);

            for(auto [dist,l] : a){
                if(m.count(k-dist)){
                    ans=min(ans,l+m[k-dist]);
                }
            }
            for(auto [dist,l] : a){
                if(m.count(dist))m[dist]=min(m[dist],l);
                else m[dist]=l;
            }



            ans = min(ans,centroid_decomposition(w));
        }
    }

    return ans;
}




int best_path(int N, int K, int H[][2], int L[]){
    for(int i=0;i<N-1;i++){
        adj[H[i][0]].push_back({H[i][1],L[i]});
        adj[H[i][1]].push_back({H[i][0],L[i]});
    }

    k=K;
    int ans = centroid_decomposition(0);

    return (ans==1000001?-1:ans);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10072 KB Output is correct
2 Correct 2 ms 10076 KB Output is correct
3 Correct 2 ms 10072 KB Output is correct
4 Correct 2 ms 9816 KB Output is correct
5 Correct 3 ms 9560 KB Output is correct
6 Correct 2 ms 10072 KB Output is correct
7 Correct 2 ms 10072 KB Output is correct
8 Correct 2 ms 10076 KB Output is correct
9 Correct 2 ms 10076 KB Output is correct
10 Correct 2 ms 10136 KB Output is correct
11 Correct 2 ms 10076 KB Output is correct
12 Correct 2 ms 10076 KB Output is correct
13 Correct 2 ms 10076 KB Output is correct
14 Correct 2 ms 10076 KB Output is correct
15 Correct 2 ms 10072 KB Output is correct
16 Correct 2 ms 10076 KB Output is correct
17 Correct 2 ms 10076 KB Output is correct
18 Correct 2 ms 10076 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10072 KB Output is correct
2 Correct 2 ms 10076 KB Output is correct
3 Correct 2 ms 10072 KB Output is correct
4 Correct 2 ms 9816 KB Output is correct
5 Correct 3 ms 9560 KB Output is correct
6 Correct 2 ms 10072 KB Output is correct
7 Correct 2 ms 10072 KB Output is correct
8 Correct 2 ms 10076 KB Output is correct
9 Correct 2 ms 10076 KB Output is correct
10 Correct 2 ms 10136 KB Output is correct
11 Correct 2 ms 10076 KB Output is correct
12 Correct 2 ms 10076 KB Output is correct
13 Correct 2 ms 10076 KB Output is correct
14 Correct 2 ms 10076 KB Output is correct
15 Correct 2 ms 10072 KB Output is correct
16 Correct 2 ms 10076 KB Output is correct
17 Correct 2 ms 10076 KB Output is correct
18 Correct 2 ms 10076 KB Output is correct
19 Incorrect 2 ms 9560 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10072 KB Output is correct
2 Correct 2 ms 10076 KB Output is correct
3 Correct 2 ms 10072 KB Output is correct
4 Correct 2 ms 9816 KB Output is correct
5 Correct 3 ms 9560 KB Output is correct
6 Correct 2 ms 10072 KB Output is correct
7 Correct 2 ms 10072 KB Output is correct
8 Correct 2 ms 10076 KB Output is correct
9 Correct 2 ms 10076 KB Output is correct
10 Correct 2 ms 10136 KB Output is correct
11 Correct 2 ms 10076 KB Output is correct
12 Correct 2 ms 10076 KB Output is correct
13 Correct 2 ms 10076 KB Output is correct
14 Correct 2 ms 10076 KB Output is correct
15 Correct 2 ms 10072 KB Output is correct
16 Correct 2 ms 10076 KB Output is correct
17 Correct 2 ms 10076 KB Output is correct
18 Correct 2 ms 10076 KB Output is correct
19 Correct 350 ms 30624 KB Output is correct
20 Correct 363 ms 32076 KB Output is correct
21 Correct 266 ms 27612 KB Output is correct
22 Correct 219 ms 31420 KB Output is correct
23 Incorrect 347 ms 42164 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10072 KB Output is correct
2 Correct 2 ms 10076 KB Output is correct
3 Correct 2 ms 10072 KB Output is correct
4 Correct 2 ms 9816 KB Output is correct
5 Correct 3 ms 9560 KB Output is correct
6 Correct 2 ms 10072 KB Output is correct
7 Correct 2 ms 10072 KB Output is correct
8 Correct 2 ms 10076 KB Output is correct
9 Correct 2 ms 10076 KB Output is correct
10 Correct 2 ms 10136 KB Output is correct
11 Correct 2 ms 10076 KB Output is correct
12 Correct 2 ms 10076 KB Output is correct
13 Correct 2 ms 10076 KB Output is correct
14 Correct 2 ms 10076 KB Output is correct
15 Correct 2 ms 10072 KB Output is correct
16 Correct 2 ms 10076 KB Output is correct
17 Correct 2 ms 10076 KB Output is correct
18 Correct 2 ms 10076 KB Output is correct
19 Incorrect 2 ms 9560 KB Output isn't correct
20 Halted 0 ms 0 KB -