제출 #511810

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
511810	2022-01-16 04:35:11	czhang2718	Power Plant (JOI20_power)	C++17	100 / 100	286 ms	30400 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=200001;
int n;
vector<int> adj[N];
int dp[N][2];
int up[N];
string s;
int ans=1;
void dfs(int x, int par){
  dp[x][1]=(s[x]=='1'?1:-1e9);
  dp[x][0]=(s[x]=='1')*(-1);
  for(int k:adj[x]){
    if(k==par) continue;
    dfs(k, x);
    dp[x][0]+=max({0, dp[k][0], dp[k][1]});
    if(s[x]=='1' && s[k]=='1') ans=max(ans, 2);
  }
  // cout << "dp[" << x << "][" << 0 << "] " << dp[x][0] << '\n';
}
void dfs2(int x, int par){
  up[x]=max(up[x], 0);
  // cout << "up " << x << " " << up[x] << "\n";
  int sum=up[x];
  for(int k:adj[x]){
    if(k==par) continue;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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