Submission #36933

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
36933	2017-12-19 08:31:38	szawinis	Race (IOI11_race)	C++14	100 / 100	2177 ms	47808 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;
const int N = 2e5 + 1, K = 1e6 + 1;
int n, k, sz[N];
vector<pair<int, int>> g[N];
bool block[N];
void init(int u, int par) {
  sz[u] = 1;
  for(auto p: g[u]) if(p.first != par && !block[p.first]) {
     init(p.first, u);
     sz[u] += sz[p.first];
  }
}
void dfs(int u, int par, int sum, int depth, map<int, int>& store) {
  // cout << u << ' ' << par << endl;
  for(auto p: g[u]) if(p.first != par && !block[p.first]) {
    // cout << u << ' ' << p.first << ' ' << sum + p.second << ' ' << depth + 1 << endl;
     if(!store.count(sum + p.second)) store[sum + p.second] = depth + 1;
     else store[sum + p.second] = min(depth + 1, store[sum + p.second]);
     dfs(p.first, u, sum + p.second, depth + 1, store);
  }
}
int solve(int src) {
  init(src, -1);
  int cen = src;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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