GYM 101350D. Magical Bamboos

最新推荐文章于 2020-07-10 20:56:14 发布

原创最新推荐文章于 2020-07-10 20:56:14 发布 · 301 阅读

0 ·

CC 4.0 BY-SA版权

online judge CodeForces 专栏收录该内容

82 篇文章

订阅专栏

探讨了一道有趣的算法问题：在魔法森林中，玩家能否通过特定操作使所有竹子的高度相同。解答了该问题的关键在于理解竹子高度变化的规律，并提供了一个简洁的C++实现方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

D. Magical Bamboos

题目描述

In a magical forest, there exists N bamboos that don’t quite get cut down the way you would expect.

Originally, the height of the ith bamboo is equal to hi. In one move, you can push down a bamboo and decrease its height by one, but this move magically causes all the other bamboos to increase in height by one.

If you can do as many moves as you like, is it possible to make all the bamboos have the same height?

输入

The first line of input is T – the number of test cases.

The first line of each test case contains an integer N (1 ≤ N ≤ 105) - the number of bamboos.

The second line contains N space-separated integers hi (1 ≤ hi ≤ 105) - the original heights of the bamboos.

输出

For each test case, output on a single line “yes” (without quotes), if you can make all the bamboos have the same height, and “no” otherwise.

样例

inputCopy
2
3
2 4 2
2
1 2
outputCopy
yes
no

题意

简单分析一下我们就会发现明显这个只要所有数的奇偶性质一样就可以了

AC代码

#include <cstdio>
#include <cstring>
#include<algorithm>
using namespace std;
bool cmp(int a,int b){
    return a>b;
}
const int MAXN =1e5+10;
int arr[MAXN];
int main(){
    int t;
    scanf("%d",&t);
    while (t--){
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++) scanf("%d",&arr[i]);
        sort(arr,arr+n,cmp);
        int flag=1;
        for(int i=1;i<n;i++){
            if((arr[i]-arr[i-1])&1) {
                flag=0;break;
            }
        } 
        if(flag) puts("yes");
        else puts("no");
    }
    return 0;