oj.uz

Submission #60810

# Submission time Handle Problem Language Result Execution time Memory
60810 2018-07-24T17:21:18 Z theknife2001 Race (IOI11_race) C++17
43 / 100
 3000 ms 115196 KB 
#include "race.h"
#include <bits/stdc++.h>

using namespace std;
const int M=2e5+55;
vector < pair < int , int > > vec[M];
int k[M][105];
int b=1e9+55;

void dfs(int u , int p , int K)
{
    int v,c;
    int temp;
    for(auto x:vec[u])
    {
        v=x.first;
        c=x.second;
        if(v==p)
            continue ;
        dfs(v,u,K);
        for(int i=0;i<=K-c;i++)
            b=min(b,k[v][i]+k[u][K-i-c]+1);
        for(int i=0;i<=K-c;i++)
        {
            temp=k[v][i];
            k[u][i+c]=min(k[u][i+c],temp+1);
        }
    }
    b=min(b,k[u][K]);
}

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]});
    }
    if(K>100)
    {
        b=1e9+55;
        for(int i=0;i<n;i++)
        {
            df(i,-1,0,0,K);
        }
        if(b==1e9+55)
            return -1;
        return b;
    }
    for(int i=0;i<n;i++)
    {
        for(int j=1;j<=K;j++)
            k[i][j]=1e9+55;
    }
    dfs(0,-1,K);
    return (b==1e9+55?-1:b);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 9 ms 5220 KB Output is correct
