https://leetcode.com/problems/rotate-image/description/코드from copy import deepcopyclass Solution: def rotate(self, matrix: List[List[int]]) -> None: n = len(matrix) max_depth = n//2 for depth in range(max_depth+1): length = n-depth*2-1 # 위쪽 저장 top = deepcopy(matrix[depth][depth+1:n-depth]) # 왼 -> 위 for i in range(leng..
전체 글
https://www.acmicpc.net/problem/1039코드from collections import deque, defaultdictn, k = input().split()n_len = len(n)k = int(k)q = deque([(n, 0)])visited = defaultdict(set)visited[n].add(0)answer = -1while q: now, cnt = q.popleft() if cnt == k: answer = max(int(now), answer) continue for i in range(n_len-1): for j in range(i+1, n_len): if (i == 0 and now[j..
https://www.acmicpc.net/problem/1946코드from heapq import heappop, heappushimport sysinput = sys.stdin.readlinefor _ in range(int(input())): n = int(input()) applicants = [] for _ in range(n): doc, interview = map(int, input().split()) heappush(applicants, (doc, interview)) answer = 1 comp_interview = heappop(applicants)[1] while applicants: now = heappop(app..
https://www.acmicpc.net/problem/10423코드from heapq import heappop, heappushimport sysinput = sys.stdin.readlinen, m, k = map(int, input().split())power_stations = set(map(int, input().split()))parent = [i for i in range(n+1)]def find_parent(x): if x != parent[x]: parent[x] = find_parent(parent[x]) return parent[x]def union(a, b): a = find_parent(a) b = find_parent(b) if a ==..
https://www.acmicpc.net/problem/22868코드from collections import dequeimport sysinput = sys.stdin.readlinen, m = map(int, input().split())graph = [[] for _ in range(n+1)]for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) graph[b].append(a)for i in range(1, n+1): graph[i].sort()s, e = map(int, input().split())def bfs(excludes): q = deque([[s]]) visited = [False..
https://www.acmicpc.net/problem/17208코드import sysinput = sys.stdin.readlinen, m, k = map(int, input().split())orders = []for _ in range(n): x, y = map(int, input().split()) orders.append((x, y))dp = [[[0]*(k+1) for _ in range(m+1)] for _ in range(n+1)]answer = 0for order_idx in range(1, n+1): now_burger, now_fry = orders[order_idx-1] for burger in range(m+1): for fry in range(..
