제출 #1283236

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1283236		dev_pandey20	Drivers (BOI24_drivers)	Pypy 3	0 / 100	2115 ms	512532 KiB

Main

INF = 10**9

def solve():
    N, M, U = map(int, input().split())
    dist = [[INF]*N for _ in range(N)]

    for i in range(N):
        dist[i][i] = 0  # distance to self is 0

    for _ in range(M):
        a, b, t = map(int, input().split())
        a -= 1
        b -= 1
        dist[a][b] = min(dist[a][b], t)
        dist[b][a] = min(dist[b][a], t)  # bidirectional

    # Floyd–Warshall to compute max edge on path
    for k in range(N):
        for i in range(N):
            for j in range(N):
                dist[i][j] = min(dist[i][j], max(dist[i][k], dist[k][j]))

    # process queries
    for _ in range(U):
        a, b, p = map(int, input().split())
        a -= 1
        b -= 1
        if dist[a][b] <= p:
            print("TAIP")
        else:
            print("NE")


if __name__ == "__main__":
    solve()

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 38%)

=======

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 23
• Subtask 5: 0 / 45