제출 #28930

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
28930	2017-07-18 00:14:24	h0ngjun7	경주 (Race) (IOI11_race)	C++14	100 / 100	518 ms	66484 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 <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;
const int MAXN = 200005;
struct EDGE { int x, w; };
int N, K, ans = -1;
vector <EDGE> v[MAXN];
void f(int x, int par, unordered_map <int, int> &d, int &L, int &W) {
  d[0] = 0;
  for (auto &y : v[x]) {
    if (y.x == par) continue;
    unordered_map <int, int> d2;
    int L2 = 0, W2 = 0;
    f(y.x, x, d2, L2, W2);
    L2++; W2 += y.w;
    if (d.size() < d2.size()) {
      d.swap(d2);
      swap(L, L2);
      swap(W, W2);
    }
    for (auto &t : d2) {
      if (d.count(K - (t.first + W2 + W))) {
        if (ans == -1 || ans > d[K - (t.first + W2 + W)] + t.second + L + L2)
          ans = d[K - (t.first + W2 + W)] + t.second + L + L2;
      }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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