/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 18ms 3.594 MiB
#2 Accepted 18ms 3.602 MiB
#3 Accepted 26ms 3.43 MiB
#4 Accepted 27ms 3.566 MiB
#5 Accepted 63ms 3.609 MiB
#6 Accepted 246ms 4.77 MiB
#7 Accepted 501ms 7.828 MiB
#8 Accepted 506ms 8.727 MiB
#9 Time Exceeded ≥1002ms ≥29.027 MiB
#10 Time Exceeded ≥1005ms ≥72.207 MiB
#11 Time Exceeded ≥1005ms ≥72.562 MiB
#12 Time Exceeded ≥1005ms ≥72.359 MiB
#13 Time Exceeded ≥1103ms ≥73.27 MiB
#14 Time Exceeded ≥1103ms ≥73.223 MiB
#15 Time Exceeded ≥1005ms ≥72.262 MiB
#16 Time Exceeded ≥1105ms ≥73.504 MiB
#17 Time Exceeded ≥1105ms ≥73.457 MiB
#18 Accepted 26ms 3.66 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

inf = float("inf")


def solve():
    N, K = rlist()
    orda = ord("a")
    A = [ord(c) - orda for c in input()]

    cost = [0] * (N - 2)
    for i in range(N - 2):
        cur_cost = 0
        for j in range(3):
            x = A[i + j]
            if x == j:
                continue
            elif x > j:
                cur_cost += 26 + j - x
            else:
                cur_cost += j - x
        cost[i] = cur_cost

    dp = [[inf] * (N // 3 + 1) for _ in range(N + 1)]
    for i in range(N + 1):
        dp[i][0] = 0

    for i in range(N - 3, -1, -1):
        for s in range(N // 3, 0, -1):
            dp[i][s] = min(dp[i + 1][s], dp[i + 3][s - 1] + cost[i])

    for s in range(N // 3, -1, -1):
        if dp[0][s] <= K:
            return s


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
P1100 Substring ABC
Contest
Brain Booster #6
Language
Python 3 (Python 3.12.3)
Submit At
2024-10-03 16:42:15
Judged At
2024-10-03 16:42:15
Judged By
Score
52
Total Time
≥1105ms
Peak Memory
≥73.504 MiB