1388D - Captain Flint and Treasure - CodeForces Solution

import sys
input = sys.stdin.readline

def readList():
    return list(map(int, input().split()))
def readInt():
    return int(input())
def readInts():
    return map(int, input().split())
def readStr():
    return input().strip()

def solve():
    n, A, B = readInt(), readList(), readList()
    graph = [[] for _ in range(n)]
    par = [-1] * n
    for i in range(n):
        if B[i] != -1:
            graph[B[i]-1].append(i)
            par[i] = B[i]-1

    now, after = [], []
    for i in range(n):
        if B[i] == -1:
            st = [(i, 0)]
            while st:
                node, exp = st.pop()
                if exp:
                    if node == i:
                        now.append(node+1)
                        continue
                    if A[node] >= 0:
                        A[par[node]] += A[node]
                        now.append(node+1)
                    else:
                        after.append(node+1)
                else:
                    st.append((node, 1))
                    for nei in graph[node]:
                        st.append((nei, 0))
    print(sum(A))
    print(*(now + after[::-1]))
    return

solve()