結果

問題 No.654 Air E869120
ユーザー ygd.ygd.
提出日時 2022-03-06 21:25:42
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 268 ms / 2,000 ms
コード長 6,159 bytes
コンパイル時間 941 ms
コンパイル使用メモリ 86,924 KB
実行使用メモリ 93,408 KB
最終ジャッジ日時 2023-09-28 12:51:44
合計ジャッジ時間 10,720 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 178 ms
80,344 KB
testcase_01 AC 171 ms
80,592 KB
testcase_02 AC 170 ms
80,536 KB
testcase_03 AC 173 ms
80,456 KB
testcase_04 AC 173 ms
80,532 KB
testcase_05 AC 178 ms
80,384 KB
testcase_06 AC 179 ms
80,584 KB
testcase_07 AC 178 ms
80,436 KB
testcase_08 AC 172 ms
80,516 KB
testcase_09 AC 171 ms
80,592 KB
testcase_10 AC 268 ms
93,408 KB
testcase_11 AC 251 ms
89,888 KB
testcase_12 AC 242 ms
90,536 KB
testcase_13 AC 249 ms
90,364 KB
testcase_14 AC 242 ms
89,160 KB
testcase_15 AC 246 ms
91,948 KB
testcase_16 AC 212 ms
82,508 KB
testcase_17 AC 209 ms
82,748 KB
testcase_18 AC 214 ms
82,640 KB
testcase_19 AC 214 ms
82,888 KB
testcase_20 AC 208 ms
82,688 KB
testcase_21 AC 213 ms
82,936 KB
testcase_22 AC 201 ms
82,472 KB
testcase_23 AC 212 ms
82,356 KB
testcase_24 AC 214 ms
82,860 KB
testcase_25 AC 202 ms
82,544 KB
testcase_26 AC 203 ms
82,612 KB
testcase_27 AC 200 ms
82,712 KB
testcase_28 AC 206 ms
82,316 KB
testcase_29 AC 207 ms
82,528 KB
testcase_30 AC 194 ms
82,024 KB
testcase_31 AC 194 ms
82,068 KB
testcase_32 AC 191 ms
82,176 KB
testcase_33 AC 185 ms
81,988 KB
testcase_34 AC 187 ms
82,204 KB
testcase_35 AC 169 ms
80,524 KB
testcase_36 AC 169 ms
80,588 KB
testcase_37 AC 174 ms
80,544 KB
testcase_38 AC 175 ms
80,620 KB
testcase_39 AC 174 ms
80,640 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache, total_ordering
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
    
# Reference:
#   <https://github.com/not522/ac-library-python/blob/master/atcoder/maxflow.py>
#     (commit hash: ed8c83d91c544bcfb600d3414899b8c01c268c9c)
################################################################################
from typing import NamedTuple, Optional, List, cast

