제출 #1012996

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1012996	2024-07-03 04:27:43	aufan	경주 (Race) (IOI11_race)	C++17	100 / 100	281 ms	76524 KiB

race

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int best_path(int n, int k, int h[][2], int l[]) { 
  vector<vector<pair<int, int>>> v(n);
  for (int i = 0; i < n - 1; i++) {
    int a = h[i][0], b = h[i][1], c = l[i];
    v[a].push_back({b, c});
    v[b].push_back({a, c});
  }
  int tim = -1;
  vector<int> sz(n), big(n, -1), tin(n), tout(n), idx(n), dep(n);
  vector<long long> d(n);
  function<void(int, int)> dfs = [&](int x, int p) {
    sz[x] = 1;
    tin[x] = ++tim;
    idx[tim] = x;
    for (auto [z, c] : v[x]) {
      if (z == p) continue;
      d[z] = d[x] + c;
      dep[z] = dep[x] + 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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