# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22851 | 이대회 트래쉬 대회에야옹 (#40) | Logistical Metropolis (KRIII5_LM) | Cpython 3 | 2058 ms | 84 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
import heapq
import time
class Edge():
def __init__(self, st, ed, v):
self.st = st
self.ed = ed
self.value = v
def __gt__(self, e2):
return self.value < e2.value
def __lt__(self, e2):
return self.value > e2.value
def __le__(self, e2):
return self.__lt__(e2) or self.__eq__(e2)
def __eq__(self, e2):
return self.value == e2.value
def __ne__(self, e2):
return not self.__eq__(e2)
def __ge__(self, e2):
return self.__gt__(e2) or self.__eq__(e2)
def __repr__(self):
return "(%d -> %d / %d)" % (self.st, self.ed, self.value)
N, M = map(lambda x: int(x), input().split(' '))
edge = []
for i in range(0, M):
a, b, k = map(lambda x: int(x), input().split(' '))
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |