/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 806ms 44.746 MiB
#2 Accepted 807ms 44.812 MiB
#3 Accepted 988ms 45.047 MiB
#4 Time Exceeded ≥2103ms ≥46.668 MiB
#5 Time Exceeded ≥2101ms ≥47.73 MiB
#6 Time Exceeded ≥2103ms ≥56.23 MiB
#7 Time Exceeded ≥2103ms ≥78.754 MiB
#8 Time Exceeded ≥2103ms ≥62.621 MiB
#9 Time Exceeded ≥2104ms ≥59.254 MiB
#10 Time Exceeded ≥2101ms ≥55.207 MiB
#11 Time Exceeded ≥2103ms ≥52.785 MiB
#12 Time Exceeded ≥2106ms ≥78.668 MiB
#13 Time Exceeded ≥2107ms ≥90.883 MiB
#14 Time Exceeded ≥2008ms ≥107.949 MiB
#15 Time Exceeded ≥2104ms ≥56.309 MiB
#16 Time Exceeded ≥2103ms ≥51.719 MiB
#17 Time Exceeded ≥2103ms ≥76.875 MiB
#18 Time Exceeded ≥2104ms ≥56.336 MiB
#19 Time Exceeded ≥2102ms ≥56.277 MiB
#20 Time Exceeded ≥2103ms ≥56.23 MiB

Code

#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
from collections import defaultdict
from itertools import *
import random
import math

# MOD = 998244353
MOD = 10**9 + 7

MX = 200001
divisors = [[] for _ in range(MX)]
for x in range(1, MX):
    for y in range(x, MX, x):
        divisors[y].append(x)


def solve():
    N, K = rlist()
    A = rlist()
    locs = defaultdict(list)
    for i, x in enumerate(A):
        for d in divisors[x]:
            locs[d].append(i)

    dp = [0] * N
    for i in range(N - 2, -1, -1):
        dp[i] = dp[i + 1] + K
        seen = set()
        for d in reversed(divisors[A[i]]):
            for j in reversed(locs[d]):
                if j <= i:
                    break
                if j in seen:
                    continue
                seen.add(j)
                cand = dp[j] + A[i] // d
                if cand < dp[i]:
                    dp[i] = cand

    return dp[0]


def main():
    T = 1
    T = rint()

    for tc in range(1, 1 + T):
        ans = solve()

        print(ans)
        # print(*ans)

        # print("Yes" if ans else "No")
        # print("YES" if ans else "NO")
        # print("Alice" if ans else "Bob")
        # print("First" if ans else "Second")
        # print("Case #{}: {}".format(tc, ans))
        # print(len(ans))
        # for row in ans: print(*row)


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._file = 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):
        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):
        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):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
rint = lambda: int(input())


def rlist():
    return list(map(int, input().split()))


def rgrid(n):
    return [rlist() for _ in range(n)]


# endregion

if __name__ == "__main__":
    main()

Information

Submit By
Type
Submission
Problem
P1099 Which way to go
Contest
Brain Booster #6
Language
Python 3 (Python 3.12.3)
Submit At
2024-10-03 16:24:30
Judged At
2024-10-03 16:24:30
Judged By
Score
15
Total Time
≥2107ms
Peak Memory
≥107.949 MiB