[박장우] 11주차 과제 제출합니다.

5월9일/14497/14497_python_박장우.py

@@ -0,0 +1,47 @@
+# 14497 주난의 난
+
+import sys
+from collections import deque
+input = sys.stdin.readline
+
+dx = [-1, 1, 0, 0]
+dy = [0, 0, -1, 1]
+
+
+n, m = map(int, input().split())
+graph = []
+vis = [[-1] * m for _ in range(n)]
+x1, y1, x2, y2 = map(int, input().split())
+res = 0
+
+for _ in range(n):
+ graph.append(list(map(str, input().strip())))
+
+
+def bfs(sx, sy):
+ q = deque()
+ q.append((sx, sy))
+ vis[sx][sy] = 0
+
+ while q:
+ x, y = q.popleft()
+
+ for i in range(4):
+ nx = x + dx[i]
+ ny = y + dy[i]
+
+ if (nx < 0 or ny < 0 or nx >= n or ny >= m) or vis[nx][ny] != -1:
+ continue
+
+ if graph[nx][ny] == '1' or graph[nx][ny] == '#':
+ vis[nx][ny] = vis[x][y] + 1
+ graph[nx][ny] = '0'
+ q.append((nx, ny))
+
+ elif graph[nx][ny] == '0':
+ vis[nx][ny] = vis[x][y]
+ q.appendleft((nx, ny))
+
+
+bfs(x1-1, y1-1)
+print(vis[x2-1][y2-1])

5월9일/14575/14575_python_박장우.py

@@ -0,0 +1,58 @@
+# 14575 뒤풀이
+import sys
+input = sys.stdin.readline
+INF = int(1e9)
+
+
+n, t = map(int, input().split())
+arr = []
+
+
+def is_possible(s):
+ # remain: 사람들이 최소 주량만큼 마신다 가정 했을 때 더 마실 수 있는 양
+ # min_sum: 모든 사람들의 최소 주량 합
+ remain, min_sum = 0, 0
+
+ for i in range(n):
+
+ if arr[i][0] > s:
+ return False
+
+ # remain = ((최대 주량 혹은 s값 중 작은 값) - (최소 주량)) 의 합
+ remain += (min(arr[i][1], s) - arr[i][0])
+ min_sum += arr[i][0]
+
+ # t - min_sum = 사람들이 더 마셔야 하는 양
+ if remain >= t - min_sum:
+ return True
+
+ return False
+
+
+left, right = 0, 0
+min_num, max_num = 0, 0
+res = INF
+
+for _ in range(n):
+ l, r = map(int, input().split())
+ min_num += l
+ max_num += r
+ right = max(right, r)
+ arr.append((l, r))
+
+# 불가능한 경우
+if min_num > t or max_num < t:
+ print(-1)
+ exit()
+
+
+while left <= right:
+ s = (left + right) // 2
+ if is_possible(s):
+ res = min(res, s)
+ right = s - 1
+ else:
+ left = s + 1
+
+
+print(res)

5월9일/1953/1953_python_박장우.py

@@ -0,0 +1,72 @@
+# 1953: 팀배분
+
+import sys
+from collections import deque
+input = sys.stdin.readline
+
+
+n = int(input())
+graph = [[] for _ in range(n+1)]
+vis = [0] * (n+1)
+
+# team[0] = 청팀, team[1] = 백팀
+team = [[] for _ in range(2)]
+
+for i in range(1, n+1):
+ data = list(map(int, input().split()))
+ for j in range(1, data[0]+1):
+ graph[i].append(data[j])
+
+
+def is_one_sided(arr):
+ if len(arr) == n:
+ print(n-1)
+ for i in range(n-1):
+ print(arr[i], end=' ')
+
+ print()
+ print(1)
+ print(arr[-1])
+ exit()
+
+
+def bfs(start):
+ q = deque()
+ q.append(start)
+ vis[start] = 1
+
+ while q:
+ cur = q.popleft()
+
+ for person in graph[cur]:
+ if vis[person] != 0:
+ continue
+
+ if vis[cur] == 1:
+ vis[person] = -1
+ elif vis[cur] == -1:
+ vis[person] = 1
+
+ q.append(person)
+
+
+for i in range(1, n+1):
+ if not vis[i]:
+ bfs(i)
+
+
+for i in range(1, n+1):
+ if vis[i] == 1:
+ team[0].append(i)
+ else:
+ team[1].append(i)
+
+team[0].sort()
+team[1].sort()
+
+
+is_one_sided(team[0])
+print(len(team[0]))
+print(*team[0])
+print(len(team[1]))
+print(*team[1])

5월9일/20313/20313_python_박장우.py

@@ -0,0 +1,65 @@
+# 20313: 출퇴근
+# 실패: 틀렸습니다가 계속 뜨는데 이유를 모르겠습니다.
+
+import sys
+import heapq
+input = sys.stdin.readline
+INF = int(1e9)
+
+
+n, m, a, b = map(int, input().split())
+graph = [[] for _ in range(n+1)]
+distance = [INF] * (n+1)
+road_info = [[] for _ in range(m)]
+res = INF
+
+
+for i in range(m):
+ u, v, t = map(int, input().split())
+ road_info[i].append((u, v))
+ graph[u].append((v, t))
+ graph[v].append((u, t))
+
+k = int(input())
+data = []
+for _ in range(k):
+ data.append(list(map(int, input().split())))
+
+
+def dijkstra(start):
+
+ q = []
+ heapq.heappush(q, (0, start))
+ distance[start] = 0
+
+ while q:
+
+ dist, cur = heapq.heappop(q)
+
+ if dist > distance[cur]:
+ continue
+
+ for node in graph[cur]:
+ cost = dist + node[1]
+
+ if cost < distance[node[0]]:
+ distance[node[0]] = cost
+ heapq.heappush(q, (cost, node[0]))
+
+
+dijkstra(a)
+res = min(res, distance[b])
+
+for i in range(k):
+ graph = [[] for _ in range(n+1)]
+ distance = [INF] * (n+1)
+ for j in range(m):
+ u, v, t = road_info[j][0][0], road_info[j][0][1], data[i][j]
+ graph[u].append((v, t))
+ graph[v].append((u, t))
+
+ dijkstra(a)
+ res = min(res, distance[b])
+
+
+print(res, end='')

5월9일/23888/23888_python_박장우.py

@@ -0,0 +1,33 @@
+# 23888 등차수열과 쿼리
+import sys
+input = sys.stdin.readline
+
+
+def gcd(a, b):
+ if a == 0:
+ return b
+
+ return gcd(b % a, a)
+
+
+a, d = map(int, input().split())
+q = int(input())
+for _ in range(q):
+ query, l, r = map(int, input().split())
+ a_l = a + (l - 1) * d
+
+ if query == 1:
+ s_l = (2 * a + (l - 1) * d) * l // 2
+ s_r = (2 * a + (r - 1) * d) * r // 2
+ print(s_r - s_l + a_l)
+
+ # 30점 받은 코드: int 형변환 문제?
+ # s_l = (2 * a + (l - 1) * d) * l / 2
+ # s_r = (2 * a + (r - 1) * d) * r / 2
+ # print(int(s_r - s_l) + a_l)
+
+ else:
+ if l == r:
+ print(a_l)
+ else:
+ print(gcd(a, d))