add greens

Author: IsHYuhi

ABC/ABC070/D.py

@@ -0,0 +1,70 @@
+import heapq
+
+class Edge():
+    def __init__(self, to, cost):
+        self.to = to
+        self.cost = cost
+
+class Pair():
+    def __init__(self, first, second):
+        #first: 最短距離, second: 頂点番号
+        self.first = first
+        self.second = second
+
+    def __lt__(self, other):
+        return (self.first ,self.second) < (other.first, other.second)
+
+def dijkstra(s):
+    heapq.heapify(que)
+    d[s] = 0
+    heapq.heappush(que, Pair(0, s))
+
+    while que:
+        p = heapq.heappop(que)
+        v = p.second
+        if d[v] < p.first:
+            continue
+        for i in range(len(G[v])):
+            e = G[v][i]
+            if d[e.to] > d[v] + e.cost:
+                d[e.to] = d[v] + e.cost
+                heapq.heappush(que, Pair(d[e.to], e.to))
+
+n = int(input())
+G = [[] for _ in range(n)]
+for i in range(n-1):
+    v, to, c = map(int, input().split())
+    G[v-1].append(Edge(to-1, c))
+    G[to-1].append(Edge(v-1, c))
+
+q, k = map(int, input().split())
+xy = [list(map(int, input().split())) for _ in range(q)]
+
+d = [float('inf')]*n
+que = []
+dijkstra(k-1)
+
+for x, y in xy:
+    print(d[x-1]+d[y-1])
+
+
+'''using warshall-floyd is going to be TLE because of O(n^3)'''
+# n = int(input())
+
+# d = [[float('inf')]*n for _ in range(n)]
+# for i in range(n-1):
+#     a, b, c = map(int, input().split())
+#     d[a-1][b-1] = c
+#     d[b-1][a-1] = c
+
+# for k in range(n):
+#     for i in range(n):
+#         for j in range(n):
+#             if d[i][k]!=float('inf') and d[k][i]!=float('inf'):
+#                 d[i][j] = min(d[i][j], d[i][k] + d[k][j])
+
+# q, k = map(int, input().split())
+# xy = [list(map(int, input().split())) for _ in range(q)]
+
+# for x, y in xy:
+#     print(d[x-1][k-1]+d[k-1][y-1])

ABC/ABC071/D.py

@@ -0,0 +1,39 @@
+n = int(input())
+s =[list(input()) for _ in range(2)]
+mod = 10**9 + 7
+if s[0][0] == s[1][0]:
+    start = 1
+    ans = 3
+else:
+    start = 2
+    ans = 6
+
+i = start
+while i < n:
+    #check this position
+    if s[0][i]==s[1][i]:
+        v = 1
+        j = 1
+    else:
+        v = 0
+        j = 2
+
+    #check left
+    if s[0][i-1] == s[1][i-1]:
+        lv = 1
+    else:
+        lv = 0
+
+    if v == 1 and lv == 1:
+        ans *= 2
+    if v == 1 and lv == 0:
+        ans *= 1
+    if v == 0 and lv == 1:
+        ans *= 2
+    if v == 0 and lv == 0:
+        ans *= 3
+
+    ans %= mod
+    i += j
+
+print(ans)

README.md

@@ -8,7 +8,7 @@ AtCoderの問題をpython3で解いたものになります。AC確認は行っ
 ## [AtCoder Beginner Contest](ABC)
 | Problem A | Problem B | Problem C | Problem D | Problem E | Problem F |
 |:---:|:---:|:---:|:---:|:---:|:---:|
-|183/183  <img align="center" src="https://img.shields.io/badge/Completed!-green?style=for-the-badge"/>|183/183  <img align="center" src="https://img.shields.io/badge/Completed!-green?style=for-the-badge"/>|162/183|56/177|4/58|0/58|
+|183/183  <img align="center" src="https://img.shields.io/badge/Completed!-green?style=for-the-badge"/>|183/183  <img align="center" src="https://img.shields.io/badge/Completed!-green?style=for-the-badge"/>|162/183|58/177|4/58|0/58|
 
 
 ### ABC001 - ABC041
@@ -68,8 +68,8 @@ AtCoderの問題をpython3で解いたものになります。AC確認は行っ
 |[ABC067](ABC/ABC067)|[&check;](ABC/ABC067/A.py)|[&check;](ABC/ABC067/B.py)|[&check;](ABC/ABC067/C.py)|||[ABC109](ABC/ABC109)|[&check;](ABC/ABC109/A.py)|[&check;](ABC/ABC109/B.py)|[&check;](ABC/ABC109/C.py)||
 |[ABC068](ABC/ABC068)|[&check;](ABC/ABC068/A.py)|[&check;](ABC/ABC068/B.py)|[&check;](ABC/ABC068/C.py)|||[ABC110](ABC/ABC110)|[&check;](ABC/ABC110/A.py)|[&check;](ABC/ABC110/B.py)|[&check;](ABC/ABC110/C.py)||
 |[ABC069](ABC/ABC069)|[&check;](ABC/ABC069/A.py)|[&check;](ABC/ABC069/B.py)|[&check;](ABC/ABC069/C.py)|[&check;](ABC/ABC069/D.py)||[ABC111](ABC/ABC111)|[&check;](ABC/ABC111/A.py)|[&check;](ABC/ABC111/B.py)|[&check;](ABC/ABC111/C.py)||
-|[ABC070](ABC/ABC070)|[&check;](ABC/ABC070/A.py)|[&check;](ABC/ABC070/B.py)|[&check;](ABC/ABC070/C.py)|||[ABC112](ABC/ABC112)|[&check;](ABC/ABC112/A.py)|[&check;](ABC/ABC112/B.py)|[&check;](ABC/ABC112/C.py)||
-|[ABC071](ABC/ABC071)|[&check;](ABC/ABC071/A.py)|[&check;](ABC/ABC071/B.py)|[&check;](ABC/ABC071/C.py)|||[ABC113](ABC/ABC113)|[&check;](ABC/ABC113/A.py)|[&check;](ABC/ABC113/B.py)|[&check;](ABC/ABC113/C.py)||
+|[ABC070](ABC/ABC070)|[&check;](ABC/ABC070/A.py)|[&check;](ABC/ABC070/B.py)|[&check;](ABC/ABC070/C.py)|[&check;](ABC/ABC070/D.py)||[ABC112](ABC/ABC112)|[&check;](ABC/ABC112/A.py)|[&check;](ABC/ABC112/B.py)|[&check;](ABC/ABC112/C.py)||
+|[ABC071](ABC/ABC071)|[&check;](ABC/ABC071/A.py)|[&check;](ABC/ABC071/B.py)|[&check;](ABC/ABC071/C.py)|[&check;](ABC/ABC071/D.py)||[ABC113](ABC/ABC113)|[&check;](ABC/ABC113/A.py)|[&check;](ABC/ABC113/B.py)|[&check;](ABC/ABC113/C.py)||
 |[ABC072](ABC/ABC072)|[&check;](ABC/ABC072/A.py)|[&check;](ABC/ABC072/B.py)|[&check;](ABC/ABC072/C.py)|[&check;](ABC/ABC072/D.py)||[ABC114](ABC/ABC114)|[&check;](ABC/ABC114/A.py)|[&check;](ABC/ABC114/B.py)|[&check;](ABC/ABC114/C.py)||
 |[ABC073](ABC/ABC073)|[&check;](ABC/ABC073/A.py)|[&check;](ABC/ABC073/B.py)|[&check;](ABC/ABC073/C.py)|||[ABC115](ABC/ABC115)|[&check;](ABC/ABC115/A.py)|[&check;](ABC/ABC115/B.py)|[&check;](ABC/ABC115/C.py)||
 |[ABC074](ABC/ABC074)|[&check;](ABC/ABC074/A.py)|[&check;](ABC/ABC074/B.py)||||[ABC116](ABC/ABC116)|[&check;](ABC/ABC116/A.py)|[&check;](ABC/ABC116/B.py)|[&check;](ABC/ABC116/C.py)||