제출 #886052

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
886052		VMaksimoski008	Race (IOI11_race)	C++17	21 / 100	3068 ms	13148 KiB

race

#include <bits/stdc++.h>
#include "race.h"

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int ans = 1e9, k;
vector<vector<pii> > graph;

void dfs(int u, int p, int edges, ll dist) {
    if(dist > k) return ;
    if(edges + 1 > ans) return ;

    if(dist == k) ans = min(ans, edges);

    for(auto &v : graph[u]) {
        if(v.first == p) continue;
        dfs(v.first, u, edges+1, dist+v.second);
    }
}

int best_path(int N, int K, int H[][2], int L[]) {
    k = K;
    graph.resize(N);
    for(int i=0; i<N-1; i++) {
        graph[H[i][0]].push_back({ H[i][1], L[i] });
        graph[H[i][1]].push_back({ H[i][0], L[i] });
    }

    for(int i=0; i<N; i++)
        dfs(i, 0, 0, 0);

    if(ans == 1e9) return -1;
    return ans;
}

// int32_t main() {
//     setIO();

//     int n, k;
//     cin >> n >> k;

//     int g[n-1][2];
//     for(int i=0; i<n-1; i++) {
//         int a, b;
//         cin >> a >> b;
//         g[i][0] = a;
//         g[i][1] = b;
//     }

//     int len[n-1];
//     for(int i=0; i<n-1; i++) cin >> len[i];

//     cout << best_path(n, k, g, len) << '\n';
//     return 0;
// }

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57