結果

問題 No.2263 Perms
ユーザー shobonvipshobonvip
提出日時 2023-04-07 22:14:07
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 248 ms / 2,000 ms
コード長 3,926 bytes
コンパイル時間 239 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 84,312 KB
最終ジャッジ日時 2024-10-02 19:42:59
合計ジャッジ時間 8,368 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
68,864 KB
testcase_01 AC 67 ms
68,224 KB
testcase_02 AC 68 ms
68,096 KB
testcase_03 AC 71 ms
68,224 KB
testcase_04 AC 81 ms
70,528 KB
testcase_05 AC 114 ms
78,336 KB
testcase_06 AC 231 ms
83,772 KB
testcase_07 AC 229 ms
83,424 KB
testcase_08 AC 216 ms
83,700 KB
testcase_09 AC 230 ms
83,308 KB
testcase_10 AC 220 ms
82,492 KB
testcase_11 AC 244 ms
83,540 KB
testcase_12 AC 235 ms
83,504 KB
testcase_13 AC 237 ms
83,592 KB
testcase_14 AC 248 ms
84,312 KB
testcase_15 AC 224 ms
84,132 KB
testcase_16 AC 140 ms
78,976 KB
testcase_17 AC 145 ms
79,616 KB
testcase_18 AC 137 ms
79,104 KB
testcase_19 AC 147 ms
79,488 KB
testcase_20 AC 226 ms
83,344 KB
testcase_21 AC 221 ms
82,684 KB
testcase_22 AC 210 ms
81,772 KB
testcase_23 AC 164 ms
79,736 KB
testcase_24 AC 166 ms
80,516 KB
testcase_25 AC 222 ms
82,504 KB
testcase_26 AC 233 ms
83,000 KB
testcase_27 AC 187 ms
80,748 KB
testcase_28 AC 169 ms
80,000 KB
testcase_29 AC 167 ms
80,296 KB
testcase_30 AC 116 ms
78,464 KB
testcase_31 AC 102 ms
77,952 KB
testcase_32 AC 143 ms
79,360 KB
testcase_33 AC 134 ms
79,232 KB
testcase_34 AC 86 ms
72,448 KB
testcase_35 AC 86 ms
72,960 KB
testcase_36 AC 121 ms
79,232 KB
testcase_37 AC 84 ms
73,088 KB
testcase_38 AC 226 ms
82,960 KB
testcase_39 AC 73 ms
68,224 KB
testcase_40 AC 72 ms
68,608 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


n, m = map(int,input().split())
a = [list(map(int,input().split())) for i in range(n)]

ans = []
for i in range(m):
	mf = MFGraph(2*n + 2)
	for j in range(n):
		mf.add_edge(2*n, j, 1)
		mf.add_edge(n+j, 2*n+1, 1)
	for j in range(n):
		for k in range(n):
			mf.add_edge(j, n+k, a[j][k])
	fl = mf.flow(2*n, 2*n+1)
	if fl < n:
		print(-1)
		exit()
	v = [0] * n
	for p in mf.edges():
		if 0 <= p.src < n and n <= p.dst < 2*n and p.flow == 1:
			a[p.src][p.dst-n] -= 1
			v[p.src] = p.dst-n+1
	ans.append(v)


for i in range(n):
	for j in range(n):
		if a[i][j] > 0:
			print(-1)
			exit()

for i in range(m):
	print(*ans[i])
0