add files

Author: wSangbae

week16/bsw/13116_30번.py

@@ -0,0 +1,29 @@
+import sys
+input = sys.stdin.readline
+# input이 5만개라 readline 쓰는게 효율적일듯
+
+T = int(input())
+
+tree = {}
+
+for i in range(1, 1024):
+    tree[i] = i//2
+
+#print(tree)
+for _ in range(T):
+    a, b = map(int, input().split())
+    answer = 0
+
+    ans_a = set()
+    ans_b = set()
+
+    while a in tree:
+        ans_a.add(a)
+        a = tree[a]
+
+    while b in tree:
+        ans_b.add(b)
+        b = tree[b]
+
+    print(max(ans_a & ans_b)*10)
+    

week16/bsw/17836_공주님을 구해라.py

@@ -0,0 +1,45 @@
+N,M,T = map(int, input().split())
+INF = 1e9
+graph = [list(map(int, input().split())) for _ in range(N)]
+times = [[INF for _ in range(M)] for _ in range(N)]
+times[0][0] = 0
+# print(times)
+# print('')
+
+from collections import deque
+q=deque()
+
+# r, c
+q.append((0, 0))
+answer2=1e9
+while q:
+    r, c = q.popleft()
+
+    for dr, dc in (1,0), (0,1), (-1,0), (0,-1):
+        nr, nc = r + dr, c + dc
+
+        if 0<=nr<N and 0<=nc<M:
+
+            if times[nr][nc] != 1e9:
+                continue
+
+            if graph[nr][nc] == 1:
+                continue
+            
+            # 칼
+            if graph[nr][nc] == 2:
+                answer2 = times[r][c] + 1 + ((N-1)-nr) + ((M-1)-nc)
+            
+
+            q.append((nr,nc))
+            times[nr][nc] = times[r][c] + 1
+
+# print(graph)
+# print(times)
+
+times[N-1][M-1] = min(times[N-1][M-1], answer2)
+
+if times[N-1][M-1] > T:
+    print('Fail')
+else:
+    print(times[N-1][M-1])

week16/bsw/9205_맥주 마시면서 걸어가기.py

@@ -0,0 +1,67 @@
+from collections import deque
+import sys
+input = sys.stdin.readline
+
+T = int(input())
+
+def check(x1, y1, x2, y2):
+    if abs(x1 - x2) + abs(y1 - y2) > 1000:
+        return False
+    elif abs(x1 - x2) + abs(y1 - y2) <= 1000:
+        return True
+
+for _ in range(T):
+    n = int(input())
+
+    point = []
+    graph = {}
+    
+    #정점
+    for _ in range(n+2):
+        x, y = map(int, input().split())
+        point.append((x,y))
+
+    for i in range(n+2):
+        x1, y1 = point[i]
+        for j in range(n+2):
+            if i==j:
+                continue
+            x2, y2 = point[j]
+
+            if check(x1, y1, x2, y2):
+                if not (x1, y1) in graph:
+                    graph[(x1, y1)] = []
+                graph[(x1, y1)].append((x2, y2))
+
+    
+    q = deque()
+    visited = {}
+
+    q.append(point[0])
+    for p in point:
+        visited[p] = 0
+    visited[point[0]] = 1
+
+    while q:
+        x, y = q.popleft()
+
+        if (x, y) not in graph:
+            continue
+        for nx, ny in graph[(x, y)]:
+            if visited[(nx, ny)] == 1:
+                continue
+            q.append((nx, ny))
+            visited[(nx, ny)] = 1
+
+    if visited[point[-1]] == 1:
+        print('happy')
+    elif visited[point[-1]] == 0:
+        print('sad')
+
+
+            
+
+
+
+
+