結果

問題 No.1615 Double Down
ユーザー iaNTUiaNTU
提出日時 2021-06-23 03:06:14
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 8,369 ms / 10,000 ms
コード長 4,701 bytes
コンパイル時間 332 ms
コンパイル使用メモリ 86,892 KB
実行使用メモリ 269,760 KB
最終ジャッジ日時 2023-09-24 15:01:08
合計ジャッジ時間 128,872 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 991 ms
160,056 KB
testcase_01 AC 978 ms
158,884 KB
testcase_02 AC 1,413 ms
207,264 KB
testcase_03 AC 1,538 ms
206,752 KB
testcase_04 AC 1,218 ms
190,376 KB
testcase_05 AC 1,138 ms
186,176 KB
testcase_06 AC 1,752 ms
247,756 KB
testcase_07 AC 1,729 ms
241,576 KB
testcase_08 AC 1,680 ms
240,020 KB
testcase_09 AC 6,346 ms
238,896 KB
testcase_10 AC 6,561 ms
238,148 KB
testcase_11 AC 6,424 ms
243,552 KB
testcase_12 AC 2,957 ms
261,328 KB
testcase_13 AC 3,177 ms
259,892 KB
testcase_14 AC 3,018 ms
259,616 KB
testcase_15 AC 2,025 ms
265,804 KB
testcase_16 AC 2,058 ms
269,760 KB
testcase_17 AC 2,112 ms
268,392 KB
testcase_18 AC 7,836 ms
249,812 KB
testcase_19 AC 8,369 ms
254,008 KB
testcase_20 AC 7,821 ms
255,644 KB
testcase_21 AC 7,705 ms
253,372 KB
testcase_22 AC 6,960 ms
249,140 KB
testcase_23 AC 7,896 ms
247,228 KB
testcase_24 AC 7,810 ms
243,704 KB
testcase_25 AC 7,240 ms
244,660 KB
testcase_26 AC 7,557 ms
244,832 KB
testcase_27 AC 355 ms
87,428 KB
testcase_28 AC 352 ms
87,492 KB
testcase_29 AC 430 ms
92,480 KB
testcase_30 AC 437 ms
94,088 KB
testcase_31 AC 390 ms
90,612 KB
testcase_32 AC 400 ms
90,516 KB
testcase_33 AC 533 ms
99,160 KB
testcase_34 AC 528 ms
98,568 KB
testcase_35 AC 519 ms
97,672 KB
testcase_36 AC 155 ms
78,932 KB
testcase_37 AC 158 ms
79,264 KB
testcase_38 AC 168 ms
79,184 KB
testcase_39 AC 168 ms
79,152 KB
testcase_40 AC 176 ms
79,652 KB
testcase_41 AC 176 ms
79,032 KB
testcase_42 AC 180 ms
79,800 KB
testcase_43 AC 183 ms
79,680 KB
testcase_44 AC 185 ms
79,648 KB
testcase_45 AC 73 ms
71,040 KB
testcase_46 AC 72 ms
71,148 KB
testcase_47 AC 75 ms
71,308 KB
testcase_48 AC 72 ms
71,336 KB
testcase_49 AC 72 ms
71,180 KB
testcase_50 AC 71 ms
71,288 KB
testcase_51 AC 73 ms
71,452 KB
testcase_52 AC 74 ms
71,404 KB
testcase_53 AC 74 ms
71,032 KB
testcase_54 AC 73 ms
71,036 KB
testcase_55 AC 74 ms
71,304 KB
testcase_56 AC 73 ms
71,200 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class mf_graph:
    def __init__(self, N) :
        self.size = N
        self.g = [[] for i in range(self.size)]
        self.gsz = [0 for i in range(self.size)]

    def add_edge(self, u, v) :
        self.g[u].append([v, self.gsz[v], 1])
        self.g[v].append([u, self.gsz[u], 0])
        self.gsz[u] += 1
        self.gsz[v] += 1

    def Bfs(self, s, t) :
        q = [s]
        idx = 0
        q_sz = 1
        self.went[s] = t
        self.Iter[s] = self.dep[s] = 0
        while idx < q_sz :
            now = q[idx]
            idx += 1
            for i in self.g[now] :
                if i[2] > 0 and self.went[i[0]] != t :
                    self.went[i[0]] = t
                    self.dep[i[0]] = self.dep[now] + 1
                    self.Iter[i[0]] = 0
                    q_sz += 1
                    q.append(i[0])

    def Dfs(self, u, t, nv) :
        if u == t :
            return nv
        while self.Iter[u] < self.gsz[u] :
            i = self.Iter[u]
            if self.g[u][i][2] > 0 and self.dep[self.g[u][i][0]] > self.dep[u] :
                if self.Dfs(self.g[u][i][0], t, nv) > 0 :
                    self.g[u][i][2] = 0
                    self.g[self.g[u][i][0]][self.g[u][i][1]][2] = 1
                    return 1
            self.Iter[u] += 1
        return 0

    def flow(self, s, t) :
        self.dep = [0 for i in range(self.size)]
        self.went = [0 for i in range(self.size)]
        self.Iter = [0 for i in range(self.size)]
        cnt = 0; ans = 0; kInf = 1 << 30
        while True :
            cnt += 1
            self.Bfs(s, cnt)
            if self.went[s] != self.went[t] :
                break
            f = 0
            while True :
                f = self.Dfs(s, t, kInf)
                if f > 0 :
                    ans += f
                else :
                    break
        return ans

