complete 1865.py and 13505.py

zeta_python/completed/13505.py

@@ -0,0 +1,53 @@
+import sys
+
+input = sys.stdin.readline
+
+
+def get_max_xor(N, S):
+    trie = [[0, 0] for _ in range(3000000)]
+
+    cnt = 0
+    for s in S:
+        idx = 0
+        for b in s:
+            b = int(b)
+            if trie[idx][b]:
+                idx = trie[idx][b]
+            else:
+                trie[idx][b] = cnt + 1
+                idx = cnt + 1
+                cnt += 1
+    n = []
+    D = [(0, 0, 0, 0)]
+    while D:
+        depth, idx1, idx2, xor = D.pop()
+        if depth == 30:
+            n.append(xor)
+
+        flag = False
+
+        if trie[idx1][0] and trie[idx2][1]:
+            D.append(
+                (depth + 1, trie[idx1][0], trie[idx2][1], xor + (1 << (29 - depth)))
+            )
+            flag = True
+        if trie[idx1][1] and trie[idx2][0]:
+            D.append(
+                (depth + 1, trie[idx1][1], trie[idx2][0], xor + (1 << (29 - depth)))
+            )
+            flag = True
+
+        if flag:
+            continue
+
+        if trie[idx1][0] and trie[idx2][0]:
+            D.append((depth + 1, trie[idx1][0], trie[idx2][0], xor))
+        if trie[idx1][1] and trie[idx2][1]:
+            D.append((depth + 1, trie[idx1][1], trie[idx2][1], xor))
+    return max(n)
+
+
+if __name__ == "__main__":
+    N = int(input())
+    S = list(map(lambda x: format(int(x), "b").zfill(30), input().split()))
+    print(get_max_xor(N, S))

zeta_python/completed/1865.py

@@ -0,0 +1,35 @@
+import sys
+
+input = sys.stdin.readline
+
+INF = 1 << 30
+
+
+def bellman_ford(N, E, start=1):
+    dist = [INF] * (N + 1)
+    parent = [0] * (N + 1)
+
+    dist[start] = 0
+    for _ in range(1, N + 1):
+        for u, v, w in E:
+            if dist[u] + w < dist[v]:
+                dist[v] = dist[u] + w
+                parent[v] = u
+
+    for u, v, w in E:
+        if dist[u] + w < dist[v]:
+            return -INF
+    return dist[N]
+
+
+if __name__ == "__main__":
+    T = int(input())
+    for _ in range(T):
+        N, M, W = map(int, input().split())
+        E = []
+        for s, e, w in [map(int, input().split()) for _ in range(M)]:
+            E.append((s, e, w))
+            E.append((e, s, w))
+        for s, e, w in [map(int, input().split()) for _ in range(W)]:
+            E.append((s, e, -w))
+        print("YES" if bellman_ford(N, E) < 0 else "NO")