Submission #305457

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
305457	2020-09-23 08:46:24	myungwoo	Stations (IOI20_stations)	C++17	100 / 100	1005 ms	1152 KiB

stations

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 <bits/stdc++.h>
#include "stations.h"
using namespace std;
vector<int> label(int N, int K, vector<int> u, vector<int> v)
{
  vector<vector<int>> con(N);
  for (int i=0;i<N-1;i++)
    con[u[i]].push_back(v[i]),
    con[v[i]].push_back(u[i]);
  vector<int> labels(N); int idx = 0;
  function<void(int, int)> dfs;
  dfs = [&](int n, int p){
    if (p == -1 || !labels[p]) labels[n] = ++idx;
    for (int t: con[n]) if (t != p)
      dfs(t, n);
    if (!labels[n]) labels[n] = ++idx;
  };
  dfs(0, -1);
  return labels;
}
int find_next_station(int s, int t, vector<int> c)
{
  if (c.back() < s) reverse(c.begin(), c.end());
  for (int x: c) if (min(s, x) <= t && t <= max(s, x)) return x;
  return c.back();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 16 / 16
• Subtask 4: 10 / 10
• Subtask 5: 61 / 61