AtCoder Beginner Contest 177 F - I hate Shortest Path Problem

题目链接
Problem Statement
There is a grid of squares with $H+1$ horizontal rows and $W$ vertical columns.

You will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer $i$ from $1$ through $H$, you cannot move down from the $A_i$-th, $(Ai+1)$-th, $\dots$, $B_i$-th squares from the left in the $i$-th row from the top.

For each integer $k$ from $1$ through $H$, find the minimum number of moves needed to reach one of the squares in the $(k+1)$-th row from the top. (The starting square can be chosen individually for each case.) If, starting from any square in the top row, none of the squares in the $(k+1)$-th row can be reached, print $-1$ instead.

Constraints

• $1\le H,W\le 2\times 10^5$
• $1\le A_i\le B_i\le W$

Input
Input is given from Standard Input in the following format:

$H$ $W$
$A_1$ $B_1$
$A_2$ $B_2$
${}_{.}^{.}$
$A_H$ $B_H$

Output
Print $H$ lines. The $i$-th line should contain the answer for the case $k=i$.

Sample Input 1

4 4
2 4
1 1
2 3
2 4

Sample Output 1

1
3
6
-1

Let $(i,j)$ denote the square at the $i$-th row from the top and $j$-th column from the left.

For $k=1$, we need one move such as $(1,1)\to (2,1)$.

For $k=2$, we need three moves such as $(1,1)\to (2,1)\to (2,2)\to (3,2)$.

For $k=3$, we need six moves such as $(1,1)\to (2,1)\to (2,2)\to (3,2)\to (3,3)\to (3,4)\to (4,4)$.

For $k=4$, it is impossible to reach any square in the fifth row from the top.

建一棵线段树，位置$x$的值$t[x]$为从第一行到第$i$行需要在水平方向移动的最小距离。
$now$表示从第一行到能到达第$i$行的列号的最小值。
对于第$i$行，设第$i-1$行禁止向下走的区间为$[l,r]$，则：

• 如果$now<l$，则对于区间$[l,r]$，由于禁止向下走，不能直接从$i-1$行转移过来，而是从$(i-1,l-1)$转移过来，对于$x\in [l,r]$，$t[x]$需要在$t[l-1]$的基础上加上$x-l+1$。
• 如果$now\in [l,r]$，则第$i$行位于区间$[now,r]$内的所有点都不能到达，直接设为$\infty$，将$now$设为$r+1$。
• 如果$now\in (r,m]$，则对结果无影响。
• 如果$now>m$则不可到达第$i$行，$i$行及后面都输出$-1$。

然后答案为线段树维护区间内的最小值。
时间复杂度为$O(H\log W)$。

#include<bits/stdc++.h>

#define INF 0x3f3f3f3f
using namespace std;

inline int qr() {
    int f = 0, fu = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-')fu = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        f = (f << 3) + (f << 1) + c - 48;
        c = getchar();
    }
    return f * fu;
}


const int N = 2e5 + 10;

struct Seg_Tree {
    struct T {
        int l, r, ans, add;
    } t[N * 4];

    void build(int p, int l, int r) {
        t[p].l = l, t[p].r = r, t[p].ans = t[p].add = 0;
        if (l == r) return;
        int mid = (l + r) >> 1;
        build(p << 1, l, mid);
        build(p << 1 | 1, mid + 1, r);
    }

    void spread(int p) {
        if (t[p].add) {
            t[p << 1].ans = t[p].l - t[p].add;
            t[p << 1].add = t[p].add;
            t[p << 1 | 1].ans = ((t[p].l + t[p].r) >> 1) + 1 - t[p].add;
            t[p << 1 | 1].add = t[p].add;
            t[p].add = 0;
        }
    }

    void change(int p, int l, int r, int c) {
        if (l <= t[p].l && t[p].r <= r) {
            t[p].ans = t[p].l - c, t[p].add = c;
            return;
        }
        spread(p);
        int mid = (t[p].l + t[p].r) >> 1;
        if (l <= mid)change(p << 1, l, r, c);
        if (r > mid)change(p << 1 | 1, l, r, c);
        t[p].ans = min(t[p << 1].ans, t[p << 1 | 1].ans);
    }

    int ask(int p, int x) {
        if (t[p].l == t[p].r)return x - t[p].ans;
        spread(p);
        int mid = (t[p].l + t[p].r) >> 1;
        return x <= mid ? ask(p << 1, x) : ask(p << 1 | 1, x);
    }
} tr;

int n, m, now = 1;

int main() {
    n = qr(), m = qr();
    tr.build(1, 1, m);
    for (int i = 1; i <= n; ++i) {
        int l = qr(), r = qr();
        if (now >= l && now <= r)tr.change(1, now, r, -INF), now = r + 1;
        else if (now < l)tr.change(1, l, r, tr.ask(1, l - 1));
        if (now > m) {
            for (int j = i; j <= n; ++j)puts("-1");
            return 0;
        }
        printf("%d\n", i + tr.t[1].ans);
    }
    return 0;
}