CF1515A.Phoenix and Gold

入门

通过率:0%

时间限制:2.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Phoenix has collected nn pieces of gold, and he wants to weigh them together so he can feel rich. The ii-th piece of gold has weight wiw_i. All weights are distinct. He will put his nn pieces of gold on a weight scale, one piece at a time.

The scale has an unusual defect: if the total weight on it is exactly xx, it will explode. Can he put all nn gold pieces onto the scale in some order, without the scale exploding during the process? If so, help him find some possible order.

Formally, rearrange the array ww so that for each ii (1≤i≤n)(1 \le i \le n), ∑j=1iwj≠x\sum\limits_{j = 1}^{i}w_j \ne x.

凤凰收集了 nn 块金子,他想将它们一起称重,以感受自己的富有。第 ii 块金子的重量为 wiw_i,所有重量互不相同。他将把这 nn 块金子依次放到秤上,每次放一块。

该秤存在一个特殊缺陷:若秤上的总重量恰好为 xx,则秤会爆炸。他能否以某种顺序将全部 nn 块金子放到秤上,使得整个过程中秤都不会爆炸?如果可以,请帮他找出一种可行的放置顺序。

形式化地说:请重排数组 ww,使得对每个 ii(1≤i≤n1 \le i \le n),均有 ∑j=1iwj≠x\sum\limits_{j = 1}^{i}w_j \ne x。

输入格式

The input consists of multiple test cases. The first line contains an integer tt (1≤t≤10001 \le t \le 1000) — the number of test cases.

The first line of each test case contains two integers nn and xx (1≤n≤1001 \le n \le 100; 1≤x≤1041 \le x \le 10^4) — the number of gold pieces that Phoenix has and the weight to avoid, respectively.

The second line of each test case contains nn space-separated integers (1≤wi≤100)(1 \le w_i \le 100) — the weights of the gold pieces. It is guaranteed that the weights are pairwise distinct.

输入包含多个测试用例。第一行包含一个整数 tt(1≤t≤10001 \le t \le 1000),表示测试用例的数量。

每个测试用例的第一行包含两个整数 nn 和 xx(1≤n≤1001 \le n \le 100;1≤x≤1041 \le x \le 10^4),分别表示凤凰拥有的金块数量以及需要避开的重量值。

每个测试用例的第二行包含 nn 个用空格分隔的整数(1≤wi≤1001 \le w_i \le 100),表示各金块的重量。保证所有重量两两互不相同。

输出格式

For each test case, if Phoenix cannot place all nn pieces without the scale exploding, print NO. Otherwise, print YES followed by the rearranged array ww. If there are multiple solutions, print any.

对于每个测试用例,如果凤凰无法在不使天平爆炸的情况下放置全部 nn 个砝码,则输出 NO。否则,输出 YES,后跟重排后的数组 ww。若存在多种解法,输出任意一种即可。

输入输出样例

  • 输入#1

    3
    3 2
    3 2 1
    5 3
    1 2 3 4 8
    1 5
    5

    输出#1

    YES
    3 2 1
    YES
    8 1 2 3 4
    NO

说明/提示

In the first test case, Phoenix puts the gold piece with weight 33 on the scale first, then the piece with weight 22, and finally the piece with weight 11. The total weight on the scale is 33, then 55, then 66. The scale does not explode because the total weight on the scale is never 22.

In the second test case, the total weight on the scale is 88, 99, 1111, 1414, then 1818. It is never 33.

In the third test case, Phoenix must put the gold piece with weight 55 on the scale, and the scale will always explode.

在第一个测试用例中,凤凰首先将重量为 33 的金块放在天平上,然后放上重量为 22 的金块,最后放上重量为 11 的金块。此时天平上的总重量依次为 33、55、66。天平不会爆炸,因为天平上的总重量从未等于 22。

在第二个测试用例中,天平上的总重量依次为 88、99、1111、1414、1818。其值从未等于 33。

在第三个测试用例中,凤凰必须将重量为 55 的金块放在天平上,此时天平总会爆炸。

输入解题思路,AI测评打分。不知道怎么写?

首页