제출 #537645

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
537645	2022-03-15 10:38:19	sliviu	Regions (IOI09_regions)	C++17	100 / 100	4762 ms	101700 KiB

regions

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>
using namespace std;
int main() {
  cin.tie(0)->sync_with_stdio(0);
  const int SQRT = 450;
  int n, r, q, x, y, t = -1;
  cin >> n >> r >> q;
  vector<vector<int>> G(n + 1), regnodes(r + 1);
  vector<int> tin(n + 1), tout(n + 1), reg(n + 1), nodes;
  cin >> reg[1];
  for (int i = 2; i <= n; ++i) {
    cin >> x >> reg[i];
    G[x].emplace_back(i);
    G[i].emplace_back(x);
  }
  function<void(int, int)> dfs = [&](int node, int last) {
    tin[node] = ++t;
    regnodes[reg[node]].emplace_back(t);
    nodes.emplace_back(node);
    for (auto x : G[node])
      if (x != last)
        dfs(x, node);
    tout[node] = t;
  };
  dfs(1, 0);
  map<pair<int, int>, int> ans;
  for (int i = 1; i <= r; ++i)
    if (regnodes[i].size() >= SQRT) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 85 / 85