제출 #383355

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
383355	2021-03-29 18:01:26	Aryan_Raina	경주 (Race) (IOI11_race)	C++14	100 / 100	584 ms	38660 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
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ld long double
#define ar array
 
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int MXN = 2e5+9, MXK = 1e6+9;
vector<ar<int,2>> g[MXN], to_update;
vector<int> length(MXK, INF), indexes, sz(MXN);
vector<bool> dead(MXK, false);
int n, k, ans = INT_MAX;
int OneCentroid(int rt) {
  function<void(int,int)> get_sz = [&](int u, int pu) {
    sz[u] = 1;
    for (auto v : g[u]) if (v[1] != pu && !dead[v[1]]) {
      get_sz(v[1], u);
      sz[u] += sz[v[1]];
    }
  };
  get_sz(rt, rt);
  function<int(int,int)> cent = [&](int u, int pu) {
    for (auto v : g[u]) if (v[1] != pu && !dead[v[1]]) {
      if (sz[v[1]] > sz[rt]/2) return cent(v[1], u);
    }
    return u;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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