2020/5/11 每日一咕

2020/5/11 每日一咕

1.线段树优化dp

Problem - 1216F - Codeforces (Unofficial mirror site by GGAutomaton, accelerated for Chinese users)
You work as a system administrator in a dormitory, which has $n$ rooms one after another along a straight hallway. Rooms are numbered from $1$ to $n$.

You have to connect all $n$ rooms to the Internet.

You can connect each room to the Internet directly, the cost of such connection for the $i$-th room is $i$ coins.

Some rooms also have a spot for a router. The cost of placing a router in the $i$-th room is also $i$ coins. You cannot place a router in a room which does not have a spot for it. When you place a router in the room $i$, you connect all rooms with the numbers from $max(1,i-k)$ to $min(n,i+k)$ inclusive to the Internet, where $k$ is the range of router. The value of $k$ is the same for all routers.

Calculate the minimum total cost of connecting all $n$ rooms to the Internet. You can assume that the number of rooms which have a spot for a router is not greater than the number of routers you have.

Input

The first line of the input contains two integers $n$ and $k$ $(1\le n,k\le 2\cdot 10^5)$ — the number of rooms and the range of each router.

The second line of the input contains one string $s$ of length $n$, consisting only of zeros and ones. If the $i$-th character of the string equals to ‘1’ then there is a spot for a router in the $i$-th room. If the $i$-th character of the string equals to ‘0’ then you cannot place a router in the $i$-th room.

Output

Print one integer — the minimum total cost of connecting all $n$ rooms to the Internet.

Examples

input

5 2
00100

output

3

input

6 1
000000

output

21

input

4 1
0011

output

4

input

12 6
000010000100

output

15

Note

In the first example it is enough to place the router in the room $3$, then all rooms will be connected to the Internet. The total cost of connection is $3$.

In the second example you can place routers nowhere, so you need to connect all rooms directly. Thus, the total cost of connection of all rooms is $1+2+3+4+5+6=21$.

In the third example you need to connect the room $1$ directly and place the router in the room $3$. Thus, the total cost of connection of all rooms is $1+3=4$.

In the fourth example you need to place routers in rooms $5$ and $10$. Then all rooms will be connected to the Internet. The total cost of connection is $5+10=15$.

题意

有n个房间，每个房间$i$都可以花费$i$使其直连网络。某些特定的房间可以花费$i$装一个路由，有效半径为k，即$max(1,i-k)$ ~ $min(n,i+k)$都可以因此连上网络，求让所有房间都连上网络的最小花费。

设$dp[i][01]$为第$i$个房间放置路由器与否的最小花费。
则不放路由器的房间，要么从前一个不放的+i得到，要么被前面某个路由的包含。
即 d p [ i ] [ 0 ] = m i n ( d p [ i − 1 ] [ 0 ] , m i n { d p [ 区 间 [ m a x ( 1 , i − k ) , i − 1 ]   ] [ 1 ] } ) dp[i][0]=min(dp[i-1][0],min\{ dp[区间[max(1,i-k),i-1]\ ][1]\}) dp[i][0]=min(dp[i−1][0],min{dp[区间[max(1,i−k),i−1] ][1]})
放路由的则前面k个放不放都无所谓，所以只要在前面有效半径-1里找一个最小值即可
d p [ i ] [ 1 ] = m i n { d p [ 区 间 [ m a x ( i − k − 1 , 0 ) , i − 1 ]   ] [ 01 ] } + i dp[i][1]=min\{dp[区间[max(i-k-1,0),i-1]\ ][01]\}+i dp[i][1]=min{dp[区间[max(i−k−1,0),i−1] ][01]}+i
可以看到这里需要一个带修的区间最值查询，而且有两个，上两颗线段树解决。
因为线段树是从1开始建的，所以会查询到0的时候特殊处理一下为0。

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    segment_Tree_min T(n), T1(n);
    T.build(1, n);
    T1.build(1, n);
    vector<vector<ll>> dp(n + 1, vector<ll>(2, inf));
    dp[0][0] = 0;
    for (int i = 1; i <= n; ++i) {
        dp[i][0] = min(dp[i - 1][0] + i, T1.query(max(1, i - k), i - 1));
        if (s[i - 1] == '1') {
            if (i - k - 1 <= 0) {
                dp[i][1] = 0;
            } else {
                dp[i][1] = min(T.query(i - k - 1, i - k - 1),
                               T1.query(i - k - 1, i - k - 1));
            }
            dp[i][1] += i;
            T1.updata(i, i, dp[i][1]);
        }
        T.updata(i, i, dp[i][0]);
    }
    cout << min(dp[n][0], dp[n][1]) << endl;
    return 0;
}