結果

問題 No.459 C-VS for yukicoder
ユーザー vwxyzvwxyz
提出日時 2021-07-22 18:55:04
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 686 ms / 2,000 ms
コード長 6,239 bytes
コンパイル時間 205 ms
コンパイル使用メモリ 82,788 KB
実行使用メモリ 165,300 KB
最終ジャッジ日時 2024-07-17 15:03:29
合計ジャッジ時間 19,485 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 148 ms
89,452 KB
testcase_01 AC 150 ms
89,288 KB
testcase_02 AC 149 ms
89,244 KB
testcase_03 AC 150 ms
89,240 KB
testcase_04 AC 150 ms
89,244 KB
testcase_05 AC 147 ms
89,320 KB
testcase_06 AC 151 ms
89,072 KB
testcase_07 AC 150 ms
89,476 KB
testcase_08 AC 149 ms
89,300 KB
testcase_09 AC 150 ms
89,272 KB
testcase_10 AC 152 ms
89,104 KB
testcase_11 AC 150 ms
89,152 KB
testcase_12 AC 150 ms
89,252 KB
testcase_13 AC 152 ms
89,304 KB
testcase_14 AC 152 ms
89,144 KB
testcase_15 AC 255 ms
93,652 KB
testcase_16 AC 236 ms
93,012 KB
testcase_17 AC 192 ms
91,888 KB
testcase_18 AC 175 ms
89,680 KB
testcase_19 AC 174 ms
89,876 KB
testcase_20 AC 177 ms
90,000 KB
testcase_21 AC 686 ms
165,300 KB
testcase_22 AC 536 ms
160,136 KB
testcase_23 AC 591 ms
160,288 KB
testcase_24 AC 404 ms
120,340 KB
testcase_25 AC 349 ms
105,512 KB
testcase_26 AC 307 ms
97,580 KB
testcase_27 AC 311 ms
97,888 KB
testcase_28 AC 339 ms
105,376 KB
testcase_29 AC 345 ms
114,176 KB
testcase_30 AC 300 ms
100,036 KB
testcase_31 AC 347 ms
101,544 KB
testcase_32 AC 196 ms
93,620 KB
testcase_33 AC 374 ms
109,340 KB
testcase_34 AC 375 ms
104,892 KB
testcase_35 AC 243 ms
94,592 KB
testcase_36 AC 360 ms
109,452 KB
testcase_37 AC 234 ms
94,108 KB
testcase_38 AC 374 ms
108,960 KB
testcase_39 AC 266 ms
94,532 KB
testcase_40 AC 338 ms
100,804 KB
testcase_41 AC 196 ms
93,324 KB
testcase_42 AC 331 ms
99,744 KB
testcase_43 AC 369 ms
108,852 KB
testcase_44 AC 287 ms
95,272 KB
testcase_45 AC 278 ms
95,592 KB
testcase_46 AC 271 ms
95,280 KB
testcase_47 AC 240 ms
94,064 KB
testcase_48 AC 367 ms
108,952 KB
testcase_49 AC 215 ms
93,432 KB
testcase_50 AC 374 ms
108,288 KB
testcase_51 AC 221 ms
93,764 KB
testcase_52 AC 312 ms
98,076 KB
testcase_53 AC 276 ms
95,152 KB
testcase_54 AC 371 ms
108,888 KB
testcase_55 AC 297 ms
95,728 KB
testcase_56 AC 335 ms
99,472 KB
testcase_57 AC 206 ms
93,556 KB
testcase_58 AC 363 ms
104,752 KB
testcase_59 AC 284 ms
95,976 KB
testcase_60 AC 313 ms
97,892 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
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

H,W,N=map(int,readline().split())
cnt=[0]*W
for _ in range(H):
    S=readline().strip()
    for i in range(W):
        if S[i]=='#':
            cnt[i]+=1
MFG=MFGraph(N+W+4)
S,s,T,t=0,1,N+W+3,N+W+2
inf=1<<60
for i in range(N):
    MFG.add_edge(S,i+2,1)
    MFG.add_edge(s,i+2,8)
MFG.add_edge(s,T,N)
for i in range(W):
    MFG.add_edge(i+N+2,t,cnt[i])
C=[int(readline()) for i in range(N)]
for i in range(N):
    c=C[i]
    for j in range(c,c+3):
        MFG.add_edge(i+2,j+N+2,3)
MFG.add_edge(S,s,0)
MFG.add_edge(t,T,0)
MFG.flow(S,T)
MFG.change_edge(5*N+W+1,inf,0)
MFG.flow(S,T)
MFG.change_edge(5*N+W+1,MFG.get_edge(5*N+W+1).flow,MFG.get_edge(5*N+W+1).flow)
MFG.change_edge(5*N+W+2,inf,0)
MFG.flow(S,T)
MFG.change_edge(5*N+W+1,inf,MFG.get_edge(5*N+W+1).flow)
MFG.flow(S,T)
ans_lst=[[None]*3 for i in range(N)]
for e in MFG.edges():
    if 2<=e.src<=N+1:
        ans_lst[e.src-2][e.dst-N-2-C[e.src-2]]=e.flow
for i in range(N):
    ans=[['.']*3 for j in range(3)]
    for j in range(3):
        for k in range(ans_lst[i][j]):
            ans[k][j]='#'
    for j in range(3):
        print(*ans[j],sep='')
0