oj.uz

Submission #651712

# Submission time Handle Problem Language Result Execution time Memory
651712 2022-10-19T21:26:38 Z beaconmc Power Plant (JOI20_power) PyPy 3
0 / 100
 37 ms 18176 KB 
import sys

input = lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(1000000000)


n = int(input())
if n==1:
    print(1)
    quit()
edges = [[] for i in range(n+1)]
par = [-1 for i in range(n+1)]
visited = [False for i in range(n+1)]
for i in range(n-1):
    a,b = map(int, input().split())
    edges[a].append(b)
    edges[b].append(a)
sus = input()

root = 1
flag = False

def dfs(a):
    for i in edges[a]:
        if not visited[i]:
            par[i] = a
            visited[i] = True
            dfs(i)
visited[root] = True
dfs(root)
dps = [-1 for i in range(n+1)]
used = [0 for i in range(n+1)]

ans = -1
def dp(a):
    global ans

    if dps[a] != -1:
        return dps[a]
    
    sum = 0
    maxi = 0
    for i in edges[a]:
        if i == par[a]: continue
        sum += dps[i]
        maxi = max(maxi, dps[i])
    
    if sus[a-1]=="1":
        ans = max(ans, maxi+1, sum-1)
    else:
        ans = max(ans,sum)
        
    dps[a] = max(sum-int(sus[a-1]), int(sus[a-1]))
    return dps[a]
        

dp(root)
print(ans)

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 18128 KB Output is correct
2 Correct 34 ms 18132 KB Output is correct
3 Incorrect 37 ms 18176 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 18128 KB Output is correct
2 Correct 34 ms 18132 KB Output is correct
3 Incorrect 37 ms 18176 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 18128 KB Output is correct
2 Correct 34 ms 18132 KB Output is correct
3 Incorrect 37 ms 18176 KB Output isn't correct
4 Halted 0 ms 0 KB -