Submission #3015251
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 | PyPy3 (2.4.0) |
Score | 100 |
Code Size | 649 Byte |
Status | AC |
Exec Time | 936 ms |
Memory | 84640 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
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 | 170 ms | 38256 KB |
001.txt | AC | 169 ms | 38256 KB |
002.txt | AC | 714 ms | 78828 KB |
003.txt | AC | 838 ms | 81184 KB |
004.txt | AC | 640 ms | 71076 KB |
005.txt | AC | 812 ms | 78624 KB |
006.txt | AC | 856 ms | 79904 KB |
007.txt | AC | 842 ms | 81184 KB |
008.txt | AC | 666 ms | 71332 KB |
009.txt | AC | 854 ms | 83872 KB |
010.txt | AC | 692 ms | 73892 KB |
011.txt | AC | 887 ms | 82080 KB |
012.txt | AC | 610 ms | 67356 KB |
013.txt | AC | 836 ms | 83488 KB |
014.txt | AC | 568 ms | 68060 KB |
015.txt | AC | 854 ms | 82464 KB |
016.txt | AC | 667 ms | 71708 KB |
017.txt | AC | 851 ms | 83232 KB |
018.txt | AC | 407 ms | 58072 KB |
019.txt | AC | 936 ms | 84640 KB |
020.txt | AC | 352 ms | 54744 KB |
021.txt | AC | 857 ms | 80160 KB |