https://www.acmicpc.net/problem/3020 import sysinput = sys.stdin.readlineN, H = map(int, input().split(" "))li = [0]*H# 석순이면 0~num-1 높이까지 -> li[0] +1 / li[num] -1# 종유석이면 H-num~H 높이까지 -> li[H-num] +1for i in range(N): num = int(input()) # 석순 if i%2 == 0: li[0] += 1 li[num] -= 1 # 종유석 else: li[H-num] += 1 # 누적합 구하기# 각 높이에 해당하는 장애물의 개수 구하기for i in range(1,..
https://www.acmicpc.net/problem/11497 import sysinput = sys.stdin.readlineT = int(input())for _ in range(T): N = int(input()) N_list = list(map(int, input().split(" "))) N_list.sort() # 양쪽으로 하나씩 놓기 C_list = [0]*N left = 0 right = N-1 for i in range(N): if i % 2 == 0: C_list[left] = N_list[i] left += 1 else: C_list[right] = N_..
https://www.acmicpc.net/problem/7576 - 오답 코드 (시간 초과)import sysfrom collections import dequeinput = sys.stdin.readlinedef bfs(tomato_map): dq = deque() for i in range(N): for j in range(M): if tomato_map[i][j] == 1: dq.append((i, j)) cursor = [(-1,0), (1,0), (0,-1), (0,1)] change = False while dq: x, y = dq.popleft() for dx, dy in ..
https://www.acmicpc.net/problem/14502 import sysfrom itertools import combinationsfrom collections import dequeimport copyinput = sys.stdin.readline# 바이러스 전이def spread_virus(lab): q = deque() for i in range(N): for j in range(M): if lab[i][j] == 2: q.append((i, j)) while q: x, y = q.popleft() for dx, dy in [(-1,0), (1,0), (0,-1), (0,1)]..
