제출 #592435

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
592435	2022-07-09 07:53:08	Bobaa	Cats or Dogs (JOI18_catdog)	C++17	100 / 100	138 ms	27600 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 "catdog.h"
#include<bits/stdc++.h>
using namespace std;
 
const int MAXN = 1.1e5;
int N;
vector<int> adj[MAXN];
int A[MAXN];
int sz[MAXN];
int par[MAXN];
 
void dfs_sz(int cur, int prv) {
  if (prv) adj[cur].erase(find(adj[cur].begin(), adj[cur].end(), prv));
  sz[cur] = 1;
  par[cur] = prv;
  for (int nxt : adj[cur]) {
    dfs_sz(nxt, cur);
    sz[cur] += sz[nxt];
  }
  nth_element(adj[cur].begin(), adj[cur].begin(), adj[cur].end(), [&](int i, int j) { 
    return sz[i] > sz[j]; 
  });
}
 
int heavypar[MAXN];
int num[MAXN];
int pos[MAXN];
 
void dfs_hld(int cur, int top) {
  heavypar[cur] = top;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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