Submission #305155

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
305155	2020-09-22 16:08:11	Temmie	Stations (IOI20_stations)	C++17	100 / 100	1194 ms	1056 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>
struct Node {
  std::vector <int> nei;
  int d, a, b;
  Node() : d(0), a(0), b(0) { }
};
struct Triplet {
  int x, y, z;
  Triplet(int X = 0, int Y = 0, int Z = 0) : x(X), y(Y), z(Z) { }
  bool operator<(const Triplet& other) const {
    if (x == other.x) return y > other.y;
    return x < other.x;
  }
};
int cnt;
void dfs(std::vector <Node>& g, int node = 0, int par = -1) {
  g[node].a = cnt++;
  g[node].d = par == -1 ? 0 : g[par].d + 1;
  for (int x : g[node].nei) if (x != par) dfs(g, x, node);
  g[node].b = cnt - 1;
}
std::vector <int> label(int n, int k, std::vector <int> u, std::vector <int> v) {
  
  cnt = 0;
  std::vector <int> r(n);
  std::vector <Node> g(n);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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