제출 #31646

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
31646	2017-08-30 08:33:34	cheater2k	Beads and wires (APIO14_beads)	C++14	57 / 100	289 ms	24224 KiB

beads

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 <bits/stdc++.h>
using namespace std;
const int N = 200010;
const int inf = 2e9 + 12345;
int n;
int f[N][2], g[N][2];
vector < pair<int,int> > G[N], ch[N];
int ans;
void dfs(int u, int p) {
  for (auto edge: G[u]) if (edge.second != p) {
    dfs(edge.second, u);
    ch[u].push_back(edge);
  }
  f[u][1] = -inf;
  f[u][0] = 0;
  for (auto edge: ch[u]) {
    f[u][0] += max(f[edge.second][0], f[edge.second][1] + edge.first);
  }
  for (auto edge: ch[u]) {
    int mx = f[u][0];
    mx -= max(f[edge.second][0], f[edge.second][1] + edge.first);
    mx += (f[edge.second][0] + edge.first);
    f[u][1] = max(f[u][1], mx);
  }
}
void re_dfs(int u, int p) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 13 / 13
• Subtask 2: 15 / 15
• Subtask 3: 29 / 29
• Subtask 4: 0 / 43