2021.01.04

Author: seono

python/plat5/1948.py

@@ -0,0 +1,39 @@
+import sys
+input = sys.stdin.readline
+n = int(input())
+m = int(input())
+adj_f = [[] for _ in range(n+1)]
+adj_b = [[] for _ in range(n+1)]
+visited = [False]*(n+1)
+indegree = [0]*(n+1)
+for _ in range(m):
+    a,b,c = map(int,input().split())
+    adj_f[a].append([b,c])
+    adj_b[b].append([a,c])
+    indegree[b]+=1
+dist = [0]*(n+1)
+
+start,end = map(int,input().split())
+
+st = [start]
+while st:
+    n = st.pop()
+    for nx, c in adj_f[n]:
+        if dist[nx]<dist[n]+c:
+            dist[nx]=dist[n]+c
+        indegree[nx]-=1
+        if indegree[nx]==0:
+            st.append(nx)
+ans = 0
+print(dist[end])
+st = [end]
+while st:
+    n = st.pop()
+    dis = dist[n]
+    for i,c in adj_b[n]:
+        if dis == dist[i]+c:
+            ans+=1
+            if not visited[i]:
+                visited[i]=True
+                st.append(i)
+print(ans)

python/plat5/2842.py

@@ -0,0 +1,81 @@
+import sys
+from collections import deque
+input = sys.stdin.readline
+
+dx = [1, -1, 0, 0, 1, 1, -1, -1]
+dy = [0, 0, 1, -1, 1, -1, 1, -1]
+
+def bfs(l,r):
+    st = deque()
+    visited = [[False]*(p) for _ in range(p)]
+    visited[sty][stx]=True
+    st.append([sty,stx])
+    while st:
+        y,x = st.popleft()
+        for i in range(8):
+            ny,nx = y+dy[i],x+dx[i]
+            if ny<0 or ny>=p or nx<0 or nx>=p:continue
+            if visited[ny][nx]:continue
+            if l<=arr2[ny][nx]<=r:
+                visited[ny][nx]=True
+                st.append([ny,nx])
+    for y,x in start_list:
+        if not visited[y][x]:return False
+    return True
+
+p = int(input())
+arr = []
+start_list = []
+for i in range(p):
+    temp = list(input().strip())
+    for j,t in enumerate(temp):
+        if t=='K' or t=='P':
+            start_list.append([i,j])
+    arr.append(temp)
+sty,stx=start_list[0]
+
+arr2 = []
+
+temp_set = set()
+for _ in range(p):
+    temp = list(map(int,input().split()))
+    for t in temp:
+        temp_set.add(t)
+    arr2.append(temp)
+
+temp_list = sorted(temp_set)
+l_min = temp_list[0]
+r_max = temp_list[-1]
+
+l_max, r_min = sys.maxsize, 0
+
+for y,x in start_list:
+    l_max = min(l_max,arr2[y][x])
+    r_min = max(r_min,arr2[y][x])
+
+left_list = []
+right_list = []
+
+for k in temp_list:
+    if l_min<=k<=l_max:
+        left_list.append(k)
+    if r_min<=k<=r_max:
+        right_list.append(k)
+
+left=right=0
+ans = sys.maxsize
+l_flag,r_flag = 0,0
+while left<len(left_list) and right<len(right_list):
+    if bfs(left_list[left],right_list[right]):
+        ans = min(ans,right_list[right]-left_list[left])
+        left+=1
+        l_flag=1
+    else:
+        if l_flag and r_flag:
+            left+=1;right+=1
+            l_flag=0
+            r_flag=0
+        else:
+            r_flag=1
+            right+=1
+print(ans)

python/plat5/5719.py

@@ -0,0 +1,48 @@
+import sys
+import heapq
+input = sys.stdin.readline
+
+while True:
+    N, M = map(int,input().split())
+    if N==0 and M==0:break
+    start, end = map(int,input().split())
+
+    adj_f = [[] for _ in range(N+1)]
+    adj_b = [[] for _ in range(N+1)]
+    for _ in range(M):
+        a,b,c = map(int,input().split())
+        adj_f[a].append([b,c])
+        adj_b[b].append([a,c])
+    st = [[0,start]]
+    dist = [sys.maxsize]*(N+1)
+    dist[start]=0
+    ans = 0
+    while st:
+        dis, n = heapq.heappop(st)
+        for i,c in adj_f[n]:
+            if dist[i]>dist[n]+c:
+                dist[i]=dist[n]+c
+                heapq.heappush(st,[dist[i],i])
+    st = [end]
+    visited = [False]*(N+1)
+    while st:
+        n = st.pop()
+        for i,c in adj_b[n]:
+            if dist[n]==dist[i]+c:
+                for idx in range(len(adj_f[i])):
+                    if adj_f[i][idx][0]==n:
+                        adj_f[i].pop(idx)
+                        break
+                if not visited[i]:
+                    visited[i]=True
+                    st.append(i)
+    dist = [sys.maxsize]*(N+1)
+    dist[start] = 0
+    st = [[0,start]]
+    while st:
+        dis, n = heapq.heappop(st)
+        for i,c in adj_f[n]:
+            if dist[i]>dist[n]+c:
+                dist[i]=dist[n]+c
+                heapq.heappush(st,[dist[i],i])
+    print(dist[end] if dist[end]!=sys.maxsize else -1)