oj.uz

Submission #60655

# Submission time Handle Problem Language Result Execution time Memory
60655 2018-07-24T13:26:14 Z theknife2001 Race (IOI11_race) C++17
0 / 100
 8 ms 5228 KB 
#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);
    }
    return b;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 8 ms 5228 KB Output is correct
3 Incorrect 7 ms 5228 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 8 ms 5228 KB Output is correct
3 Incorrect 7 ms 5228 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 8 ms 5228 KB Output is correct
3 Incorrect 7 ms 5228 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 8 ms 5228 KB Output is correct
3 Incorrect 7 ms 5228 KB Output isn't correct
4 Halted 0 ms 0 KB -