結果

問題 No.2263 Perms
ユーザー lam6er
提出日時 2025-03-26 15:43:58
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 113 ms / 2,000 ms
コード長 2,638 bytes
コンパイル時間 302 ms
コンパイル使用メモリ 82,100 KB
実行使用メモリ 78,288 KB
最終ジャッジ日時 2025-03-26 15:44:09
合計ジャッジ時間 5,040 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 39
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import deque

def hopcroft_karp(graph, U_size, V_size):
    pair_U = [None] * U_size
    pair_V = [None] * V_size
    dist = [0] * U_size

    def bfs():
        queue = deque()
        for u in range(U_size):
            if pair_U[u] is None:
                dist[u] = 0
                queue.append(u)
            else:
                dist[u] = float('inf')
        dist_null = float('inf')
        while queue:
            u = queue.popleft()
            if dist[u] < dist_null:
                for v in graph[u]:
                    if pair_V[v] is None:
                        dist_null = dist[u] + 1
                    elif dist[pair_V[v]] == float('inf'):
                        dist[pair_V[v]] = dist[u] + 1
                        queue.append(pair_V[v])
        return dist_null != float('inf')

    def dfs(u):
        for v in graph[u]:
            if pair_V[v] is None or (dist[pair_V[v]] == dist[u] + 1 and dfs(pair_V[v])):
                pair_U[u] = v
                pair_V[v] = u
                return True
        dist[u] = float('inf')
        return False

    result = 0
    while bfs():
        for u in range(U_size):
            if pair_U[u] is None:
                if dfs(u):
                    result += 1
    return pair_U, pair_V

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    idx = 0
    n = int(data[idx])
    idx += 1
    m = int(data[idx])
    idx += 1
    a = []
    for _ in range(n):
        row = list(map(int, data[idx:idx+n]))
        a.append(row)
        idx += n
    
    # Check row sums
    for i in range(n):
        if sum(a[i]) != m:
            print(-1)
            return
    
    # Check column sums
    for j in range(n):
        col_sum = 0
        for i in range(n):
            col_sum += a[i][j]
        if col_sum != m:
            print(-1)
            return
    
    permutations = []
    for _ in range(m):
        # Build adjacency list
        adj = [[] for _ in range(n)]
        for i in range(n):
            for j in range(n):
                if a[i][j] > 0:
                    adj[i].append(j)
        
        pair_U, pair_V = hopcroft_karp(adj, n, n)
        if any(u is None for u in pair_U):
            print(-1)
            return
        
        # Create permutation
        perm = [pair_U[i] + 1 for i in range(n)]
        permutations.append(perm)
        
        # Decrement a[i][j]
        for i in range(n):
            j = pair_U[i]
            a[i][j] -= 1
    
    # Output permutations
    for p in permutations:
        print(' '.join(map(str, p)))

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