結果

問題 No.2549 Paint Eggs
ユーザー StanMarshStanMarsh
提出日時 2023-11-25 13:22:00
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 424 ms / 2,000 ms
コード長 5,224 bytes
コンパイル時間 414 ms
コンパイル使用メモリ 81,828 KB
実行使用メモリ 138,120 KB
最終ジャッジ日時 2023-11-25 13:22:18
合計ジャッジ時間 16,072 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 151 ms
90,356 KB
testcase_01 AC 154 ms
90,100 KB
testcase_02 AC 173 ms
90,356 KB
testcase_03 AC 153 ms
90,228 KB
testcase_04 AC 156 ms
90,100 KB
testcase_05 AC 151 ms
89,972 KB
testcase_06 AC 155 ms
90,100 KB
testcase_07 AC 156 ms
90,100 KB
testcase_08 AC 149 ms
89,204 KB
testcase_09 AC 158 ms
90,228 KB
testcase_10 AC 346 ms
133,372 KB
testcase_11 AC 285 ms
134,504 KB
testcase_12 AC 270 ms
125,684 KB
testcase_13 AC 284 ms
128,504 KB
testcase_14 AC 259 ms
116,136 KB
testcase_15 AC 216 ms
90,996 KB
testcase_16 AC 279 ms
123,724 KB
testcase_17 AC 266 ms
121,076 KB
testcase_18 AC 251 ms
118,388 KB
testcase_19 AC 285 ms
123,764 KB
testcase_20 AC 361 ms
138,104 KB
testcase_21 AC 351 ms
138,120 KB
testcase_22 AC 424 ms
138,100 KB
testcase_23 AC 380 ms
137,908 KB
testcase_24 AC 325 ms
138,100 KB
testcase_25 AC 320 ms
138,092 KB
testcase_26 AC 341 ms
137,592 KB
testcase_27 AC 376 ms
137,908 KB
testcase_28 AC 356 ms
137,916 KB
testcase_29 AC 347 ms
138,028 KB
testcase_30 AC 329 ms
137,908 KB
testcase_31 AC 362 ms
138,100 KB
testcase_32 AC 354 ms
137,904 KB
testcase_33 AC 355 ms
137,904 KB
testcase_34 AC 346 ms
137,916 KB
testcase_35 AC 342 ms
137,972 KB
testcase_36 AC 335 ms
138,104 KB
testcase_37 AC 351 ms
138,036 KB
testcase_38 AC 324 ms
138,100 KB
testcase_39 AC 348 ms
137,920 KB
testcase_40 AC 337 ms
137,904 KB
testcase_41 AC 342 ms
137,912 KB
testcase_42 AC 344 ms
138,104 KB
testcase_43 AC 347 ms
137,908 KB
testcase_44 AC 311 ms
137,780 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from random import getrandbits, randrange
from string import ascii_lowercase, ascii_uppercase
import sys
from math import ceil, floor, sqrt, pi, factorial, gcd, log, log10, log2, inf, cos, sin
from copy import deepcopy, copy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import (
    accumulate,
    product,
    combinations,
    combinations_with_replacement,
    permutations,
)
from bisect import bisect, bisect_left, bisect_right
from functools import lru_cache, reduce
from decimal import Decimal, getcontext
from typing import List, Tuple, Optional


inf = float("inf")


def ceil_div(a, b):
    return (a + b - 1) // b


def isqrt(num):
    res = int(sqrt(num))
    while res * res > num:
        res -= 1
    while (res + 1) * (res + 1) <= num:
        res += 1
    return res


def int1(s):
    return int(s) - 1


from types import GeneratorType


def bootstrap(f, stack=[]):
    def wrapped(*args, **kwargs):
        if stack:
            return f(*args, **kwargs)
        else:
            to = f(*args, **kwargs)
            while True:
                if type(to) is GeneratorType:
                    stack.append(to)
                    to = next(to)
                else:
                    stack.pop()
                    if not stack:
                        break
                    to = stack[-1].send(to)
            return to

    return wrapped


import sys
import os

input = lambda: sys.stdin.readline().rstrip("\r\n")

