제출 #1159899

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1159899		eliiasg	Drivers (BOI24_drivers)	Pypy 3	0 / 100	2108 ms	763476 KiB

Main

from heapq import *
N, M, U = map(int, input().split())
roads = sorted(tuple(reversed(list(map(int, input().split())))) for _ in range(M))[::-1]
Q = sorted(tuple(reversed(list(map(int, input().split())))) + (i,) for i in range(U))

parents = [-1]*(N+1)
out = [None]*U

def find(a):
    vis = [a]
    while parents[a] != -1:
        a = parents[a]
        vis.append(a)
    for e in vis[:-1]:
        parents[e] = a
    return a

for t, aq, bq, i in Q:
    while len(roads) > 0 and t >= roads[-1][0]:
        _, a, b = roads.pop()
        a = find(a)
        b = find(b)
        parents[a] = b
    
    aq = find(aq)
    bq = find(bq)
    out[i] = "TAIP" if aq == bq else "NE"

print("\n".join(out))

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

Compiling 'Main.py'...

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

=======

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