oj.uz

Submission #1076459

# Submission time Handle Problem Language Result Execution time Memory
1076459 2024-08-26T14:05:47 Z rayan_bd Race (IOI11_race) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define pb push_back
 
const int mxN = 1005;
const int INF = (int)1e9;
 
vector<pair<int,int>> adj[mxN];
 
int find(int src,int k){
    if(k<0) return INF;
    if(k==0) return 0;
    int ans=INF;
    for(auto it:adj[src]){
        ans=min(ans,find(it.first,k-it.second)+1);
    }
    return ans;
}
 
int best_path(int n,int k,int h[][2],int l[]){
 
    for(int i=0;i<n-1;++i){
        adj[h[i][0]].pb({h[i][1],l[i]});
        adj[h[i][1]].pb({h[i][0],l[i]});
    }
 
    int ans=INF;
 
  
    if(ans==INF) return -1;
    return ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -