Submission #1199675

#	Time	Username	Problem	Language	Result	Execution time	Memory
1199675		mareksb	Race (IOI11_race)	C++20	21 / 100	3096 ms	9796 KiB

race

#include "race.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN=200005;
vector<pair<int,int>> mas[MAXN];
int ans=INT_MAX;
int dist[1005][1005];
int n,k;
void dfs(int v, int p,int64_t dist, int cnt){
    if(dist==k){
        ans=min(ans,cnt);
    }
    for(auto u:mas[v]){
        if(u.first==p)continue;
        dfs(u.first,v,dist+u.second,cnt+1);
    }
}
int best_path(int N, int K, int H[][2], int L[])
{
    n=N;
    k=K;
    for(int i=0;i<N-1;i++){
        int x=H[i][0];
        int y=H[i][1];
        mas[x].push_back({y,L[i]});
        mas[y].push_back({x,L[i]});
    }
    for(int i=0;i<N-1;i++){
        dfs(i,i,0,0);
    }
    if(ans==INT_MAX){
        return -1;
    }
    return ans;
}
/*
5 5
0 1 1
1 2 4
2 3 2
3 4 3
2

5 10
0 1 1
1 2 4
2 3 2
3 4 3
4
*/

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