Submission #60656

#	Time	Username	Problem	Language	Result	Execution time	Memory
60656		theknife2001	경주 (Race) (IOI11_race)	C++17	21 / 100	3030 ms	12108 KiB

race

#include "race.h"
#include <bits/stdc++.h>

using namespace std;
const int N=2e5+55;
vector < pair < int , int > > vec[N];

int b;

void df(int u , int p , int cnt , int c , int k)
{
    if(cnt==k)
    {
        b=min(b,c);
        return ;
    }
    if(cnt>k)
        return ;
    int v,x;
    for(auto a:vec[u])
    {
        v=a.first;
        x=a.second;
        if(v==p)
            continue ;
        df(v,u,cnt+x,c+1,k);
    }
}

int best_path(int n, int K, int H[][2], int L[])
{
    for(int i=0;i<n-1;i++)
    {
        vec[H[i][0]].push_back({H[i][1],L[i]});
        vec[H[i][1]].push_back({H[i][0],L[i]});
    }
    b=1e9+55;
    for(int i=0;i<n;i++)
    {
        df(i,-1,0,0,K);
    }
    if(b==1e9+55)
        return -1;
    return b;
}

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