3 Correct 9 ms 5220 KB Output is correct
4 Correct 7 ms 5220 KB Output is correct
5 Correct 8 ms 5316 KB Output is correct
6 Correct 7 ms 5424 KB Output is correct
7 Correct 7 ms 5424 KB Output is correct
8 Correct 8 ms 5424 KB Output is correct
9 Correct 7 ms 5424 KB Output is correct
10 Correct 7 ms 5424 KB Output is correct
11 Correct 10 ms 5424 KB Output is correct
12 Correct 7 ms 5424 KB Output is correct
13 Correct 9 ms 5424 KB Output is correct
14 Correct 9 ms 5424 KB Output is correct
15 Correct 6 ms 5436 KB Output is correct
16 Correct 7 ms 5436 KB Output is correct
17 Correct 6 ms 5460 KB Output is correct
18 Correct 6 ms 5460 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 9 ms 5220 KB Output is correct
3 Correct 9 ms 5220 KB Output is correct
4 Correct 7 ms 5220 KB Output is correct
5 Correct 8 ms 5316 KB Output is correct
6 Correct 7 ms 5424 KB Output is correct
7 Correct 7 ms 5424 KB Output is correct
8 Correct 8 ms 5424 KB Output is correct
9 Correct 7 ms 5424 KB Output is correct
10 Correct 7 ms 5424 KB Output is correct
11 Correct 10 ms 5424 KB Output is correct
12 Correct 7 ms 5424 KB Output is correct
13 Correct 9 ms 5424 KB Output is correct
14 Correct 9 ms 5424 KB Output is correct
15 Correct 6 ms 5436 KB Output is correct
16 Correct 7 ms 5436 KB Output is correct
17 Correct 6 ms 5460 KB Output is correct
18 Correct 6 ms 5460 KB Output is correct
19 Correct 6 ms 5460 KB Output is correct
20 Correct 8 ms 5460 KB Output is correct
21 Correct 18 ms 5460 KB Output is correct
22 Correct 9 ms 5460 KB Output is correct
23 Correct 9 ms 5460 KB Output is correct
24 Correct 8 ms 5460 KB Output is correct
25 Correct 17 ms 5460 KB Output is correct
26 Correct 9 ms 5460 KB Output is correct
27 Correct 10 ms 5460 KB Output is correct
28 Correct 13 ms 5460 KB Output is correct
29 Correct 16 ms 5468 KB Output is correct
30 Correct 15 ms 5484 KB Output is correct
31 Correct 21 ms 5500 KB Output is correct
32 Correct 18 ms 5516 KB Output is correct
33 Correct 21 ms 5532 KB Output is correct
34 Correct 9 ms 5532 KB Output is correct
35 Correct 10 ms 5632 KB Output is correct
36 Correct 9 ms 5632 KB Output is correct
37 Correct 17 ms 5632 KB Output is correct
38 Correct 19 ms 5632 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 9 ms 5220 KB Output is correct
3 Correct 9 ms 5220 KB Output is correct
4 Correct 7 ms 5220 KB Output is correct
5 Correct 8 ms 5316 KB Output is correct
6 Correct 7 ms 5424 KB Output is correct
7 Correct 7 ms 5424 KB Output is correct
8 Correct 8 ms 5424 KB Output is correct
9 Correct 7 ms 5424 KB Output is correct
10 Correct 7 ms 5424 KB Output is correct
11 Correct 10 ms 5424 KB Output is correct
12 Correct 7 ms 5424 KB Output is correct
13 Correct 9 ms 5424 KB Output is correct
14 Correct 9 ms 5424 KB Output is correct
15 Correct 6 ms 5436 KB Output is correct
16 Correct 7 ms 5436 KB Output is correct
17 Correct 6 ms 5460 KB Output is correct
18 Correct 6 ms 5460 KB Output is correct
19 Correct 219 ms 51716 KB Output is correct
20 Correct 187 ms 51716 KB Output is correct
21 Correct 175 ms 51716 KB Output is correct
22 Correct 197 ms 51716 KB Output is correct
23 Correct 203 ms 51716 KB Output is correct
24 Correct 176 ms 51716 KB Output is correct
25 Correct 222 ms 55980 KB Output is correct
26 Correct 166 ms 60396 KB Output is correct
27 Correct 371 ms 97316 KB Output is correct
28 Correct 391 ms 115196 KB Output is correct
29 Correct 402 ms 115196 KB Output is correct
30 Correct 389 ms 115196 KB Output is correct
31 Correct 449 ms 115196 KB Output is correct
32 Correct 567 ms 115196 KB Output is correct
33 Correct 443 ms 115196 KB Output is correct
34 Correct 318 ms 115196 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 9 ms 5220 KB Output is correct
3 Correct 9 ms 5220 KB Output is correct
4 Correct 7 ms 5220 KB Output is correct
5 Correct 8 ms 5316 KB Output is correct
6 Correct 7 ms 5424 KB Output is correct
7 Correct 7 ms 5424 KB Output is correct
8 Correct 8 ms 5424 KB Output is correct
9 Correct 7 ms 5424 KB Output is correct
10 Correct 7 ms 5424 KB Output is correct
11 Correct 10 ms 5424 KB Output is correct
12 Correct 7 ms 5424 KB Output is correct
13 Correct 9 ms 5424 KB Output is correct
14 Correct 9 ms 5424 KB Output is correct
15 Correct 6 ms 5436 KB Output is correct
16 Correct 7 ms 5436 KB Output is correct
17 Correct 6 ms 5460 KB Output is correct
18 Correct 6 ms 5460 KB Output is correct
19 Correct 6 ms 5460 KB Output is correct
20 Correct 8 ms 5460 KB Output is correct
21 Correct 18 ms 5460 KB Output is correct
22 Correct 9 ms 5460 KB Output is correct
23 Correct 9 ms 5460 KB Output is correct
24 Correct 8 ms 5460 KB Output is correct
25 Correct 17 ms 5460 KB Output is correct
26 Correct 9 ms 5460 KB Output is correct
27 Correct 10 ms 5460 KB Output is correct
28 Correct 13 ms 5460 KB Output is correct
29 Correct 16 ms 5468 KB Output is correct
30 Correct 15 ms 5484 KB Output is correct
31 Correct 21 ms 5500 KB Output is correct
32 Correct 18 ms 5516 KB Output is correct
33 Correct 21 ms 5532 KB Output is correct
34 Correct 9 ms 5532 KB Output is correct
35 Correct 10 ms 5632 KB Output is correct
36 Correct 9 ms 5632 KB Output is correct
37 Correct 17 ms 5632 KB Output is correct
38 Correct 19 ms 5632 KB Output is correct
39 Correct 219 ms 51716 KB Output is correct
40 Correct 187 ms 51716 KB Output is correct
41 Correct 175 ms 51716 KB Output is correct
42 Correct 197 ms 51716 KB Output is correct
43 Correct 203 ms 51716 KB Output is correct
44 Correct 176 ms 51716 KB Output is correct
45 Correct 222 ms 55980 KB Output is correct
46 Correct 166 ms 60396 KB Output is correct
47 Correct 371 ms 97316 KB Output is correct
48 Correct 391 ms 115196 KB Output is correct
49 Correct 402 ms 115196 KB Output is correct
50 Correct 389 ms 115196 KB Output is correct
51 Correct 449 ms 115196 KB Output is correct
52 Correct 567 ms 115196 KB Output is correct
53 Correct 443 ms 115196 KB Output is correct
54 Correct 318 ms 115196 KB Output is correct
55 Correct 339 ms 115196 KB Output is correct
56 Execution timed out 3019 ms 115196 KB Time limit exceeded
57 Halted 0 ms 0 KB -