Submission #590329

#	Time	Username	Problem	Language	Result	Execution time	Memory
590329		dnialh	Rope (JOI17_rope)	Pypy 3	0 / 100	47 ms	18592 KiB

rope

from collections import Counter

import sys as sus
input = sus.stdin.readline

n, m = map(int, input().split())
c = list(map(int, input().split()))

ct = Counter(c)
o = ct.most_common()
odd = Counter()
eve = Counter()

for i in range(n - 1):
    s = min(c[i], c[i + 1])
    b = max(c[i], c[i + 1])
    if i % 2:
        odd[(s << 20) |  b] += 1
    else:
        eve[(s << 20) |  b] += 1

out = []
for i in range(1, m + 1):
    res = 0
    for v, vc in o:
        if v == i:
            continue

        bl = odd[i << 20 | v] + odd[v << 20 | i]
        br = odd[v << 20 | i] + odd[i << 20 | v]

        bad = min(bl, br)

        res = max(res, vc - bad)

        if bad == 0:
            break
    out.append(n - res - ct[i])
print('\n'.join(map(str, out)))

• Subtask 1: 0 / 15
• Subtask 2: 0 / 30
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 20