Submission #937793

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
937793	2024-03-04 13:16:10	weakweakweak	Cat Exercise (JOI23_ho_t4)	C++14	100 / 100	203 ms	46864 KiB

Main

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 n, val[210000], fa[210000], vtoi[210000], par[210000][21], dep[210000] = {0};
long long ans[210000] = {0};
vector <int> e[210000];
int find (int x) {return fa[x] == x ? x : fa[x] = find(fa[x]);}
void dfs(int i, int p) {
    dep[i] = dep[p] + 1;
    par[i][0] = p;
    for (int j : e[i]) if (j != p) dfs(j, i);
}
int dis (int x, int y) {
    int res = 0;
    if (dep[x] > dep[y]) swap(x, y);
    for (int i = 0; i <= 19; i++) if ((dep[y] - dep[x]) & (1 << i)) y = par[y][i], res += (1 << i);
    if (x == y) return res;
    for (int j = 19; j >= 0; j--) if (par[x][j] != par[y][j]) x = par[x][j], y = par[y][j], res += (1 << j) << 1;
    res += 2;
return res;}
int main () {
    //輸入、建圖
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 10 / 10
• Subtask 5: 20 / 20
• Subtask 6: 23 / 23
• Subtask 7: 26 / 26