print = lambda *args, end="\n", sep=" ": sys.stdout.write(
    sep.join(map(str, args)) + end
)


def II():
    return int(input())


def MII(base=0):
    return map(lambda s: int(s) - base, input().split())


def LII(base=0):
    return list(MII(base))


def NA():
    n = II()
    a = LII()
    return n, a


def read_graph(n, m, base=0, directed=False, return_edges=False):

    g = [[] for _ in range(n)]
    edges = []
    for _ in range(m):
        a, b = MII(base)
        if return_edges:
            edges.append((a, b))
        g[a].append(b)
        if not directed:
            g[b].append(a)
    if return_edges:
        return g, edges
    return g


def read_graph_with_weight(n, m, base=0, directed=False, return_edges=False):

    g = [[] for _ in range(n)]
    edges = []
    for _ in range(m):
        a, b, w = MII()
        a, b = a - base, b - base
        if return_edges:
            edges.append((a, b, w))
        g[a].append((b, w))
        if not directed:
            g[b].append((a, w))
    if return_edges:
        return g, edges
    return g


def iterate_tokens():
    for line in sys.stdin:
        for word in line.split():
            yield word


tokens = None


def NI():
    global tokens
    if tokens is None:
        tokens = iterate_tokens()
    return int(next(tokens))


def LNI(n):
    return [NI() for _ in range(n)]


def yes(res):
    print("Yes" if res else "No")


def YES(res):
    print("YES" if res else "NO")


def pairwise(a):
    n = len(a)
    for i in range(n - 1):
        yield a[i], a[i + 1]


def factorial(n):
    return reduce(lambda x, y: x * y, range(1, n + 1))


def cmin(dp, i, x):
    if x < dp[i]:
        dp[i] = x


def cmax(dp, i, x):
    if x > dp[i]:
        dp[i] = x


def alp_a_to_i(s):
    return ord(s) - ord("a")


def alp_A_to_i(s):
    return ord(s) - ord("A")


def alp_i_to_a(i):
    return chr(ord("a") + i)


def alp_i_to_A(i):
    return chr(ord("A") + i)


d4 = [(1, 0), (0, 1), (-1, 0), (0, -1)]
d8 = [(1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)]


def ranges(n, m):
    return ((i, j) for i in range(n) for j in range(m))


def valid(i, j, n, m):
    return 0 <= i < n and 0 <= j < m


def ninj(i, j, n, m):
    return [(i + di, j + dj) for di, dj in d4 if valid(i + di, j + dj, n, m)]


def gen(x, *args):
    if len(args) == 1:
        return [x] * args[0]
    if len(args) == 2:
        return [[x] * args[1] for _ in [0] * args[0]]
    if len(args) == 3:
        return [[[x] * args[2] for _ in [0] * args[1]] for _ in [0] * args[0]]
    if len(args) == 4:
        return [
            [[[x] * args[3] for _ in [0] * args[2]] for _ in [0] * args[1]]
            for _ in [0] * args[0]
        ]


list2d = lambda a, b, v: [[v] * b for _ in range(a)]
list3d = lambda a, b, c, v: [[[v] * c for _ in range(b)] for _ in range(a)]


class Debug:
    def __init__(self, debug=False):
        self.debug = debug
        cur_path = os.path.dirname(os.path.abspath(__file__))
        self.local = os.path.exists(cur_path + "/.cph")

    def get_ic(self):
        if self.debug and self.local:
            from icecream import ic

            return ic
        else:
            return lambda *args, **kwargs: ...


ic = Debug(1).get_ic()

n, m, k = MII()
c, a = LII(1), LII()

ps = [[] for _ in range(m)]
for i, color in enumerate(c):
    ps[color].append(i)

res = min(a) * k
for i, (ai, p) in enumerate(zip(a, ps)):
    ic(ai, p, i)
    cur = inf
    cnt = 0
    l = 0
    for r in range(len(p)):
        cnt += 1
        while l <= r and p[r] - p[l] >= k:
            cnt -= 1
            l += 1
        ic(l, r, cnt)
        cur = min(cur, (k - cnt) * ai)
    res = min(res, cur)

print(res)
0