小明种苹果(续)
if __name__ == "__main__":
n = int(input())
T = 0
D = 0
E = 0
flag = [0 for _ in range(n)]
for i in range(n):
s = list(map(int,input().split()))
m = s[0]
cur = s[1]
for j in s[2:]:
if j>0 :
if cur>j:
cur = j
flag[i]=1
else:
cur+=j
T+=cur
#一棵苹果树可能发生多次掉落,如果将D写在上面的话,可能导致同一棵树被多次记录
for i in range(len(flag)):
if flag[i]:
D+=1
if flag[(i+n)%n] and flag[(i+n+1)%n] and flag[(i+n-1)%n]:
E+=1
print(T,D,E)