| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 384033 | MODDI | 경주 (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>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
#define MAX_N 500000
using namespace std;
vector<pii> G[200000];
ll min(ll a, ll b){
if(a > b)
return b;
return a;
}
int best = 1e9;
void rec(int node, int cnt_nodes, int path, int parent){
if(cnt_nodes >= best || path > K)
return;
if(path == K){
best = min(best, cnt_nodes);
return;
}
for(auto next : G[node]){
if(next.first != parent){
rec(next.first, cnt_nodes + 1, path + next.second, node);
}
}
}
int best_path(int n, int k, int h[][2], int l[])
{
for(int i = 0; i < n-1; i++){
G[h[i][0]].pb(mp(h[i][1], l[i]));
G[h[i][1]].pb(mp(h[i][0], l[i]));
}
for(int i = 0; i < n; i++)
rec(i, 0, 0, -1);
/*for(int i = 0; i <n; i++){
vector<pll> dist(n);
bool vis[n];
memset(vis, false, sizeof(vis));
queue<pii> q;
q.push(mp(i,0));
vis[i] = true;
while(!q.empty()){
int at = q.front().first;
int nodes = q.front().second;
q.pop();
for(auto next : G[at]){
if(!vis[next.first]){
dist[next.first] = mp(dist[at].first + next.second, nodes+1);
vis[next.first] = true;
q.push(mp(next.first, nodes + 1));
}
}
}
for(int j = 0; j < n; j++){
if(j == i)
continue;
if(dist[j].first == k)
best = min(best, dist[j].second);
}
}*/
if(best == 1e9)
return -1;
return best;
}