結果

問題 No.2387 Yokan Factory
ユーザー cleanttedcleantted
提出日時 2023-06-14 04:12:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,611 ms / 5,000 ms
コード長 3,628 bytes
コンパイル時間 303 ms
コンパイル使用メモリ 87,412 KB
実行使用メモリ 222,980 KB
最終ジャッジ日時 2023-09-06 01:05:11
合計ジャッジ時間 31,947 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 330 ms
99,320 KB
testcase_01 AC 332 ms
99,360 KB
testcase_02 AC 333 ms
99,104 KB
testcase_03 AC 335 ms
99,100 KB
testcase_04 AC 336 ms
99,360 KB
testcase_05 AC 337 ms
99,072 KB
testcase_06 AC 335 ms
99,324 KB
testcase_07 AC 333 ms
99,172 KB
testcase_08 AC 338 ms
99,108 KB
testcase_09 AC 330 ms
99,432 KB
testcase_10 AC 338 ms
99,464 KB
testcase_11 AC 337 ms
98,968 KB
testcase_12 AC 328 ms
99,332 KB
testcase_13 AC 336 ms
99,176 KB
testcase_14 AC 333 ms
99,348 KB
testcase_15 AC 1,322 ms
165,484 KB
testcase_16 AC 830 ms
153,164 KB
testcase_17 AC 1,923 ms
222,980 KB
testcase_18 AC 2,201 ms
168,056 KB
testcase_19 AC 1,550 ms
148,336 KB
testcase_20 AC 1,074 ms
136,872 KB
testcase_21 AC 2,238 ms
173,708 KB
testcase_22 AC 1,068 ms
133,744 KB
testcase_23 AC 2,293 ms
155,244 KB
testcase_24 AC 952 ms
130,188 KB
testcase_25 AC 1,215 ms
134,268 KB
testcase_26 AC 2,611 ms
167,620 KB
testcase_27 AC 1,182 ms
158,944 KB
testcase_28 AC 368 ms
101,536 KB
testcase_29 AC 397 ms
102,296 KB
testcase_30 AC 405 ms
102,956 KB
testcase_31 AC 396 ms
102,580 KB
testcase_32 AC 364 ms
100,964 KB
testcase_33 AC 367 ms
101,020 KB
testcase_34 AC 410 ms
102,836 KB
testcase_35 AC 400 ms
102,456 KB
testcase_36 AC 351 ms
100,620 KB
testcase_37 AC 331 ms
99,200 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# import bisect
import copy
import heapq
import itertools
import math
import operator
import random
import sys
from bisect import bisect, bisect_left, bisect_right, insort
from collections import Counter, deque
from fractions import Fraction
from functools import cmp_to_key, lru_cache, partial
from inspect import currentframe
from math import ceil, gcd, log10, pi, sqrt
from typing import Iterable, Iterator, List, Tuple, TypeVar, Union

# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
# import string
# import networkx as nx
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
# mod = 10 ** 9 + 7
mod = 998244353
# mod = 1 << 128
# mod = 10 ** 30 + 1
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]

def read_values(): return tuple(map(int, input().split()))
def read_index(): return tuple(map(lambda x: int(x) - 1, input().split()))
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]
def dprint(*values): print(*values, file=sys.stderr)
def dprint2(*values):
    names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}
    dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values))


class UnionFind:
    def __init__(self, N):
        self.state = [-1] * N
        self.rank = [0] * N
        self.num_group = N
    
    def get_parent(self, a):
        p = self.state[a]
        if p < 0:
            return a
        
        q = self.get_parent(p)
        self.state[a] = q
        return q

    def make_pair(self, a, b):
        pa = self.get_parent(a)
        pb = self.get_parent(b)
        if pa == pb:
            return

        if self.rank[pa] > self.rank[pb]:
            pa, pb = pb, pa
            a, b = b, a
        elif self.rank[pa] == self.rank[pb]:
            self.rank[pb] += 1

        self.state[pb] += self.state[pa]
        self.state[pa] = pb
        self.state[a] = pb
        self.num_group -= 1
    
    def is_pair(self, a, b):
        return self.get_parent(a) == self.get_parent(b)

    def get_size(self, a):
        return -self.state[self.get_parent(a)]


def validate(N, M, X, L):
    assert(1 <= N <= 2 * 10 ** 5)
    assert(1 <= M <= 2 * 10 ** 5)
    assert(1 <= X <= 10 ** 18)
    assert(len(L) == M)

    uf = UnionFind(N)
    for u, v, a, b in L:
        assert(1 <= u <= N)
        assert(1 <= v <= N)
        assert(1 <= a <= 10 ** 9)
        assert(1 <= b <= 10 ** 9)
        u -= 1
        v -= 1
        uf.make_pair(u, v)

    assert uf.get_size(0) == N
    assert uf.num_group == 1

def main():
    N, M, X = read_values() 
    L = read_lists(M)

    G = [[] for _ in range(N)]

    for u, v, a, b in L:
        u -= 1
        v -= 1
        G[u].append((b, v, a))
        G[v].append((b, u, a))
    for i in range(N):
        G[i].sort(reverse=True)

    def f(m):
        S = [(0, 0)]
        fixed = [False] * N
        D = [INF] * N
        D[0] = 0
        while S:
            c, i = heapq.heappop(S)
            if i == N - 1:
                break
            
            if fixed[i]:
                continue
            fixed[i] = True

            for b, j, a in G[i]:
                if m > b:
                    break

                if D[j] <= c + a:
                    continue
                D[j] = c + a
                heapq.heappush(S, (c + a, j))
        
        return D[N - 1] <= X

    l = -1
    r = 10 ** 9 + 10
    while r - l > 1:
        m = (l + r) // 2
        if f(m):
            l = m
        else:
            r = m

    print(l)


if __name__ == "__main__":
    main()
0