Fluctuation Limit

最新推荐文章于 2020-08-17 21:51:00 发布

Amber0130

最新推荐文章于 2020-08-17 21:51:00 发布

阅读量225

点赞数

分类专栏：构造文章标签： acm竞赛

本文链接：https://blog.csdn.net/weixin_43601103/article/details/108047941

版权

构造专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Fluctuation Limit

Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Special Judge

Problem Description

Cuber QQ has signed up for a gambling game, that challenges him to predict the stock price of Quber CC Limited, for the next following $n$ days. He shall make his prediction by filling a table with $n$ intervals, the $i$ -th of which is the predicted interval $l_i,r_i]$ at the $i$ -th day. If all $n$ prices lie in the corresponding interval, Cuber QQ will win 1 million dollars. Otherwise, he will not earn a single penny.

As is well known, the stock price has a fluctuation limit. For simplicity, we assume the limit up and the limit down are both $k$ , which is an integer. That means, if the stock price at the $i$ -th day is $x$ , the price at the $i + 1$ -th day is at most $x + k$ and at least $x - k$ .

Cuber QQ wants to know whether it is possible to manipulate the stock price, without breaking the limitation above of course, so that he can have the 1 million dollars. Since his table has already been submitted, he cannot modify his predicted intervals any more. It has to be done secretly behind the scenes, and smartly cover it up so that no one will notice.

Input

The input starts with an integer $T (1≤T≤10^5)$ , denoting the number of test cases.

For each test case, the first line contains two space-separated integers $n$ and $k$ $2≤n≤10^5, 0≤k≤10^9)$ , where $n$ is the number of days and $k$ is the fluctuation limit.

The $i$ -th line of the next n lines contains two space-separated integers $l_i$ and $ri (0≤l_i≤r_i≤10^9)$ , which is Cuber QQ’s predicted interval in the $i$ -th day. A prediction is believed to be correct if the stock price $i$ -th day lies between $l_i$ and $r_i$ , inclusive.

It is guaranteed that the sum of all $n$ does not exceed $10^6$ .

Output

For each test case, first output a single line YES or NO, that states whether Cuber QQ will win the 1 million price.

If YES, in the next line, output a possible price series, $a_1,a_2,…,an$ , where $l_i≤a_i≤r_i (1≤i≤n)$ and $a_i−a_{i+1}|≤k (1≤i≤n−1)$ . The integers should be separated with space.

Sample Input

Sample Output

YES
2 3 3
NO

思路

如果 $i$ 是在 $[l, r]$ 范围内, 那么 $i + 1$ 必须要在 $[l - k, r + k]$ 范围内．这是因为如果 $i + 1$ 选了范围外的值, $i$ 就无解了．
这样可以从左往右, 把左边的约束带到右边．再从右往左做一遍．最后剩下的区间应该就是可行域．因为题目只要求一种方案, 全部选最低的即可．复杂度 $O (n)$ ．

#pragma GCC optimize(3,"Ofast","inline")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <map>
#include <algorithm>
#include <unordered_map>
using namespace std;
#define ls (rt<<1)
#define rs (rt<<1|1)
typedef long long ll;
template <typename T>
inline void read(T &x) {
    x = 0;
    static int p;
    p = 1;
    static char c;
    c = getchar();
    while (!isdigit(c)) {
        if (c == '-')p = -1;
        c = getchar();
    }
    while (isdigit(c)) {
        x = (x << 1) + (x << 3) + (c - 48);
        c = getchar();
    }
    x *= p;
}
template <typename T>
inline void print(T x) {
    if (x<0) {
        putchar('-');
        x=-x;
    }
    static int cnt;
    static int a[50];
    cnt = 0;
    do {
        a[++cnt] = x % 10;
        x /= 10;
    } while (x);
    for (int i = cnt; i >= 1; i--)putchar(a[i] + '0');
    putchar(' ');
    //puts("");
}
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int maxn = 5e5+10;
int n,k;
int l[maxn],r[maxn];
inline void work() {
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; i++) {
        scanf("%d%d", &l[i], &r[i]);
    }
    for (int i = 2; i <= n; i++) {
        l[i] = max(l[i], l[i - 1] - k);
        r[i] = min(r[i], r[i - 1] + k);
    }
    for (int i = n - 1; i >= 1; i--) {
        l[i] = max(l[i], l[i + 1] - k);
        r[i] = min(r[i], r[i + 1] + k);
    }
    int flag = 0;
    for (int i = 1; i <= n; i++) {
        if (l[i] > r[i]) {
            flag = 1;
            break;
        }
    }
    if (!flag) {
        puts("YES");
        for (int i = 1; i <= n; i++) printf("%d ", l[i]);
        printf("\n");
    } else puts("NO");
}
int main() {
    int T = 1;
    scanf("%d", &T);
    while (T--) {
        work();
    }
    return 0;
}