結果

問題 No.977 アリス仕掛けの摩天楼
ユーザー buey_t
提出日時 2023-03-27 10:50:39
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 442 ms / 2,000 ms
コード長 3,604 bytes
コンパイル時間 143 ms
コンパイル使用メモリ 82,164 KB
実行使用メモリ 113,920 KB
最終ジャッジ日時 2024-09-19 10:08:31
合計ジャッジ時間 6,876 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

def main():
    from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum
    from heapq import heapify, heappop, heappush
    from bisect import bisect_left, bisect_right
    from copy import deepcopy
    import copy
    import random
    from collections import deque,Counter,defaultdict
    from itertools import permutations,combinations
    from decimal import Decimal,ROUND_HALF_UP
    #tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
    from functools import lru_cache, reduce
    #@lru_cache(maxsize=None)
    from operator import add,sub,mul,xor,and_,or_,itemgetter
    INF = 10**18
    mod1 = 10**9+7
    mod2 = 998244353
    
    #DecimalならPython
    #再帰ならPython!!!!!!!!!!!!!!!!!!!!!!!!!!
    
    
    '''
    
    
    
    '''
    class UnionFind():
        def __init__(self, n):
            self.n = n
            self.parents = [-1] * n
            #親だけ
            self.edge = [0]*n
    
        def find(self, x):
            if self.parents[x] < 0:
                return x
            else:
                self.parents[x] = self.find(self.parents[x])
                return self.parents[x]
    
        def union(self, x, y):
            x = self.find(x)
            y = self.find(y)
    
            if self.parents[x] > self.parents[y]:
                x, y = y, x
            
            self.edge[x] += 1
            
            if x == y:
                return
    
            self.parents[x] += self.parents[y]
            self.edge[x] += self.edge[y]
            self.parents[y] = x
    
        def size(self, x):
            return -self.parents[self.find(x)]
    
        def same(self, x, y):
            return self.find(x) == self.find(y)
    
        def members(self, x):
            root = self.find(x)
            return [i for i in range(self.n) if self.find(i) == root]
    
        def roots(self):
            return [i for i, x in enumerate(self.parents) if x < 0]
    
        def group_count(self):
            return len(self.roots())
    
        def all_group_members(self):
            group_members = defaultdict(list)
            for member in range(self.n):
                group_members[self.find(member)].append(member)
            return group_members
    
        def __str__(self):
            return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
    
    #サイクルになってて一つだけ孤立してるパターン
    
    try:
        import pypyjit
        pypyjit.set_param('max_unroll_recursion=-1')
    except:
        pass
    try:
        import sys
        sys.setrecursionlimit(10**7)
    except:
        pass
    
    N = int(input())
    
    uf = UnionFind(N)
    
    def dfs(pos,r,cnt):
        
        if seen[r] == 1 and pos == r:
            print('Bob')
            exit()
        seen[pos] = 1
        
        for nx in G[pos]:
            if seen[nx] == 0 or (nx == r and cnt == N-1):
                dfs(nx,r,cnt+1)
    
    G = [[] for _ in range(N)]
    for _ in range(N-1):
        u,v = map(int, input().split())
        
        uf.union(u,v)
        G[u].append(v)
        G[v].append(u)
    
    if uf.group_count() == 1:
        print('Bob')
    elif uf.group_count() == 2:
        for r in uf.roots():
            seen = [0]*N
            dfs(r,r,1)
        
        print('Alice')
    else:
        print('Alice')
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
if __name__ == '__main__':
    main()
0