class MFGraph:
    class Edge(NamedTuple):
        src: int
        dst: int
        cap: int
        flow: int
    class _Edge:
        def __init__(self, dst: int, cap: int) -> None:
            self.dst = dst
            self.cap = cap
            self.rev: Optional[MFGraph._Edge] = None
    def __init__(self, n: int) -> None:
        self._n = n
        self._g: List[List[MFGraph._Edge]] = [[] for _ in range(n)]
        self._edges: List[MFGraph._Edge] = []
    def add_edge(self, src: int, dst: int, cap: int) -> int:
        assert 0 <= src < self._n
        assert 0 <= dst < self._n
        assert 0 <= cap
        m = len(self._edges)
        e = MFGraph._Edge(dst, cap)
        re = MFGraph._Edge(src, 0)
        e.rev = re
        re.rev = e
        self._g[src].append(e)
        self._g[dst].append(re)
        self._edges.append(e)
        return m
    def get_edge(self, i: int) -> Edge:
        assert 0 <= i < len(self._edges)
        e = self._edges[i]
        re = cast(MFGraph._Edge, e.rev)
        return MFGraph.Edge(
            re.dst,
            e.dst,
            e.cap + re.cap,
            re.cap
        )
    def edges(self) -> List[Edge]:
        return [self.get_edge(i) for i in range(len(self._edges))]
    def change_edge(self, i: int, new_cap: int, new_flow: int) -> None:
        assert 0 <= i < len(self._edges)
        assert 0 <= new_flow <= new_cap
        e = self._edges[i]
        e.cap = new_cap - new_flow
        assert e.rev is not None
        e.rev.cap = new_flow
    def flow(self, s: int, t: int, flow_limit: Optional[int] = None) -> int:
        assert 0 <= s < self._n
        assert 0 <= t < self._n
        assert s != t
        if flow_limit is None:
            flow_limit = cast(int, sum(e.cap for e in self._g[s]))
        current_edge = [0] * self._n
        level = [0] * self._n
        def fill(arr: List[int], value: int) -> None:
            for i in range(len(arr)):
                arr[i] = value
        def bfs() -> bool:
            fill(level, self._n)
            queue = []
            q_front = 0
            queue.append(s)
            level[s] = 0
            while q_front < len(queue):
                v = queue[q_front]
                q_front += 1
                next_level = level[v] + 1
                for e in self._g[v]:
                    if e.cap == 0 or level[e.dst] <= next_level:
                        continue
                    level[e.dst] = next_level
                    if e.dst == t:
                        return True
                    queue.append(e.dst)
            return False
        def dfs(lim: int) -> int:
            stack = []
            edge_stack: List[MFGraph._Edge] = []
            stack.append(t)
            while stack:
                v = stack[-1]
                if v == s:
                    flow = min(lim, min(e.cap for e in edge_stack))
                    for e in edge_stack:
                        e.cap -= flow
                        assert e.rev is not None
                        e.rev.cap += flow
                    return flow
                next_level = level[v] - 1
                while current_edge[v] < len(self._g[v]):
                    e = self._g[v][current_edge[v]]
                    re = cast(MFGraph._Edge, e.rev)
                    if level[e.dst] != next_level or re.cap == 0:
                        current_edge[v] += 1
                        continue
                    stack.append(e.dst)
                    edge_stack.append(re)
                    break
                else:
                    stack.pop()
                    if edge_stack:
                        edge_stack.pop()
                    level[v] = self._n
            return 0
        flow = 0
        while flow < flow_limit:
            if not bfs():
                break
            fill(current_edge, 0)
            while flow < flow_limit:
                f = dfs(flow_limit - flow)
                flow += f
                if f == 0:
                    break
        return flow
    def min_cut(self, s: int) -> List[bool]:
        visited = [False] * self._n
        stack = [s]
        visited[s] = True
        while stack:
            v = stack.pop()
            for e in self._g[v]:
                if e.cap > 0 and not visited[e.dst]:
                    visited[e.dst] = True
                    stack.append(e.dst)
        return visited

################################################################################



def main():
    N,M,D = map(int,input().split()); INF = pow(10,18)
    G = MFGraph(2*M+2)
    #s = 0; t = 2*M+1
    arrival = [[] for _ in range(N)]
    departure = [[] for _ in range(N)]
    for i in range(M):
        u,v,p,q,w = map(int,input().split())
        u -= 1; v -= 1
        G.add_edge(2*i+1,2*i+2,w)
        #print(2*i+1,2*i+2,w)
        arrival[v].append((2*i+2,q,w)) #i番目の便が時刻qにつく
        departure[u].append((2*i+1,p)) #i番目の便が時刻pに出る
        if u == 0:
            G.add_edge(0,2*i+1,INF)
        if v == N-1:
            G.add_edge(2*i+2,2*M+1,INF)
    
    for v in range(N):
        for a,at,aw in arrival[v]:
            for d,dt in departure[v]:
                if at + D <= dt:
                    #print(a,d,aw)
                    G.add_edge(a,d,aw)
    #print(G.edges())
    ans = G.flow(0,2*M+1)
    print(ans)



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