oj.uz

Submission #590335

# Submission time Handle Problem Language Result Execution time Memory
590335 2022-07-05T20:55:19 Z dnialh Rope (JOI17_rope) PyPy 3
0 / 100
 41 ms 18604 KB 
from collections import Counter

import sys as sus
input = sus.stdin.readline

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

c = list(range(1, m + 1))
c = list(map(int, input().split()))

for i in range(n):
    c[i] = (i * i + i ** 5) % m
    c[i] += 1

ct = Counter(c)
ctl = [0] * (m + 1)
for i in range(1, m + 1):
    ctl[i] = ct[i]
o = ct.most_common()

del ct

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

for v in eve:
    odd[v] = min(odd[v], eve[v])
    
del eve

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 = eve[(i << 20) | v] + eve[v << 20 | i]

        bad = bl
        #bad = min(bl, br)

        res = max(res, vc - bad)

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

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 18604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 18604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 18604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 18604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 18604 KB Output isn't correct
2 Halted 0 ms 0 KB -