제출 #914462

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
914462		Isaac_Q1	경주 (Race) (IOI11_race)	C++14	0 / 100	3 ms	4700 KiB

race

#include <bits/stdc++.h>
#include<vector>
#define rep(i, n) for(int i=0; i<n; i++)
#define pii pair<int, ll>
#define ll long long
using namespace std;
ll TARGET;
const int INF = 1e9;
int BEST;
 
vector<vector<pii>> graph;
 
void DFS(int p, int node, ll w, int lenght){
    if(w > TARGET) return;
    if(w == TARGET) BEST = min(BEST,lenght);

    for(auto &e: graph[node])
    {
        if(e.first == p) continue;

        DFS(node, e.first, w + e.second, lenght + 1);
    }
}
 
 
int best_path(int N, int K, int H[][2], int L[]){
    TARGET = K;
    int a, b, l;
    for(int i=0; i<N-1; i++)
    {
        a = H[i][0]; b = H[i][1]; l = L[i];
        graph[a].push_back({b,l});
        graph[b].push_back({a,l});
    }

    BEST = INF;

    for(int i=0; i<N-1; i++) DFS(-1,i,0,0);

    if(BEST == INF) return -1;
    return BEST;
}

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