cp-library

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub kobejean/cp-library

:heavy_check_mark: test/atcoder/abc/abc185_e_dp2d.test.py

Depends on

Code

# verification-helper: PROBLEM https://atcoder.jp/contests/abc185/tasks/abc185_e

def main():
    N, M = read(tuple[int, ...])
    A = read(list[int,N])
    B = read(list[int,M])
    
    dp = DynamicProgramming2D(N+1, M+1)
    dp[0,0] = 0
    
    transitions = [
        Match(1,1,A,B),    # match/mismatch
        Edit(0,1),         # insert
        Edit(1,0),         # delete
    ]
    
    dp.solve(transitions)
    write(dp[N,M])
    

from cp_library.io.read_fn import read
from cp_library.io.write_fn import write
from cp_library.alg.dp.dp2d_cls import DynamicProgramming2D, Transition2D

from dataclasses import dataclass

@dataclass
class Match(Transition2D[int]):
    A: list[int]
    B: list[int]

    def __call__(self, i: int, j: int, src_val: int, dest_val: int) -> int:
        return min(dest_val, src_val + (self.A[i] != self.B[j]))

class Edit(Transition2D[int]):
    def __call__(self, i: int, j: int, src_val: int, dest_val: int) -> int:
        return min(dest_val, src_val + 1)
    
if __name__ == "__main__":
    main()
# verification-helper: PROBLEM https://atcoder.jp/contests/abc185/tasks/abc185_e

def main():
    N, M = read(tuple[int, ...])
    A = read(list[int,N])
    B = read(list[int,M])
    
    dp = DynamicProgramming2D(N+1, M+1)
    dp[0,0] = 0
    
    transitions = [
        Match(1,1,A,B),    # match/mismatch
        Edit(0,1),         # insert
        Edit(1,0),         # delete
    ]
    
    dp.solve(transitions)
    write(dp[N,M])
    

'''
╺━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━╸
             https://kobejean.github.io/cp-library               
'''

from typing import Iterable, Type, Union, overload
import typing
from collections import deque
from numbers import Number
from types import GenericAlias 
from typing import Callable, Collection, Iterator, Union
import os
import sys
from io import BytesIO, IOBase


class FastIO(IOBase):
    BUFSIZE = 8192
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        BUFSIZE = self.BUFSIZE
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        BUFSIZE = self.BUFSIZE
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    stdin: 'IOWrapper' = None
    stdout: 'IOWrapper' = None
    
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable

    def write(self, s):
        return self.buffer.write(s.encode("ascii"))
    
    def read(self):
        return self.buffer.read().decode("ascii")
    
    def readline(self):
        return self.buffer.readline().decode("ascii")

sys.stdin = IOWrapper.stdin = IOWrapper(sys.stdin)
sys.stdout = IOWrapper.stdout = IOWrapper(sys.stdout)
from typing import TypeVar
_T = TypeVar('T')

class TokenStream(Iterator):
    stream = IOWrapper.stdin

    def __init__(self):
        self.queue = deque()

    def __next__(self):
        if not self.queue: self.queue.extend(self._line())
        return self.queue.popleft()
    
    def wait(self):
        if not self.queue: self.queue.extend(self._line())
        while self.queue: yield
 
    def _line(self):
        return TokenStream.stream.readline().split()

    def line(self):
        if self.queue:
            A = list(self.queue)
            self.queue.clear()
            return A
        return self._line()
TokenStream.default = TokenStream()

class CharStream(TokenStream):
    def _line(self):
        return TokenStream.stream.readline().rstrip()
CharStream.default = CharStream()


