From 25a6528d313f980affec206a086f6e54ced536b1 Mon Sep 17 00:00:00 2001 From: parkjungyoon Date: Fri, 28 Oct 2022 20:46:27 +0900 Subject: [PATCH 1/2] =?UTF-8?q?[Baekjoon-1916]=20=EC=B5=9C=EC=86=8C=20?= =?UTF-8?q?=EB=B9=84=EC=9A=A9=20=EA=B5=AC=ED=95=98=EA=B8=B0?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...1 \352\265\254\355\225\230\352\270\260.py" | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 "JY_Park/season3/10/05-1/1916_\354\265\234\354\206\214 \353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260.py" diff --git "a/JY_Park/season3/10/05-1/1916_\354\265\234\354\206\214 \353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260.py" "b/JY_Park/season3/10/05-1/1916_\354\265\234\354\206\214 \353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260.py" new file mode 100644 index 0000000..c0517eb --- /dev/null +++ "b/JY_Park/season3/10/05-1/1916_\354\265\234\354\206\214 \353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260.py" @@ -0,0 +1,35 @@ +import heapq +import sys +input = sys.stdin.readline +INF = int(1e9) + +n = int(input()) +m = int(input()) +graph = [[] for _ in range(n+1)] +distance = [INF] * (n+1) + +for _ in range(m): + # a -> b 가는 비용 c + a, b, c = map(int, input().split()) + graph[a].append((b,c)) + +start, end = map(int, input().split()) + + +def dijkstra(start): + q = [] + heapq.heappush(q, (0,start)) + distance[start] = 0 + while q: + dist, now = heapq.heappop(q) + if distance[now] < dist: + continue + for i in graph[now]: + cost = dist + i[1] + if cost < distance[i[0]]: + distance[i[0]] = cost + heapq.heappush(q, (cost, i[0])) + +dijkstra(start) + +print(distance[end]) \ No newline at end of file From 43cfa54001f40e20c0d519151c1d464a99119d4a Mon Sep 17 00:00:00 2001 From: parkjungyoon Date: Fri, 28 Oct 2022 20:46:35 +0900 Subject: [PATCH 2/2] =?UTF-8?q?[Baekjoon-1931]=20=ED=9A=8C=EC=9D=98?= =?UTF-8?q?=EC=8B=A4=20=EB=B0=B0=EC=A0=95?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...30\354\213\244\353\260\260\354\240\225.py" | 98 +++++++++++++++++++ 1 file changed, 98 insertions(+) create mode 100644 "JY_Park/season3/10/05-1/1931_\355\232\214\354\235\230\354\213\244\353\260\260\354\240\225.py" diff --git "a/JY_Park/season3/10/05-1/1931_\355\232\214\354\235\230\354\213\244\353\260\260\354\240\225.py" "b/JY_Park/season3/10/05-1/1931_\355\232\214\354\235\230\354\213\244\353\260\260\354\240\225.py" new file mode 100644 index 0000000..cbcc5a2 --- /dev/null +++ "b/JY_Park/season3/10/05-1/1931_\355\232\214\354\235\230\354\213\244\353\260\260\354\240\225.py" @@ -0,0 +1,98 @@ +# import sys +# input = sys.stdin.readline +# n = int(input()) +# time = [] +# for i in range(n): +# start, end = map(int,input().split()) +# time.append((start, end)) +# time_sort = sorted(time, key=lambda x:(x[1],x[0])) +# # print(time_sort) + +# end_time = time_sort[0][1] +# count = 1 +# for i in range(1, n): +# if end_time <= time_sort[i][0]: +# count+=1 +# end_time = time_sort[i][1] +# print(count) + +''' +[복습] 22.10.25 +''' + +# 시도1 +# import sys +# input = sys.stdin.readline + +# n = int(input()) +# time_table = [] +# for i in range(n): +# start, end = map(int,input().split()) +# time_table.append((start, end)) + +# time_table.sort() +# max_num = 0 +# for i in range(n): +# temp = time_table[i][1] +# count = 1 +# for j in range(i,n): +# if time_table[j][0] >= temp: +# count += 1 +# temp = time_table[j][1] + +# if count >= max_num: +# max_num = count + +# print(max_num) + + +import sys +input = sys.stdin.readline + +n = int(input()) +time_table = [] +for i in range(n): + start, end = map(int,input().split()) + time_table.append((start, end)) + +# 정렬 기준 : 시작 시간, 회의 시간이 짧은거 +# 다시 생각 : 빨리 끝날수록 최대 회의를 사용할 가능성 높아짐. + +# time_table.sort() +# time_table.sort(key = lambda x :(x[0], x[1]-x[0])) +time_table.sort(key = lambda x :(x[1], x[0])) +print(time_table) + +temp = time_table[0][1] +count = 1 +for i in range(1,n): + if time_table[i][0] >= temp: + count += 1 + temp = time_table[i][1] + +print(count) + +# 5%에서 시간 초과 +# import sys +# import heapq +# input = sys.stdin.readline + +# n = int(input()) +# time_table = [] +# for i in range(n): +# start, end = map(int,input().split()) +# heapq.heappush(time_table,(start, end)) + +# max_num = 0 +# for i in range(n): +# temp = time_table[i][1] +# count = 1 +# for j in range(i,n): +# if time_table[j][0] >= temp: +# count += 1 +# temp = time_table[j][1] + +# if count >= max_num: +# max_num = count +# print(time_table) +# print(max_num) \ No newline at end of file