結果

問題 No.2549 Paint Eggs
ユーザー StanMarshStanMarsh
提出日時 2023-11-25 13:16:17
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 5,211 bytes
コンパイル時間 328 ms
コンパイル使用メモリ 82,280 KB
実行使用メモリ 138,932 KB
最終ジャッジ日時 2024-09-26 10:24:33
合計ジャッジ時間 13,331 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 145 ms
91,152 KB
testcase_02 WA -
testcase_03 AC 142 ms
90,956 KB
testcase_04 AC 147 ms
90,952 KB
testcase_05 AC 139 ms
90,636 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 275 ms
133,344 KB
testcase_11 AC 241 ms
135,948 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 202 ms
116,684 KB
testcase_15 AC 157 ms
91,404 KB
testcase_16 AC 241 ms
124,320 KB
testcase_17 AC 195 ms
121,644 KB
testcase_18 AC 195 ms
119,044 KB
testcase_19 AC 229 ms
124,268 KB
testcase_20 WA -
testcase_21 AC 270 ms
138,716 KB
testcase_22 AC 291 ms
138,932 KB
testcase_23 AC 278 ms
138,196 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 278 ms
138,072 KB
testcase_27 AC 285 ms
138,204 KB
testcase_28 AC 301 ms
138,584 KB
testcase_29 AC 287 ms
138,584 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 280 ms
138,332 KB
testcase_33 AC 279 ms
138,332 KB
testcase_34 AC 285 ms
138,460 KB
testcase_35 WA -
testcase_36 WA -
testcase_37 AC 273 ms
138,332 KB
testcase_38 WA -
testcase_39 WA -
testcase_40 AC 282 ms
138,324 KB
testcase_41 WA -
testcase_42 AC 276 ms
138,584 KB
testcase_43 WA -
testcase_44 WA -
権限があれば一括ダウンロードができます

ソースコード

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 = inf
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 r - l >= k:
            cnt -= 1
            l += 1
        ic(l, r, cnt)
        cur = min(cur, (k - cnt) * ai)
    res = min(res, cur)

print(res)
0