ParseFn = Callable[[TokenStream],_T]
class Parser:
    def __init__(self, spec: Union[type[_T],_T]):
        self.parse = Parser.compile(spec)

    def __call__(self, ts: TokenStream) -> _T:
        return self.parse(ts)
    
    @staticmethod
    def compile_type(cls: type[_T], args = ()) -> _T:
        if issubclass(cls, Parsable):
            return cls.compile(*args)
        elif issubclass(cls, (Number, str)):
            def parse(ts: TokenStream): return cls(next(ts))              
            return parse
        elif issubclass(cls, tuple):
            return Parser.compile_tuple(cls, args)
        elif issubclass(cls, Collection):
            return Parser.compile_collection(cls, args)
        elif callable(cls):
            def parse(ts: TokenStream):
                return cls(next(ts))              
            return parse
        else:
            raise NotImplementedError()
    
    @staticmethod
    def compile(spec: Union[type[_T],_T]=int) -> ParseFn[_T]:
        if isinstance(spec, (type, GenericAlias)):
            cls = typing.get_origin(spec) or spec
            args = typing.get_args(spec) or tuple()
            return Parser.compile_type(cls, args)
        elif isinstance(offset := spec, Number): 
            cls = type(spec)  
            def parse(ts: TokenStream): return cls(next(ts)) + offset
            return parse
        elif isinstance(args := spec, tuple):      
            return Parser.compile_tuple(type(spec), args)
        elif isinstance(args := spec, Collection):  
            return Parser.compile_collection(type(spec), args)
        elif isinstance(fn := spec, Callable): 
            def parse(ts: TokenStream): return fn(next(ts))
            return parse
        else:
            raise NotImplementedError()

    @staticmethod
    def compile_line(cls: _T, spec=int) -> ParseFn[_T]:
        if spec is int:
            fn = Parser.compile(spec)
            def parse(ts: TokenStream): return cls([int(token) for token in ts.line()])
            return parse
        else:
            fn = Parser.compile(spec)
            def parse(ts: TokenStream): return cls([fn(ts) for _ in ts.wait()])
            return parse

    @staticmethod
    def compile_repeat(cls: _T, spec, N) -> ParseFn[_T]:
        fn = Parser.compile(spec)
        def parse(ts: TokenStream): return cls([fn(ts) for _ in range(N)])
        return parse

    @staticmethod
    def compile_children(cls: _T, specs) -> ParseFn[_T]:
        fns = tuple((Parser.compile(spec) for spec in specs))
        def parse(ts: TokenStream): return cls([fn(ts) for fn in fns])  
        return parse
            
    @staticmethod
    def compile_tuple(cls: type[_T], specs) -> ParseFn[_T]:
        if isinstance(specs, (tuple,list)) and len(specs) == 2 and specs[1] is ...:
            return Parser.compile_line(cls, specs[0])
        else:
            return Parser.compile_children(cls, specs)

    @staticmethod
    def compile_collection(cls, specs):
        if not specs or len(specs) == 1 or isinstance(specs, set):
            return Parser.compile_line(cls, *specs)
        elif (isinstance(specs, (tuple,list)) and len(specs) == 2 and isinstance(specs[1], int)):
            return Parser.compile_repeat(cls, specs[0], specs[1])
        else:
            raise NotImplementedError()

class Parsable:
    @classmethod
    def compile(cls):
        def parser(ts: TokenStream): return cls(next(ts))
        return parser

@overload
def read() -> Iterable[int]: ...
@overload
def read(spec: int) -> list[int]: ...
@overload
def read(spec: Union[Type[_T],_T], char=False) -> _T: ...
def read(spec: Union[Type[_T],_T] = None, char=False):
    if not char and spec is None: return map(int, TokenStream.default.line())
    parser: _T = Parser.compile(spec)
    return parser(CharStream.default if char else TokenStream.default)

def write(*args, **kwargs):
    '''Prints the values to a stream, or to stdout_fast by default.'''
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", IOWrapper.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()

from typing import TypeVar, Generic, Container
from dataclasses import dataclass
from math import inf

_T = TypeVar('T')

@dataclass
class Transition2D(Generic[_T]):
    di: int
    dj: int
    
    def __call__(self, i: int, j: int, src: _T, dest: _T) -> _T:
        '''Override this to implement transition logic'''
        return src  # Default no-op
    
    @classmethod
    def make(cls, func):
        class Transition(cls):
            def __call__(self, i: int, j: int, src: _T, dest: _T) -> _T:
                return func(i,j,src,dest)
        return Transition

class DynamicProgramming2D(Generic[_T], Parsable, Container):
    def __init__(self, rows: int, cols: int, default: _T = inf):
        self.rows = rows
        self.cols = cols
        self.table = default if isinstance(default, list) else [[default] * cols for _ in range(rows)]
    
    def __getitem__(self, pos: tuple[int, int]) -> _T:
        i, j = pos
        return self.table[i][j]
    
    def __setitem__(self, pos: tuple[int, int], value: _T) -> None:
        i, j = pos
        self.table[i][j] = value

    def __contains__(self, x: object) -> bool:
        return any(x in row for row in self.table)
    
    
    def solve(self, transitions: list[Transition2D[_T]]) -> None:
        for i in range(self.rows):
            for j in range(self.cols):
                curr_val = self.table[i][j]
                for trans in transitions:
                    ni, nj = i + trans.di, j + trans.dj
                    if 0 <= ni < self.rows and 0 <= nj < self.cols:
                        self.table[ni][nj] = trans(i, j, curr_val, self.table[ni][nj])
    
    @classmethod
    def compile(cls, N, M, T = int):
        table = Parser.compile(list[list[T,M],N])
        def parse(ts: TokenStream):
            return cls(N, M, table(ts))
        return parse


@dataclass
class Match(Transition2D[int]):
    A: list[int]
    B: list[int]

    def __call__(self, i: int, j: int, src_val: int, dest_val: int) -> int:
        return min(dest_val, src_val + (self.A[i] != self.B[j]))

class Edit(Transition2D[int]):
    def __call__(self, i: int, j: int, src_val: int, dest_val: int) -> int:
        return min(dest_val, src_val + 1)
    
if __name__ == "__main__":
    main()
Back to top page