Submission #1000847

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1000847	2024-06-18T10:11:21 Z	Tsog	Race (IOI11_race)	C++14	Compilation error	0 ms	0 KB

race

#include "race.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair

using namespace std;


const int INF = INT_MAX;

void dfs(int v, int parent, vector<vector<int>>& dp, const vector<vector<pair<int,int>>>& adj) {
	for (auto i = 0; i < adj[v].size(); ++i) {
        int u = adj[v][i].first;
        int cos = adj[v][i].second;
        
        if (u == parent) {
            continue;
        }
        
        for (int k = cos; k <= 200; ++k) { 
            if (dp[v][k - cos] != INF) {
                dp[u][k] = min(dp[u][k], dp[v][k - cos] + 1);
            }
        }
        
        dfs(u, v, dp, adj);
    }
}


int best_path(int N, int K, int H[][2], int L[]) {
    vector<vector<pair<int,int>>> adj(N);
    for (int i = 0; i < N - 1; ++i) {
        int u = H[i][0], v = H[i][1];
        adj[u].push_back(mp(v,L[i]));
        adj[v].push_back(mp(u,L[i]));
    }
    
    vector<vector<int>> dp(N, vector<int>(1000001, INF));
    dp[i][0] = 0;
    
    dfs(0, -1, dp, adj);
    
    int result = INF;
    for (int v = 0; v < N; ++v) {
        result = min(result, dp[v][K]);
    }
    
    return (result == INF ? -1 : result);
}

// int main() {
// 	ios_base::sync_with_stdio(false);
// 	cin.tie(0);
// 	cout.tie(0);
//     int N;
//     int K;
//     int a , b , l , i;
//     vector<vector<int>> H;
//     vector<int> L;
//     cin >> N >> K;
//     for(i = 1 ; i < N ; i++){
//     	cin >> a >> b;
//     	cin >> l;
//     	L.pb(l);
//     	H.pb({a , b});
//     }
    
//     int min_highways = best_path(N, K, H, L);
    
//     cout << min_highways;
// }

Compilation message

race.cpp: In function 'void dfs(int, int, std::vector<std::vector<int> >&, const std::vector<std::vector<std::pair<int, int> > >&)':
race.cpp:12:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |  for (auto i = 0; i < adj[v].size(); ++i) {
      |                   ~~^~~~~~~~~~~~~~~
race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:40:8: error: 'i' was not declared in this scope
   40 |     dp[i][0] = 0;
      |        ^