BEAKJOON 5052, 9372

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22

import sys

for T in range(int(sys.stdin.readline().rstrip())):
    N = int(sys.stdin.readline().rstrip())

    Numbers = []
    for _ in range(N):
        Numbers.append(sys.stdin.readline().rstrip())

    Numbers.sort()

    result = "YES"
    for i in range(len(Numbers)-1):
        if Numbers[i+1].find(Numbers[i], 0, len(Numbers[i])) != -1:
            result = 'NO'
            break

    print(result)

    
# 흠.. 다른 사람들은 트리로 풀었나..?
# 이게 왜 트리에 있지...

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

import sys
from collections import deque

def BFS(i):
    q = deque([i])
    visited = [True] + [False] * N
    flight = -1
    while q:
        x = q.popleft()
        if visited[x] == False:
            visited[x] = True
            flight += 1
            for j in range(len(tree[x])):
                if visited[tree[x][j]] == False:
                    q.append(tree[x][j])
    return flight
            
for T in range(int(sys.stdin.readline().rstrip())):
    N, M = map(int, sys.stdin.readline().split())

    tree = [[] for _ in range((N+1))]
    for _ in range(M):
        a, b = map(int, sys.stdin.readline().split())
        tree[a].append(b)
        tree[b].append(a)


    print(BFS(1))