SET1 [python] 17471. 게리맨더링 문제 출처 17471. 게리맨더링 풀이 from itertools import combinations N = int(input()) population = list(map(int, input().split())) connection = {i: [j-1 for j in list(map(int, input().split()))[1:]] for i in range(N)} def is_connected(comb): check = [1 if i in comb else 0 for i in range(N)] visited = [0]*N visited[list(comb)[0]] = 1 q = connection[list(comb)[0]] while q: nxt = [] for i in q: if check[i] and.. 2019. 10. 19. 이전 1 다음
