結果

問題 No.977 アリス仕掛けの摩天楼
ユーザー cozy_saunacozy_sauna
提出日時 2022-03-10 21:36:00
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,140 bytes
コンパイル時間 299 ms
コンパイル使用メモリ 86,852 KB
実行使用メモリ 83,008 KB
最終ジャッジ日時 2023-10-13 00:12:56
合計ジャッジ時間 7,300 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 144 ms
78,252 KB
testcase_01 AC 146 ms
78,416 KB
testcase_02 AC 146 ms
78,544 KB
testcase_03 AC 148 ms
78,608 KB
testcase_04 AC 147 ms
78,452 KB
testcase_05 AC 150 ms
78,148 KB
testcase_06 AC 146 ms
78,652 KB
testcase_07 AC 147 ms
78,156 KB
testcase_08 AC 144 ms
78,572 KB
testcase_09 AC 145 ms
78,480 KB
testcase_10 WA -
testcase_11 AC 144 ms
78,504 KB
testcase_12 AC 146 ms
78,152 KB
testcase_13 AC 196 ms
80,944 KB
testcase_14 AC 199 ms
81,144 KB
testcase_15 AC 196 ms
81,060 KB
testcase_16 AC 191 ms
81,040 KB
testcase_17 AC 200 ms
81,036 KB
testcase_18 AC 218 ms
81,440 KB
testcase_19 WA -
testcase_20 AC 258 ms
83,008 KB
testcase_21 AC 282 ms
82,340 KB
testcase_22 AC 299 ms
82,064 KB
testcase_23 AC 283 ms
82,496 KB
testcase_24 AC 253 ms
81,772 KB
testcase_25 AC 273 ms
82,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from sys import setrecursionlimit, stdin
from collections import defaultdict, deque
from itertools import permutations, combinations, product
from functools import lru_cache
from random import sample, choice, randint, random
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop
from math import factorial, exp
from copy import copy, deepcopy
from time import time

setrecursionlimit(1 << 20)
readline = stdin.readline
# @lru_cache(maxsize = None)
INF = 10 ** 18
MOD = 998244353
# MOD = 1000000007
DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]
ALP = 26
''' Input '''
def I(): return int(readline())
def ST(): return readline()[:-1]
def LI(): return list(map(int, readline().split()))
def LII(): return list(map(lambda x: int(x) - 1, readline().split()))
def SPI(): return map(int, readline().split())
def SPII(): return map(lambda x: int(x) - 1, readline().split())
def FIE(x): return [readline()[:-1] for _ in [0] * x]
def NODE(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b = map(int, input().split())
        node[a - 1].append(b - 1)
        node[b - 1].append(a - 1)
    return node 

def NODE_W(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b, c = map(int, input().split())
        node[a - 1].append((b - 1, c))
        node[b - 1].append((a - 1, c))
    return node

''' Array '''
def cmin(dp, i, x):
    if x < dp[i]: dp[i] = x
def cmax(dp, i, x):
    if x > dp[i]: dp[i] = x

''' Sorted Array '''
# x <= A[i] (minimum i meeting the requirement)
def binary(sortedA, x): return bisect_left(sortedA, x)
# x < A[i] (minimum i meeting the requirement)
def binary2(sortedA, x): return bisect_right(sortedA, x + 1)
# number of x in A
def quantity(sortedA, x): return bisect_right(sortedA, x) - bisect_left(sortedA, x)

''' Alphabet '''
def id_a(s): return ord(s) - ord('a')
def id_A(s): return ord(s) - ord('A')
def st_a(i): return chr(ord('a') + i)
def st_A(i): return chr(ord('A') + i)

''' Other'''
def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]
def nynx(y, x, ly = INF, lx = INF): return [(y + dy, x + dx) for dy, dx in DYDX if 0 <= y + dy < ly and 0 <= x + dx < lx]
def gen(x, *args):
    ret = [x] * args[-1]
    for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]
    return ret
def is_prime(x):
    if x == 1 or x % 2 == 0: return x == 2
    f = 3
    while f * f <= x:
        if x % f == 0: return False 
        f += 2
    return True 

''' Output '''
def puts(E):
    for e in E: print(e)
def pprint(E): 
    print()
    for e in E: print(e)
def yn(x): print("Yes" if x else "No")
def blank(arr): print(" ".join(map(str, arr)))
def link(arr): print(''.join(map(str, arr)))
def debug(*args):
    if DEBUG:
        for e in args: print(e)
DEBUG = False
###############################################################################################

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.P = [-1] * n # parents

    def find(self, x):
        if self.P[x] < 0: return x
        self.P[x] = self.find(self.P[x])
        return self.P[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y: return
        if self.P[x] > self.P[y]: x, y = y, x
        self.P[x] += self.P[y]
        self.P[y] = x

    def size(self, x): return -self.P[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.P) if x < 0]

    def group_count(self): return len(self.roots())

    def all_group_members(self):
        from collections import defaultdict
        G = defaultdict(list)
        for member in range(self.n): G[self.find(member)].append(member)
        return G

    def __str__(self): return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

N = I()
uni = UnionFind(N)
for _ in range(N - 1):
    y, x = SPI()
    uni.union(y, x)

if uni.group_count() == 1: print("Bob")
else: print("Alice")
0