| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 719288 | Joshi503 | 경주 (Race) (IOI11_race) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using db = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT, size_t SZ > using AR = array<T, SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pi>;
using vpl = V<pl>;
#define sz(x) ll((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define pb push_back
#define yes cout << "Y" << "e" << "s\n";
#define no cout << "N" << "o\n";
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = ((b)-1); i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MOD98 = 998244353;
const int MX = 1e9;
const int INF = 1e18;
const db PI = acos((db)-1);
// const int dx[] = { 1,0,-1,0 };
// const int dy[] = { 0,1,0,-1 };
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
// void setIO(string name = "") {
// ios_base::sync_with_stdio(0); cin.tie(0);
// if ((ll)(name.size())) {
// freopen((name + ".in").c_str(), "r", stdin);
// freopen((name + ".out").c_str(), "w", stdout);
// }
// }
template<class T> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0;
}
template<class T> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0;
}
void _print(char i) { cerr << i; }
void _print(string i) { cerr << i; }
void _print(float i) { cerr << i; }
void _print(int i) { cerr << i; }
void _print(double i) { cerr << i; }
void _print() { cerr << "\n"; };
template<typename x, typename y> void _print(pair<x, y>& t) { cerr << "{";_print(t.first);cerr << ", ";_print(t.second);cerr << "},"; }
template<typename x> void _print(x& t) { cerr << "{"; for (int i = 0;i < (int)t.size();i++) { _print(t[i]); if (i < (int)t.size() - 1) cerr << ", "; } cerr << "}"; }
template<typename x, typename... y> void _print(x a, y... b) { _print(a);if (sizeof...(b)) cerr << ", ";_print(b...); }
#define dbg(x...) cerr<<"["<<#x<<"] = [";_print(x);cerr<<"]\n";
int test;
/*
*/
int n, k;
vi d;
vector<vpi> adj;
int mini;
void dfs(int u, int p, int len = 1){
each(v, adj[u]){
if(v.f == p) continue;
d[v.f] = d[u] + v.s;
if(d[v.f] == k){
mini = min(mini, len);
}
dfs(v.f, u, len + 1);
}
}
int best_path(int N, int K, int H[][2], int L[]){
adj = vector<vpi>(N + 1);
n = N, k = K;
F0R(i, N - 1){
int u = H[i][0], v = H[i][1];
adj[u].pb({v, L[i]});
adj[v].pb({u, L[i]});
}
int ans = 1e18;
F0R(i, N){
mini = 1e18;
d = vi(N + 1, 0LL);
dfs(i, -1);
ans = min(mini, ans);
}
return (ans == 1e18 ? -1 : ans);
}
// signed main() {
// setIO("");
// int T = 1;
// // cin >> T;
// for (test = 1; test <= T; test++) {
// // cout << "Case #" << test << ": " << a.f << " " << a.s << "\n";
// // solve();
// int N, K; cin >> N >> K;
// int H[N][2], L[N];
// F0R(i, N - 1) cin >> H[i][0] >> H[i][1];
// F0R(i, N) cin >> L[i];
// }
// }