Github & Portfolio
๐ Problem Solving(119)
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv3] ๋ฑ๊ตฃ๊ธธ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๋ฑ๊ตฃ๊ธธ ๊ณ์๋๋ ํญ์ฐ๋ก ์ผ๋ถ ์ง์ญ์ด ๋ฌผ์ ์ ๊ฒผ์ต๋๋ค. ๋ฌผ์ ์ ๊ธฐ์ง ์์ ์ง์ญ์ ํตํด ํ๊ต๋ฅผ ๊ฐ๋ ค๊ณ ํฉ๋๋ค. ์ง์์ ํ๊ต๊น์ง ๊ฐ๋ ๊ธธ์ m x n ํฌ๊ธฐ์ ๊ฒฉ์๋ชจ์์ผ๋ก ๋ํ๋ผ ์ ์์ต๋๋ค. ์๋ ๊ทธ๋ฆผ์ m = programmers.co.kr import sys input = sys.stdin.readline m, n = map(int, input().split()) puddles = [list(map(int, input().split())) for _ in range(int(input()))] def solution(m, n, puddles): d = [[0] * (m + 1) for _ in range(n + 1)] d[1][1] = 1 for i in range(1, n + 1): f..
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv3] ์ด์ค์ฐ์ ์์ํ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ์ด์ค์ฐ์ ์์ํ programmers.co.kr import sys import heapq input = sys.stdin.readline operations = [input().rstrip() for _ in range(int(input()))] def solution(operations): q = [] for s in operations: oper, num = s.split()[0], int(s.split()[1]) if oper == "I": heapq.heappush(q, num) elif q and oper == "D": if num == 1: q.pop() else: heapq.heappop(q) if len(q) == 0: return [0, 0] return [max(q)..
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv3] ๊ฐ์ฅ ๋จผ ๋ ธ๋ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๊ฐ์ฅ ๋จผ ๋ ธ๋ 6 [[3, 6], [4, 3], [3, 2], [1, 3], [1, 2], [2, 4], [5, 2]] 3 programmers.co.kr import sys from collections import deque input = sys.stdin.readline n = int(input()) vertex = [list(map(int, input().split())) for _ in range(int(input()))] def getDistance(start, graph, distance): queue = deque() queue.append(start) while queue: x = queue.popleft() for i in graph[x]: if i == 1: con..
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv3] ๋คํธ์ํฌ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๋คํธ์ํฌ ๋คํธ์ํฌ๋ ์ปดํจํฐ ์ํธ ๊ฐ์ ์ ๋ณด๋ฅผ ๊ตํํ ์ ์๋๋ก ์ฐ๊ฒฐ๋ ํํ๋ฅผ ์๋ฏธํฉ๋๋ค. ์๋ฅผ ๋ค์ด, ์ปดํจํฐ A์ ์ปดํจํฐ B๊ฐ ์ง์ ์ ์ผ๋ก ์ฐ๊ฒฐ๋์ด์๊ณ , ์ปดํจํฐ B์ ์ปดํจํฐ C๊ฐ ์ง์ ์ ์ผ๋ก ์ฐ๊ฒฐ๋์ด ์ programmers.co.kr import sys from collections import deque input = sys.stdin.readline n = int(input()) compters = [list(map(int, input().split())) for _ in range(n)] def bfs(n, computers, v, visited): queue = deque() queue.append(v) visited[v] = True while queue: x = queue.p..
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv3] ๋์คํฌ ์ปจํธ๋กค๋ฌ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๋์คํฌ ์ปจํธ๋กค๋ฌ ํ๋๋์คํฌ๋ ํ ๋ฒ์ ํ๋์ ์์ ๋ง ์ํํ ์ ์์ต๋๋ค. ๋์คํฌ ์ปจํธ๋กค๋ฌ๋ฅผ ๊ตฌํํ๋ ๋ฐฉ๋ฒ์ ์ฌ๋ฌ ๊ฐ์ง๊ฐ ์์ต๋๋ค. ๊ฐ์ฅ ์ผ๋ฐ์ ์ธ ๋ฐฉ๋ฒ์ ์์ฒญ์ด ๋ค์ด์จ ์์๋๋ก ์ฒ๋ฆฌํ๋ ๊ฒ์ ๋๋ค. ์๋ฅผ programmers.co.kr import sys import heapq input = sys.stdin.readline jobs = [list(map(int, input().split())) for _ in range(int(input()))] def solution(jobs): answer, now, i = 0, 0, 0 start = -1 q = [] while i < len(jobs): for job in jobs: if start < job[0]
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv3] ๋ฒ ์คํธ์จ๋ฒ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๋ฒ ์คํธ์จ๋ฒ ์คํธ๋ฆฌ๋ฐ ์ฌ์ดํธ์์ ์ฅ๋ฅด ๋ณ๋ก ๊ฐ์ฅ ๋ง์ด ์ฌ์๋ ๋ ธ๋๋ฅผ ๋ ๊ฐ์ฉ ๋ชจ์ ๋ฒ ์คํธ ์จ๋ฒ์ ์ถ์ํ๋ ค ํฉ๋๋ค. ๋ ธ๋๋ ๊ณ ์ ๋ฒํธ๋ก ๊ตฌ๋ถํ๋ฉฐ, ๋ ธ๋๋ฅผ ์๋กํ๋ ๊ธฐ์ค์ ๋ค์๊ณผ ๊ฐ์ต๋๋ค. ์ํ ๋ ธ๋๊ฐ programmers.co.kr import sys from collections import defaultdict input = sys.stdin.readline genres = list(map(str, input().split())) plays = list(map(int, input().split())) def solution(genres, plays): answer = [] genresPlays = defaultdict(int) genresSongs = defaultdict(lambda..