제출 #648288

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
648288		smirichto	경주 (Race) (IOI11_race)	C++17	43 / 100	3071 ms	146852 KiB

race

/*
    STAY ORGANIZED
    CHANGE YOUR APPROACH
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef long double ld ;
#define FAST ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define pb push_back
#define pi pair<int,int>
#define pll pair<ll,ll>
#define yes cout<<"Yes"<<endl;
#define no cout<<"No"<<endl;
#define flag cout<<"hi"<<endl;
#define fr(i,a,b) for(ll i = a;i < (ll)b;i++)
#define rfr(i,a,b) for(ll i = a;i > (ll)b;i--)
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define alll(x) ((x).begin()+1), (x).end()
#define MOD mod
#define endl '\n'
const ll mod = 1e9+7 ;
//void io(){ios::sync_with_stdio(false) ;cin.tie(NULL) ;freopen("grader.in.4","r",stdin) ;freopen("grader.out.4","w",stdout) ;
//}
void dbg(vector<ll> tab){for(auto it : tab) cout<<it<<" ";cout<<endl;}
void dbgg(pi p){cout<<p.F<<" "<<p.S<<endl;}
void dbgpi(vector<pi> tab){for(auto it : tab) dbgg(it) ;}
template<class T> bool ckmax(T& a, const T& b){return a < b ? a = b, 1 : 0;}
template<class T> bool ckmin(T& a, const T& b){return a > b ? a = b, 1 : 0;}
template<class T> void add(T& a, const T& b){a = a + b ; if(a>mod) a-= mod ;}
void nop(){cout<<-1<<endl;return;}
#define forr(i, x, y)   for(ll i = x; i <= y; i++)
const ll inf = 1e9 +1;
const int N = 2e5+5 , MAXN = 1e5+5  , NAX = 1001 ;

int n , k ;
vector<pi> v[N] ;
int len[N] , sz[N] , vis[N] ;

void get_sz(int node , int oj)
{
    sz[node] = 1 ;
    for(auto [it,i] : v[node]){
        if(it==oj || vis[it]) continue ;
        get_sz(it,node) ;
        sz[node] += sz[it] ;
    }
}

int get_centro(int node , int oj , int m)
{
    for(auto [it,i] : v[node]){
        if(!vis[it] && it!=oj && sz[it]>m/2) return get_centro(it,node,m) ;
    }
    return node ;
}
map<int,int> mp[N] ;
int ans = 1e9 ;

void get_cnt(int node , int oj , int ok , int curr_len, int d ,int currcent)
{

    if(curr_len>k) return ;
    if(ok){
        if(mp[currcent].find(k-curr_len)!=mp[currcent].end()){
            ckmin(ans, d+mp[currcent][k-curr_len]) ;
        }
    }
    else{
        if(mp[currcent].find(curr_len)!=mp[currcent].end()) ckmin(mp[currcent][curr_len] , d) ;
        else{
            mp[currcent][curr_len] = d;
        }
    }
    for(auto [it,i] : v[node]){
        if(vis[it] || it==oj) continue ;
        if(curr_len+len[i]<=k) get_cnt(it,node,ok,curr_len+len[i],d+1,currcent) ;
    }
}

void build(ll node = 0)
{
    get_sz(node , node) ;
    int centroid = get_centro(node , node , sz[node]) ;


    vis[centroid] = 1 ;
    mp[centroid][0] = 0 ;
    for(auto [it,i] : v[centroid]){
        get_cnt(it,centroid,1 , len[i],1,centroid) ;
        get_cnt(it,centroid,0 , len[i],1,centroid) ;
    }


    for(auto [it,i] : v[centroid]){
        if(!vis[it]) build(it) ;
    }
}



int best_path(int nn, int kk, int edges[][2], int weights[])
{
    if(kk==1) return 0 ;
    n = nn ; k = kk ;
    for (ll i = 1; i < n ; i++)
	{
		ll x = edges[i-1][0];
		ll y = edges[i-1][1];
		v[x].pb(pi(y, i));
		v[y].pb(pi(x, i));
		len[i] = weights[i-1] ;
	}
    ans = 1e9 ;
    build() ;
    return ans >=1e9 ? -1:ans ;
}

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 22 / 22
• Subtask 4: 0 / 57