제출 #263051

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
263051	2020-08-13 12:37:15	Nightlight	경주 (Race) (IOI11_race)	C++14	21 / 100	207 ms	42232 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>
#define pii pair<int, int>
using namespace std;
int N, K;
map<long long, int> mp[100005];
vector<pii> adj[100005];
long long dist[100005];
int cnt[100005];
int ans = 1000000;
void DFS(int u, int p = N) {
  int v, w;
  mp[u][dist[u]] = cnt[u];
  for(pii now : adj[u]) {
    v = now.second, w = now.first;
    if(v == p) continue;
    dist[v] = dist[u] + w;
    cnt[v] = cnt[u] + 1;
    DFS(v, u);
    if(mp[v].size() > mp[u].size()) swap(mp[v], mp[u]);
  }
  long long jarak;
//  cout << u << " -> " << dist[u] << " " << cnt[u] << "\n";
  for(pii now : adj[u]) {
    v = now.second;
    if(v == p) continue;
//    cout << v << ":\n";
    for(pii it : mp[v]) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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