Submission #3015249


Source Code Expand

import sys
sys.setrecursionlimit(10**7)
def dfs(granpa,parent):
    for i in L[parent]:
        if i==granpa:
            continue
        dfs(parent,i)
    for i in L[parent]:
        if i==granpa:
            continue
        g[parent]*=f[i]
        g[parent]%=mod
    for i in L[parent]:
        if i==granpa:
            continue
        f[parent]*=g[i]
        f[parent]%=mod
    f[parent]+=g[parent]
    f[parent]%=mod
        
N=int(input())
L=[set() for i in range(N)]
f=[1]*N
g=[1]*N
mod=10**9+7
for i in range(N-1):
    a,b=map(int,input().split())
    L[a-1].add(b-1)
    L[b-1].add(a-1)
dfs(0,0)
print(f[0])

Submission Info

Submission Time
Task D - 塗り絵
User okumura
Language Python (3.4.3)
Score 100
Code Size 649 Byte
Status AC
Exec Time 647 ms
Memory 35680 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 22
Set Name Test Cases
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt
Case Name Status Exec Time Memory
000.txt AC 17 ms 3064 KB
001.txt AC 18 ms 3064 KB
002.txt AC 483 ms 28580 KB
003.txt AC 643 ms 35576 KB
004.txt AC 400 ms 24584 KB
005.txt AC 629 ms 35680 KB
006.txt AC 596 ms 33036 KB
007.txt AC 642 ms 35596 KB
008.txt AC 446 ms 26148 KB
009.txt AC 631 ms 35584 KB
010.txt AC 443 ms 26512 KB
011.txt AC 639 ms 35580 KB
012.txt AC 361 ms 22340 KB
013.txt AC 646 ms 35560 KB
014.txt AC 284 ms 18344 KB
015.txt AC 628 ms 35616 KB
016.txt AC 371 ms 23120 KB
017.txt AC 634 ms 35640 KB
018.txt AC 116 ms 8820 KB
019.txt AC 647 ms 35592 KB
020.txt AC 70 ms 6260 KB
021.txt AC 634 ms 35568 KB