oj.uz

Submission #1004892

# Submission time Handle Problem Language Result Execution time Memory
1004892 2024-06-21T22:05:16 Z cpdreamer Race (IOI11_race) C++17
9 / 100
 80 ms 130768 KB 
#include "race.h"
#include<bits/stdc++.h>
using namespace std;
#define P pair
#define V vector
#define F first
#define S second
#define pb push_back
int dp[(int)3e5][101];

void dfs(int n,int p,V<P<int,int>>tree[],int k){
    dp[n][0]=0;
    for(auto u:tree[n]){
        if(u.F==p)continue;
        dfs(u.F,n,tree,k);
        for(int i=u.S;i<=k;i++){
            if(dp[u.F][i-u.S]!=-1){
                if(dp[n][i]!=-1)
                    dp[n][i]=min(dp[n][i],dp[u.F][i-u.S]+1);
                else
                    dp[n][i]=dp[u.F][i-u.S]+1;
            }
        }
    }
}
int best_path(int N, int K, int H[][2], int L[])
{
    memset(dp,-1,sizeof(dp));
    V<P<int,int>>tree[N];
    for(int i=0;i<N-1;i++){
        tree[H[i][0]].pb({H[i][1],L[i]});
        tree[H[i][1]].pb({H[i][0],L[i]});
    }
    dfs(0,-1,tree,K);
    int ans=-1;
    for(int i=0;i<N;i++){
        if(dp[i][K]!=-1) {
            if(ans!=-1)
                ans = min(dp[i][K], ans);
            else
                ans=dp[i][K];
        }
    }
    return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 122460 KB Output is correct
2 Correct 16 ms 122632 KB Output is correct
3 Correct 16 ms 122456 KB Output is correct
4 Correct 17 ms 122460 KB Output is correct
5 Correct 15 ms 122608 KB Output is correct
6 Correct 15 ms 122460 KB Output is correct
7 Correct 16 ms 122460 KB Output is correct
8 Correct 16 ms 122456 KB Output is correct
9 Correct 16 ms 122456 KB Output is correct
10 Correct 14 ms 122684 KB Output is correct
11 Correct 16 ms 122432 KB Output is correct
12 Correct 15 ms 122448 KB Output is correct
13 Correct 16 ms 122460 KB Output is correct
14 Correct 16 ms 122452 KB Output is correct
15 Correct 16 ms 122460 KB Output is correct
16 Correct 16 ms 122492 KB Output is correct
17 Correct 16 ms 122456 KB Output is correct
18 Correct 16 ms 122460 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 122460 KB Output is correct
2 Correct 16 ms 122632 KB Output is correct
3 Correct 16 ms 122456 KB Output is correct
4 Correct 17 ms 122460 KB Output is correct
5 Correct 15 ms 122608 KB Output is correct
6 Correct 15 ms 122460 KB Output is correct
7 Correct 16 ms 122460 KB Output is correct
8 Correct 16 ms 122456 KB Output is correct
9 Correct 16 ms 122456 KB Output is correct
10 Correct 14 ms 122684 KB Output is correct
11 Correct 16 ms 122432 KB Output is correct
12 Correct 15 ms 122448 KB Output is correct
13 Correct 16 ms 122460 KB Output is correct
14 Correct 16 ms 122452 KB Output is correct
15 Correct 16 ms 122460 KB Output is correct
16 Correct 16 ms 122492 KB Output is correct
17 Correct 16 ms 122456 KB Output is correct
18 Correct 16 ms 122460 KB Output is correct
19 Incorrect 16 ms 122456 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 122460 KB Output is correct
2 Correct 16 ms 122632 KB Output is correct
3 Correct 16 ms 122456 KB Output is correct
4 Correct 17 ms 122460 KB Output is correct
5 Correct 15 ms 122608 KB Output is correct
6 Correct 15 ms 122460 KB Output is correct
7 Correct 16 ms 122460 KB Output is correct
8 Correct 16 ms 122456 KB Output is correct
9 Correct 16 ms 122456 KB Output is correct
10 Correct 14 ms 122684 KB Output is correct
11 Correct 16 ms 122432 KB Output is correct
12 Correct 15 ms 122448 KB Output is correct
13 Correct 16 ms 122460 KB Output is correct
14 Correct 16 ms 122452 KB Output is correct
15 Correct 16 ms 122460 KB Output is correct
16 Correct 16 ms 122492 KB Output is correct
17 Correct 16 ms 122456 KB Output is correct
18 Correct 16 ms 122460 KB Output is correct
19 Incorrect 80 ms 130768 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 122460 KB Output is correct
2 Correct 16 ms 122632 KB Output is correct
3 Correct 16 ms 122456 KB Output is correct
4 Correct 17 ms 122460 KB Output is correct
5 Correct 15 ms 122608 KB Output is correct
6 Correct 15 ms 122460 KB Output is correct
7 Correct 16 ms 122460 KB Output is correct
8 Correct 16 ms 122456 KB Output is correct
9 Correct 16 ms 122456 KB Output is correct
10 Correct 14 ms 122684 KB Output is correct
11 Correct 16 ms 122432 KB Output is correct
12 Correct 15 ms 122448 KB Output is correct
13 Correct 16 ms 122460 KB Output is correct
14 Correct 16 ms 122452 KB Output is correct
15 Correct 16 ms 122460 KB Output is correct
16 Correct 16 ms 122492 KB Output is correct
17 Correct 16 ms 122456 KB Output is correct
18 Correct 16 ms 122460 KB Output is correct
19 Incorrect 16 ms 122456 KB Output isn't correct
20 Halted 0 ms 0 KB -