Submission #328844

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
328844	2020-11-18 08:01:24	dolphingarlic	Stations (IOI20_stations)	C++14	100 / 100	928 ms	1232 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 <vector>
#include <algorithm>
std::vector<int> graph[1000];
bool even[1000];
int tin[1000], tout[1000], timer;
void dfs(int node = 0, int parent = -1, bool even = true) {
  tin[node] = timer++;
  ::even[node] = even;
  for (int i : graph[node]) if (i != parent) dfs(i, node, !even);
  tout[node] = timer++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
  for (int i = 0; i < n; i++) graph[i].clear();
  for (int i = 0; i < n - 1; i++) {
    graph[u[i]].push_back(v[i]);
    graph[v[i]].push_back(u[i]);
  }
  timer = 0;
  dfs();
  std::vector<int> labels(n);
  for (int i = 0; i < n; i++) labels[i] = (even[i] ? tin[i] : tout[i]) / 2;
  return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
  int mx = *std::max_element(c.begin(), c.end());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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