제출 #676719

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
676719	2022-12-31 19:56:03	d4xn	경주 (Race) (IOI11_race)	C++17	100 / 100	747 ms	39340 KiB

race

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
#pragma GCC optimize ("Ofast")
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define map unordered_map
 
const int N = 2e5+1;
const ll inf = LLONG_MAX;
 
int n, k, sz[N];
ll ans;
vector<pair<int, ll>> adj[N];
bitset<N> r;
 
void dfs(int u, int par) {
  sz[u] = 1;
  for (auto &[v, w] : adj[u]) {
    if (v == par || r[v]) continue;
    dfs(v, u);
    sz[u] += sz[v];
  }
}
 
int find_centroid(int u, int par, int rt) {
  for (auto &[v, w] : adj[u]) {
    if (v != par && !r[v] && sz[v] > sz[rt]/2) {
      return find_centroid(v, u, rt);
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 22 / 22
• Subtask 4: 57 / 57