Codeforces Round #664 (Div. 2) A. Boboniu Likes to Color Balls

题目链接

思路：

想要满足题意则有：所有颜色的球的数量都是偶数且至多只有一种颜色的球的数量是奇数。所以我们只需要探讨初始情况和进行一次操作后是否满足上述条件即可。

代码：

#include<bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=355;
const int M=2e4+5;
const double eps=1e-8;
const int mod=998244353;
const int inf=0x7fffffff;
const double pi=3.1415926;
using namespace std;
int n,m,i,j,k,a[N];
signed main()
{
    IOS;
    int t;
    cin>>t;
    while(t--)
    {
        int flag=0,ok=0,mi=inf;
        for(i=1;i<=4;i++)
            cin>>a[i];
        for(i=1;i<=4;i++)
        {
            if(a[i]&1)
                flag++;
            mi=min(mi,a[i]);
        }
        if(flag==4)
            cout<<"YES"<<endl;
        else if(flag==3&&mi)
            cout<<"YES"<<endl;
        else if(flag==3&&mi==0&&a[4]==0)
            cout<<"YES"<<endl;
        else if(flag==1)
            cout<<"YES"<<endl;
        else if(flag==0)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}

本文地址：https://blog.csdn.net/ACkingdom/article/details/108114798