# stack이나 정렬 문제라고해서 완전히 그 형태로 만들어야된다는 생각은 버리고 규칙, 제약 조건을 먼저 생각해보자import sysimport heapqN = int$sys.stdin.readline($)time_list = [[] for _ in range$N$]pq = []num_lectures = 0for ind in range$N$: _, time_s, time_e = map$int, sys.stdin.readline($.split) time_list[ind].append$time_s$ time_list[ind].append$time_e$time_list = sorted$time_list, key = lambda x: (x[0], x[1]$)for ind in range(N..

# 문제 조건 잘 보자! import sysN = int$sys.stdin.readline($)name_table = dictflight_table = dictextracted_table = dictmax_number = 0for _ in range$N$: name, flight, time_s, time_e = sys.stdin.readline.split if name not in name_table: name_table[name] = [flight, [int$time_s$, int$time_e$]] if flight_table.get$flight$ == None: flight_table[flight] = [0 for _ in ra..

import sysimport bisectN, M = map$int, sys.stdin.readline($.split)M_list = list$map(int, sys.stdin.readline($.split))M_list_acc = [0] * MM_list_acc[0] = M_list[0]for i in range$1, M$: M_list_acc[i] = M_list_acc[i-1] + M_list[i]N_list = []for _ in range$N$: N_list.append$int(sys.stdin.readline($))for ind_N in range$len(N_list$): index = bisect.bisect_left$M_list_acc, N_list[ind_N]$ ..

문제 링크 : https://www.acmicpc.net/problem/19238import sysfrom collections import dequedef findDest$startX, startY, destX, destY, remainedFuel$: # 손님을 태우고 목적지로 향하는 함수 fuelMap = [[0 for _ in range$N$] for _ in range$N$] visited = [[0 for _ in range$N$] for _ in range$N$] locations = deque locations.append$[startX, startY, remainedFuel]$ while locations: x, y, F = locations..