|
| 1 | +import math |
| 2 | +import sys |
| 3 | + |
| 4 | +read = lambda: sys.stdin.readline().rstrip() |
| 5 | + |
| 6 | + |
| 7 | +class Problem: |
| 8 | + def __init__(self): |
| 9 | + self.n, self.m, self.w = map(int, read().split()) |
| 10 | + self.graph, self.visited = [], set() |
| 11 | + |
| 12 | + for _ in range(self.m): |
| 13 | + src, dest, time = map(int, read().split()) |
| 14 | + self.graph.append((src - 1, dest - 1, time)) |
| 15 | + self.graph.append((dest - 1, src - 1, time)) |
| 16 | + |
| 17 | + for _ in range(self.w): |
| 18 | + src, dest, time = map(int, read().split()) |
| 19 | + self.graph.append((src - 1, dest - 1, -time)) |
| 20 | + |
| 21 | + def solve(self) -> None: |
| 22 | + for node in range(self.n): |
| 23 | + if node not in self.visited and self.bellman_ford(node): |
| 24 | + print("YES") |
| 25 | + return |
| 26 | + |
| 27 | + print("NO") |
| 28 | + |
| 29 | + def bellman_ford(self, node: int) -> bool: |
| 30 | + distances = [0 if node == idx else math.inf for idx in range(self.n)] |
| 31 | + |
| 32 | + for idx in range(self.n): |
| 33 | + updated = False |
| 34 | + for src, dest, time in self.graph: |
| 35 | + if distances[src] != math.inf and distances[dest] > distances[src] + time: |
| 36 | + distances[dest] = distances[src] + time |
| 37 | + self.visited |= {src, dest} |
| 38 | + updated = True |
| 39 | + |
| 40 | + if idx == self.n - 1: |
| 41 | + return True |
| 42 | + |
| 43 | + if not updated: |
| 44 | + return False |
| 45 | + |
| 46 | + return False |
| 47 | + |
| 48 | + |
| 49 | +if __name__ == "__main__": |
| 50 | + for _ in range(int(read())): |
| 51 | + Problem().solve() |
0 commit comments