Submission #436420

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
436420	2021-06-24 13:29:44	frodakcin	Stations (IOI20_stations)	C++17	100 / 100	1265 ms	776 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 "stations.h"
#include <algorithm>
#include <vector>
#include <functional>
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
  std::vector<int> labels(n, -1);
  std::vector<std::vector<int> > a(n, std::vector<int>());
  for(int i=0;i<n-1;++i)
    a[u[i]].push_back(v[i]), a[v[i]].push_back(u[i]);
  int ctr=0;
  std::function<void(int,int,bool)> dfs=[&](int n, int p, bool t)
  {
    if(t) labels[n]=ctr++;
    for(int x:a[n])
      if(x!=p)
        dfs(x, n, !t);
    if(!t) labels[n]=ctr++;
  };
  dfs(0, -1, 0);
  return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
  if(s < c[0]) // all neighbors postorder
  {
    if(t<s) return c.back();
    if(t>c.back()) return c.back();
    return *std::lower_bound(c.begin(), c.end(), t);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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