[코드트리] 2n개 중에 n개의 숫자를 적절하게 고르기 Python
# n, m 입력 n, m = map(int, input().split()) # points points = [ tuple(map(int, input().split())) for _ in range(n) ] # calc(curr_comb) def calc(curr_comb): # max_dist max_dist = 0 for i in range(m-1): for j in range(i+1, m): # x1, y1, x2, y2 unpacking x1, y1 = curr_comb[i] x2, y2 = curr_comb[j] # curr_dist curr_dist = (x1 - x2) ** 2 + (y1 - y2) ** 2 # max_dist update max_dist = max(max_dist, curr..
2023. 2. 3.
[코드트리] 단순한 동전 챙기기 Python
# n 입력 n = int(input()) # grid 입력 grid = [ input() for _ in range(n) ] # 함수들 # get_min_dist(curr_comb) def get_min_dist(curr_comb): # num_1, num_2, num_3 num_1, num_2, num_3 = curr_comb[0], curr_comb[1], curr_comb[2] # grid를 돌면서 for i in range(n): for j in range(n): # 'S'를 찾으면, if grid[i][j] == 'S': # sx, sy 기록 sx, sy = i, j # 'E'를 찾으면, elif grid[i][j] == 'E': # ex, ey 기록 ex, ey = i, j # num_1을 ..
2023. 2. 1.
[코드트리] 합쳐지는 구슬들 Python
# n, m, t 입력 n, m, t = map(int, input().split()) # grid grid = [ [[] for _ in range(n)] for _ in range(n) ] # mapper mapper = { 'U':0, 'R':1, 'D':2, 'L':3 } for i in range(1, m+1): # r, c, d, w 입력 r, c, d, w = input().split() r, c, w = int(r)-1, int(c)-1, int(w) grid[r][c].append([i, mapper[d], w]) # 함수들 # get_new(x, y) def get_new(x, y): # max_num, sum_weight max_num, sum_weight = 0, 0 # 겹친 구슬 ..
2023. 1. 26.