Submission #1172557

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1172557	2025-03-24 00:27:35	versesrev	Race (IOI11_race)	C++20	Compilation error	0 ms	0 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
// 23:47
#include <vector>
#include <utility>
#include <functional>
int best_path(int N, int K, int H[][2], int L[]) {
  if (N == 1) {
    return -1;
  }
  std::vector<std::vector<std::pair<int, long long>>> edges;
  for (int i = 0; i < N.- 1; ++i) {
    edges[H[i][0]].emplace_back(H[i][1], L[i]);
    edges[H[i][1]].emplace_back(H[i][0], L[i]);
  }
  int ans = N + 1;
  std::vector<bool> exist(N, true);
  std::vector<std::vector<int>> subtree_sizes;
  std::vector<std::vector<int>> dists;
  std::vector<std::vector<int>> depths;
  std::vector<std::vector<int>> min_lengths;
  auto dc = [&](int dc_depth, int root) {
    if (dc_depth >= subtree_sizes.size()) {
      subtree_sizes.emplace_back(N, 0);
      dists.emplace_back(N, 0);
      depths.emplace_back(N, 0);
      min_lengths.emplace_back(K + 1, N + 1);
    }
    // find centroid
    int g = std::invoke([&]{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:12:25: error: expected unqualified-id before '-' token
   12 |   for (int i = 0; i < N.- 1; ++i) {
      |                         ^
race.cpp: In lambda function:
race.cpp:31:28: error: use of 'subtree_size' before deduction of 'auto'
   31 |       auto& subtree_size = subtree_size[dc_depth];
      |                            ^~~~~~~~~~~~
race.cpp:40:7: error: conversion from 'best_path(int, int, int (*)[2], int*)::<lambda(int, int)>::<lambda()>::<lambda(int, int)>' to non-scalar type 'std::function<int(int, int)>' requested
   40 |       };
      |       ^
race.cpp:49:33: error: 'total' was not declared in this scope
   49 |           if (subtree_size[u] > total / 2) {
      |                                 ^~~~~
race.cpp: In lambda function:
race.cpp:62:7: error: use of 'dc' before deduction of 'auto'
   62 |       dc(dc_depth + 1, u);
      |       ^~