n, m, k, l = map(int, input().split())
x = [0] * l; y = [0] * l; z = [0] * l
for i in range(l) :
    x[i], y[i], z[i] = map(int, input().split())

edges = [[] for i in range(k + 1)]
for i in range(l) :
    edges[z[i]].append(i)

alivex = [True for i in range(n + 1)]
alivey = [True for i in range(m + 1)]

S = 0; T = n + m + 1
G = mf_graph(n + m + 2)
for j in range(1, n + 1) :
    G.add_edge(S, j)
for j in range(1, m + 1) :
    G.add_edge(j + n, T)

previous_edges = []
qu = []
qu_sz = 0
ans = 0

for i in range(k, -1, -1) :
    for j in edges[i] :
        if alivex[x[j]] and alivey[y[j]] : 
            previous_edges.append(j)
            G.add_edge(x[j], y[j] + n)

    gx = [[] for j in range(n + 1)]
    gy = [[] for j in range(m + 1)]

    for j in previous_edges :
        gx[x[j]].append(y[j])
        gy[y[j]].append(x[j])

    ans += G.flow(S, T) << i

    wentx = [False for i in range(n + 1)]
    wenty = [False for i in range(m + 1)]
    matchx = [-1 for i in range(n + 1)]
    matchy = [-1 for i in range(m + 1)]
    
    for j in range(1, n + 1) :
        for e in G.g[j] :
            if e[0] != S and e[2] == 0 and G.g[e[0]][e[1]][2] == 1 :
                matchx[j] = e[0] - n
                matchy[e[0] - n] = j

    for j in range(1, n + 1) :
        if matchx[j] < 0 :
            wentx[j] = True
            qu_sz += 1
            qu.append(j)
    
    while qu_sz > 0 :
        idx = qu.pop()
        qu_sz -= 1
        for j in gx[idx] :
            if not wentx[matchy[j]] :
                wentx[matchy[j]] = True
                qu_sz += 1
                qu.append(matchy[j])

    for j in range(1, n + 1) :
        if not wentx[j] :
            alivex[j] = False

    for j in range(1, m + 1) :
        if matchy[j] < 0 :
            wenty[j] = True
            qu_sz += 1
            qu.append(j)

    while qu_sz > 0 :
        idx = qu.pop()
        qu_sz -= 1
        for j in gy[idx] :
            if not wenty[matchx[j]] :
                wenty[matchx[j]] = True
                qu_sz += 1
                qu.append(matchx[j])

    for j in range(1, m + 1) :
        if not wenty[j] :
            alivey[j] = False

    for j in range(1, n + 1) :
        if not wentx[j] :
            for idx in range(G.gsz[j]) :
                e = G.g[j][idx]
                if e[2] >= 0 and e[0] != S and not wenty[e[0] - n] and matchx[j] != e[0] - n :
                    G.g[j][idx][2] = 0
                    G.g[e[0]][e[1]][2] = 0

    psz = len(previous_edges)
    j = 0
    while j < psz :
        idx = previous_edges[j]
        if not wentx[x[idx]] and not wenty[y[idx]] and matchx[x[idx]] != y[idx] :
            psz -= 1
            previous_edges[j], previous_edges[psz] = previous_edges[psz], previous_edges[j]
            previous_edges.pop()
            j -= 1
        j += 1
print(ans)
0