제출 #153759

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
153759	2019-09-15 20:16:11	tutis	Cats or Dogs (JOI18_catdog)	C++17	100 / 100	2156 ms	29304 KiB

catdog

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;
const int maxn = 101010;
vector<int>adj[maxn];
int pa[maxn], sz[maxn];
void dfs(int i, int p)
{
  if (p != 0)
    adj[i].erase(find(adj[i].begin(), adj[i].end(), p));
  pa[i] = p;
  sz[i] = 1;
  pair<int, int>mx = { -1, -1};
  for (int t = 0; t < (int)adj[i].size(); t++)
  {
    int j = adj[i][t];
    dfs(j, i);
    sz[i] += sz[j];
    mx = max(mx, {sz[j], t});
  }
  if (mx.second != -1)
    swap(adj[i][0], adj[i][mx.second]);
}
int timer = 1;
int nr[maxn], head[maxn], tail[maxn];
void hld(int i, int h)
{
  nr[i] = timer++;
  head[i] = h;
  tail[h] = i;
  for (int t = 0; t < (int)adj[i].size(); t++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 30 / 30
• Subtask 3: 62 / 62