#857498 (PyPy3) No.2263 Perms

• 問題: No.2263 Perms
• ユーザー: 👑 Kazun
• 提出日時: 2023-04-07 22:28:30
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 113 ms / 2,000 ms
• コード長: 2,498 bytes
• コンパイル時間: 304 ms
• コンパイル使用メモリ: 82,432 KB
• 実行使用メモリ: 77,460 KB
• 最終ジャッジ日時: 2024-10-02 19:55:34
• 合計ジャッジ時間: 4,943 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
sample	AC * 2
other	AC * 39

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
def Hungarian(A, minimize=False, mode=False):
    """ 行列 A に対してハンガリアン法を適用し, 最大値を求める.
    A: 行列
    minimize: True にすると, 最小値を求める
    mode: True にすると, 最大値 (最小値) を達成する例も出力する.
    Reference: https://judge.yosupo.jp/submission/34963
    """
    if minimize:
        if mode:
            score, x=Hungarian([[-a_ij for a_ij in Ai] for Ai in A], False, True)
            return -score,x
        else:
            return -Hungarian([[-a_ij for a_ij in Ai] for Ai in A], False, False)
    inf=1<<31
    N=len(A)
    fx=[inf]*N
    fy=[0]*N
    x=[-1]*N
    y=[-1]*N
    i=0
    while i < N:
        t=[-1]*N
        s=[i]*(N + 1)
        p=q=0
        while p <= q and x[i] < 0:
            k, j = s[p], 0
            while j < N and x[i] < 0:
                if fx[k] + fy[j] == A[k][j] and t[j] < 0:
                    q += 1
                    s[q] = y[j]
                    t[j] = k
                    if s[q] < 0:
                        p = j
                        while p >= 0:
                            y[j] = k = t[j]
                            p = x[k]
                            x[k] = j
                            j = p
                j += 1
            p += 1
        if x[i] < 0:
            d = inf
            for k in range(q + 1):
                for j in range(N):
                    if t[j] < 0:
                        d = min(d, fx[s[k]] + fy[j] - A[s[k]][j])
            for j in range(N):
                if t[j] >= 0:
                    fy[j] += d
            for k in range(q + 1):
                fx[s[k]] -= d
        else:
            i += 1
    score=0
    for i,j in enumerate(x):
        score+=A[i][j]
    return (score,x) if mode else score
#==================================================
def solve():
    N,M=map(int,input().split())
    A=[None]*N
    S=[0]*N
    for i in range(N):
        A[i]=list(map(int,input().split()))
        if sum(A[i])!=M:
            print(-1)
            return
        for j in range(N):
            S[j]+=A[i][j]
    if not all(S[j]==M for j in range(N)):
        print(-1)
        return
    for _ in range(M):
        B=[[1 if A[i][j]>0 else 0 for j in range(N)] for i in range(N)]
        K,P=Hungarian(B,False,True)
        for i in range(N):
            A[i][P[i]]-=1
        print(*[P[i]+1 for i in range(N)])
    return
#==================================================
solve()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX