結果

問題 No.654 Air E869120
ユーザー shobonvipshobonvip
提出日時 2022-08-26 19:21:26
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 128 ms / 2,000 ms
コード長 4,386 bytes
コンパイル時間 200 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 78,464 KB
最終ジャッジ日時 2024-10-13 20:08:23
合計ジャッジ時間 5,628 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 74 ms
68,864 KB
testcase_01 AC 70 ms
68,864 KB
testcase_02 AC 71 ms
68,480 KB
testcase_03 AC 70 ms
68,864 KB
testcase_04 AC 72 ms
68,608 KB
testcase_05 AC 71 ms
68,480 KB
testcase_06 AC 70 ms
68,608 KB
testcase_07 AC 72 ms
68,608 KB
testcase_08 AC 76 ms
68,480 KB
testcase_09 AC 75 ms
68,480 KB
testcase_10 AC 116 ms
78,336 KB
testcase_11 AC 117 ms
78,080 KB
testcase_12 AC 107 ms
78,336 KB
testcase_13 AC 112 ms
78,208 KB
testcase_14 AC 114 ms
77,824 KB
testcase_15 AC 113 ms
77,952 KB
testcase_16 AC 122 ms
78,464 KB
testcase_17 AC 122 ms
77,952 KB
testcase_18 AC 128 ms
78,336 KB
testcase_19 AC 121 ms
78,208 KB
testcase_20 AC 119 ms
78,080 KB
testcase_21 AC 121 ms
77,952 KB
testcase_22 AC 116 ms
77,824 KB
testcase_23 AC 117 ms
78,208 KB
testcase_24 AC 125 ms
78,208 KB
testcase_25 AC 112 ms
78,208 KB
testcase_26 AC 118 ms
78,336 KB
testcase_27 AC 111 ms
77,696 KB
testcase_28 AC 119 ms
77,952 KB
testcase_29 AC 110 ms
78,208 KB
testcase_30 AC 103 ms
77,696 KB
testcase_31 AC 105 ms
78,080 KB
testcase_32 AC 106 ms
77,952 KB
testcase_33 AC 110 ms
78,080 KB
testcase_34 AC 111 ms
77,696 KB
testcase_35 AC 74 ms
68,224 KB
testcase_36 AC 73 ms
68,608 KB
testcase_37 AC 73 ms
68,864 KB
testcase_38 AC 70 ms
68,352 KB
testcase_39 AC 74 ms
68,736 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

import bisect

def compress(arr):
	*XS, = set(arr)
	XS.sort()
	return list(XS), {cmp_e: cmp_i for cmp_i, cmp_e in enumerate(XS)}

n,m,d = map(int,input().split())

dat = []
tobus = [[] for i in range(n)]

for i in range(m):
	u,v,p,q,w = map(int,input().split())
	u-=1; v-=1
	dat.append((u,v,p,q,w))
	tobus[u].append(p)

tobulist = []
tobuset = []
for i in range(n):
	c_l, c_d = compress(tobus[i])
	tobulist.append(c_l)
	tobuset.append(c_d)

mfind = [0] * n
tmp = 0
for i in range(1, n-1):
	mfind[i] = tmp
	tmp += len(tobulist[i])


mf = MFGraph(tmp + 2)

cnt = 0
for i in range(1, n-1):
	for j in range(len(tobulist[i]) - 1):
		mf.add_edge(cnt+j, cnt+j+1, 10**18)
	cnt += len(tobulist[i])

for u,v,p,q,w in dat:
	src = 0
	dst = 0
	if u == 0:
		src = tmp
	elif u == n-1:
		continue
	else:
		src = mfind[u] + tobuset[u][p]
	if v == 0:
		continue
	elif v == n-1:
		dst = tmp + 1
	else:
		targ = bisect.bisect_left(tobulist[v], q+d)
		if targ == len(tobulist[v]):
			continue
		dst = mfind[v] + targ
	mf.add_edge(src, dst, w)

#print(*mf.edges(),sep="\n")

print(mf.flow(tmp, tmp + 1))
0