| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 306926 | amunduzbaev | Race (IOI11_race) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "race.h"
#include <bits/stdc++.h>
#include "grader.cpp"
using namespace std;
vector< pair<int,int> > v[1005];
int used[1005],now;
int ans[1005][1005];
int len[1005][1005];
void fun(int vi,int cnt,int num){
used[vi]=1;
ans[now][vi]=cnt;
len[now][vi]=num;
num++;
for(int i=0;i<v[vi].size();i++){
if(used[i]) continue;
fun(v[vi][i].first,v[vi][i].second+cnt,num);
}
}
int best_path(int n, int k, int h[][2], int l[])
{
for(int i=0;i<n;i++){
v[h[i][0]].push_back({h[i][1],l[i]});
v[h[i][1]].push_back({h[i][0],l[i]});
}
for(int i=0;i<n;i++){
now=i;
fun(i,0,0);
memset(used,0,sizeof(used));
}
int mn=INT_MAX;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(ans[i][j]==k){
mn=min(mn,len[i][j]);
}
}
}
mn=(mn==INT_MAX ? -1:mn);
return mn;
}
