如果一个整数序列 $a_1, a_2, \dots, a_n$ 中任意 $k$ 个连续项之和均为偶数，则称该序列为 $k$-偶序列。
给定一个序列，我们希望求出最少需要修改多少项，才能使该序列变为 $k$-偶序列。
第一行包含两个整数 $n$ 和 $k$ ($1 \le k \le n \le 1\,000\,000$)。第二行包含一个由 $n$ 个整数组成的序列 $a_1, a_2, \dots, a_n$。对于每个 $a_i$，满足 $0 \le a_i \le 1\,000\,000\,000$。
输出仅一行，包含一个整数：使序列变为 $k$-偶序列所需修改的最少项数。
8 3 1 2 3 4 5 6 7 8
3
8 3 2 4 2 4 2 4 2 4
0
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: