oj.uz

답안 #1065853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065853 2024-08-19T12:21:02 Z Hugo1729 경주 (Race) (IOI11_race) C++17
0 / 100
 2 ms 5980 KB 
#include <bits/stdc++.h>
#include "race.h"

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,bmi,bmi2,fma,sse,sse2,sse4")


using namespace std;
typedef long long ll;


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

ll m[1000001];
 
ll k;
 
ll dfs_sizes(ll v, ll pV){
    sz[v]=1;
    for(auto [w,d] : adj[v]){
        if(w!=pV&&!marked[w]){
            sz[v]+=dfs_sizes(w,v);
        }
    }
    return sz[v];
}
 
ll dfs_centroid(ll v, ll pV, ll subtree_sz){
    for(auto [w,d] : adj[v]){
        if(pV!=w&&!marked[w]&&sz[w]>=(subtree_sz/2)){
            return dfs_centroid(w,v,subtree_sz);
        }
    }
    return v;
}
 
void dfs_paths(ll v, ll pV,ll dist,ll l, vector<pair<ll,ll>> &a){
    for(auto [w,d] : adj[v]){
        if(w!=pV&&!marked[w]){
            if(dist+d<=k){
                a.push_back({dist+d,l+1});
                dfs_paths(w,v,dist+d,l+1,a);
            }
        }
    }
}
 
 
ll centroid_decomposition(ll v){
    ll c = dfs_centroid(v,v,dfs_sizes(v,v));
 
 
    marked[c]=1;
    
    ll ans=1000001;

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

            dfs_paths(w,c,d,1,a);
 
            for(auto [dist,l] : a){
                if(m[k-dist]!=1000001){
                    ans=min(ans,l+m[k-dist]);
                }
            }
            for(auto [dist,l] : a){
                if(m[dist]!=1000001)m[dist]=min(m[dist],l);
                else{
                    m[dist]=l;
                    sus.push_back(dist);
                }
            }
        }
    }

    for(ll i : sus)m[i]=1000001;

    for(auto [w,d] : adj[c]){
        if(!marked[w]){
            ans = min(ans,centroid_decomposition(w));
        }
    }
 
    return ans;
}
 
 
 
 
int best_path(int N, int K, int H[][2], int L[]){
    for(ll 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;

    for(ll i=0;i<=k;i++)m[i]=1000001;
    m[0]=0;

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

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Incorrect 2 ms 4956 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Incorrect 2 ms 4956 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Incorrect 2 ms 4956 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Incorrect 2 ms 4956 KB Output isn't correct
9 Halted 0 ms 0 KB -