Submission #940142

#	Time	Username	Problem	Language	Result	Execution time	Memory
940142		ezzzay	Race (IOI11_race)	C++14	21 / 100	25 ms	9372 KiB

race

#include "race.h"
#include<bits/stdc++.h>
using namespace std;
const int M=2e3+5;
int ans=INT_MAX;
vector<pair<int,int>>v[M];
#define pb push_back
#define ff first
#define ss second
bool vis[M];
int Z;
void dfs(int a,int w, int x){
	if(w==Z){
		ans=min(ans,x);
	}
	vis[a]=1;
	for(auto p:v[a]){
		int b=p.ff;
		int c=p.ss;
		if(vis[b]==0){
			dfs(b,w+c,x+1);
		}
	}
}
int best_path(int N, int K, int H[][2], int L[]){
	Z=K;
  for(int i=0;i<N-1;i++)cin>>H[i][0]>>H[i][1];
	for(int i=0;i<N-1;i++)cin>>L[i];
	for(int i=0;i<N-1;i++){
		int a=H[i][0];
		int b=H[i][1];
		int c=L[i];
		v[a].pb({b,c});
		v[b].pb({a,c});
	}
	for(int i=0;i<N;i++){
		memset(vis,0,sizeof vis);
		dfs(i,0,0);
	
	}
	if(ans==INT_MAX)return -1;
	return ans;
}

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