제출 #296148

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
296148	2020-09-10 10:45:51	eriksuenderhauf	Power Plant (JOI20_power)	C++17	0 / 100	5 ms	4992 KiB

power

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 = 2e5 + 5;
vector<int> adj[N];
int dp[N], rsm[N], sm[N];
string s;
void dfs(int u, int p = -1) {
  dp[u] = -(s[u] == '1'); // don't cut
  sm[u] = 0;
  for (int v: adj[u]) if (v != p) {
    dfs(v, u);
    sm[u] += dp[v];
  }
  dp[u] = max(-dp[u], dp[u] + sm[u]);
}
void reroot(int u, int p = -1) {
  if (~p) {
    int vp = s[p] == '1' ? 1 : 0;
    rsm[u] = sm[u] + max(vp, -vp + rsm[p] - dp[u]);
  } else {
    rsm[u] = sm[u];
  }
  int vu = s[u] == '1' ? 1 : 0;
  dp[u] = max(vu, rsm[u] - vu);
  for (int v: adj[u]) if (v != p) {
    reroot(v, u);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 6
• Subtask 2: 0 / 41
• Subtask 3: 0 / 53