# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
590325 |
2022-07-05T20:38:09 Z |
dnialh |
Rope (JOI17_rope) |
PyPy 3 |
|
48 ms |
18652 KB |
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 | v] + odd[i << 20 | i]
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)))
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
18516 KB |
Output is correct |
2 |
Correct |
48 ms |
18556 KB |
Output is correct |
3 |
Incorrect |
43 ms |
18652 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
18516 KB |
Output is correct |
2 |
Correct |
48 ms |
18556 KB |
Output is correct |
3 |
Incorrect |
43 ms |
18652 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
18516 KB |
Output is correct |
2 |
Correct |
48 ms |
18556 KB |
Output is correct |
3 |
Incorrect |
43 ms |
18652 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
18516 KB |
Output is correct |
2 |
Correct |
48 ms |
18556 KB |
Output is correct |
3 |
Incorrect |
43 ms |
18652 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
18516 KB |
Output is correct |
2 |
Correct |
48 ms |
18556 KB |
Output is correct |
3 |
Incorrect |
43 ms |
18652 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |