This documentation is automatically generated by online-judge-tools/verification-helper
from cp_library.io.parser_cls import TokenStream, Parsable, Parser
from cp_library.ds.view.view_cls import view
import cp_library.__header__
from typing import Generic, Union
from cp_library.misc.typing import _T
from cp_library.bit.pack.packer_cls import Packer
import cp_library.ds.__header__
import cp_library.ds.grid.__header__
class Grid(Generic[_T], Parsable):
__slots__ = 'pkr', 'size', 'H', 'W', 'A'
def __init__(G, H: int, W: int, A: Union[_T, list[_T], list[list[_T]]], pkr = None):
G.pkr = pkr or Packer(W-1); G.size = H << G.pkr.s; G.H, G.W = H, W
if isinstance(A, list):
if isinstance(A[0], list):
G.A = [A[0][0]]*G.size
for i in range(H):
ii = i << G.pkr.s
for j in range(W): G.A[ii|j] = A[i][j]
elif len(A) < G.size:
G.A = [A[0]]*G.size
for i in range(H):
ii = i << G.pkr.s
for j in range(W): G.A[ii|j] = A[i*W+j]
else:
G.A = A
else:
G.A = [A] * G.size
def __len__(G): return G.H
def __getitem__(G, i: int):
if 0 <= i < G.H: return view(G.A, i<<G.pkr.s, (i+1)<<G.pkr.s)
else: raise IndexError
def __call__(G, i: int, j: int): return G.A[G.pkr.enc(i,j)]
def set(G, i: int, j: int, v: _T): G.A[G.pkr.enc(i,j)] = v
@classmethod
def compile(cls, H: int, W: int, T: type = int):
pkr = Packer(W-1); size = H << pkr.s
if T is int:
def parse(ts: TokenStream):
A = [0]*size
for i in range(H):
for j,s in ts.line(): A[pkr.enc(i,j)] = int(s)
return cls(H, W, A, pkr)
elif T is str:
def parse(ts: TokenStream):
A = ['']*size
for i in range(H):
for j,s in ts.line(): A[pkr.enc(i,j)] = s
return cls(H, W, A, pkr)
else:
elm = Parser.compile(T)
def parse(ts: TokenStream):
A = [None]*size
for i in range(H):
for j in range(W): A[pkr.enc(i,j)] = elm(ts)
return cls(H, W, A, pkr)
return parse
'''
╺━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━╸
https://kobejean.github.io/cp-library
'''
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")
try:
sys.stdin = IOWrapper.stdin = IOWrapper(sys.stdin)
sys.stdout = IOWrapper.stdout = IOWrapper(sys.stdout)
except:
pass
from typing import TypeVar
_S = TypeVar('S')
_T = TypeVar('T')
_U = TypeVar('U')
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
@classmethod
def __class_getitem__(cls, item):
return GenericAlias(cls, item)
from typing import Generic
def list_find(lst: list, value, start = 0, stop = sys.maxsize):
try:
return lst.index(value, start, stop)
except:
return -1
class view(Generic[_T]):
__slots__ = 'A', 'l', 'r'
def __init__(V, A: list[_T], l: int, r: int): V.A, V.l, V.r = A, l, r
def __len__(V): return V.r - V.l
def __getitem__(V, i: int):
if 0 <= i < V.r - V.l: return V.A[V.l+i]
else: raise IndexError
def __setitem__(V, i: int, v: _T): V.A[V.l+i] = v
def __contains__(V, v: _T): return list_find(V.A, v, V.l, V.r) != -1
def set_range(V, l: int, r: int): V.l, V.r = l, r
def index(V, v: _T): return V.A.index(v, V.l, V.r) - V.l
def reverse(V):
l, r = V.l, V.r-1
while l < r: V.A[l], V.A[r] = V.A[r], V.A[l]; l += 1; r -= 1
def sort(V, /, *args, **kwargs):
A = V.A[V.l:V.r]; A.sort(*args, **kwargs)
for i,a in enumerate(A,V.l): V.A[i] = a
def pop(V): V.r -= 1; return V.A[V.r]
def append(V, v: _T): V.A[V.r] = v; V.r += 1
def popleft(V): V.l += 1; return V.A[V.l-1]
def appendleft(V, v: _T): V.l -= 1; V.A[V.l] = v;
def validate(V): return 0 <= V.l <= V.r <= len(V.A)
class Packer:
__slots__ = 's', 'm'
def __init__(P, mx: int): P.s = mx.bit_length(); P.m = (1 << P.s) - 1
def enc(P, a: int, b: int): return a << P.s | b
def dec(P, x: int) -> tuple[int, int]: return x >> P.s, x & P.m
def enumerate(P, A, reverse=False): P.ienumerate(A:=list(A), reverse); return A
def ienumerate(P, A, reverse=False):
if reverse:
for i,a in enumerate(A): A[i] = P.enc(-a, i)
else:
for i,a in enumerate(A): A[i] = P.enc(a, i)
def indices(P, A: list[int]): P.iindices(A:=list(A)); return A
def iindices(P, A):
for i,a in enumerate(A): A[i] = P.m&a
class Grid(Generic[_T], Parsable):
__slots__ = 'pkr', 'size', 'H', 'W', 'A'
def __init__(G, H: int, W: int, A: Union[_T, list[_T], list[list[_T]]], pkr = None):
G.pkr = pkr or Packer(W-1); G.size = H << G.pkr.s; G.H, G.W = H, W
if isinstance(A, list):
if isinstance(A[0], list):
G.A = [A[0][0]]*G.size
for i in range(H):
ii = i << G.pkr.s
for j in range(W): G.A[ii|j] = A[i][j]
elif len(A) < G.size:
G.A = [A[0]]*G.size
for i in range(H):
ii = i << G.pkr.s
for j in range(W): G.A[ii|j] = A[i*W+j]
else:
G.A = A
else:
G.A = [A] * G.size
def __len__(G): return G.H
def __getitem__(G, i: int):
if 0 <= i < G.H: return view(G.A, i<<G.pkr.s, (i+1)<<G.pkr.s)
else: raise IndexError
def __call__(G, i: int, j: int): return G.A[G.pkr.enc(i,j)]
def set(G, i: int, j: int, v: _T): G.A[G.pkr.enc(i,j)] = v
@classmethod
def compile(cls, H: int, W: int, T: type = int):
pkr = Packer(W-1); size = H << pkr.s
if T is int:
def parse(ts: TokenStream):
A = [0]*size
for i in range(H):
for j,s in ts.line(): A[pkr.enc(i,j)] = int(s)
return cls(H, W, A, pkr)
elif T is str:
def parse(ts: TokenStream):
A = ['']*size
for i in range(H):
for j,s in ts.line(): A[pkr.enc(i,j)] = s
return cls(H, W, A, pkr)
else:
elm = Parser.compile(T)
def parse(ts: TokenStream):
A = [None]*size
for i in range(H):
for j in range(W): A[pkr.enc(i,j)] = elm(ts)
return cls(H, W, A, pkr)
return parse