Odd Selection——Codeforces Round #646 (Div. 2)

A. Odd Selection——Codeforces Round #646 (Div. 2)

Shubham has an array a of size n, and wants to select exactly x elements from it, such that their sum is odd. These elements do not have to be consecutive. The elements of the array are not guaranteed to be distinct.

Tell him whether he can do so.

Input
The first line of the input contains a single integer t (1≤t≤100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains two integers n and x (1≤x≤n≤1000) — the length of the array and the number of elements you need to choose.

The next line of each test case contains n integers a1,a2,…,an (1≤ai≤1000) — elements of the array.

Output
For each test case, print “Yes” or “No” depending on whether it is possible to choose x elements such that their sum is odd.

You may print every letter in any case you want.

Example
inputCopy
5
1 1
999
1 1
1000
2 1
51 50
2 2
51 50
3 3
101 102 103
outputCopy
Yes
No
Yes
Yes
No
Note
For 1st case: We must select element 999, and the sum is odd.

For 2nd case: We must select element 1000, so overall sum is not odd.

For 3rd case: We can select element 51.

For 4th case: We must select both elements 50 and 51 — so overall sum is odd.

For 5th case: We must select all elements — but overall sum is not odd.

题目大意：从n个数中选择x个使他们的和为奇数。 这些元素不必是连续的。 数组的元素不能保证是不同的。

AC代码：
用了分类讨论，对偶数的个数进行分类，然后每一项进行讨论。
注意：偶数的和一定是偶数，奇数+奇数 = 偶数，奇数+奇数+奇数 = 奇数
奇数个奇数的和为奇数，偶数个奇数的和为偶数。
写得不是很好。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;

int a[1005];
int main()
{
    int t;
    int x,n;
    int odd,even;
    scanf("%d",&t);
    while(t--){
        odd = even = 0;
        scanf("%d%d",&n,&x);
        for(int i=0; i<n; ++i)
            scanf("%d",&a[i]);
        for(int i=0; i<n; ++i){  //先计算出偶数和奇数的个数
            if(a[i]%2==0)
                even++;
            else
                odd++;
        }

        int flag = 0;
        if(even<x){		//分类讨论
            if((x-even)%2==1){
                if(odd>=x-even)
                    flag = 1;
            }
            else if((x-even)%2==0){
                if(even!=0){
                    even--;   //被挑选的偶数减一
                }
                if(odd>=x-even && (x-even)%2==1)
                    flag = 1;
            }
        }
        else if(even==x && odd>0){
            flag = 1;
        }
        else if(even>x){
            if(odd>0)
                flag = 1;
        }
        if(flag){
            printf("Yes\n");
        }
        else
            printf("No\n");
    }
    return 0;
}

官方题解写得比较好：

#include <bits/stdc++.h>
using namespace std;
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
 
const int N = 2e5 + 5;
 
int n, x;
int a[N], f[2];
 
int32_t main()
{
	IOS;
	int t;
	cin >> t;
	while(t--)
	{
	    f[0] = f[1] = 0;
    	cin >> n >> x;
    	for(int i = 1; i <= n; i++)
    	{
    		cin >> a[i];
    		f[a[i] % 2]++;  
    	}
    	bool flag = 0;
    	for(int i = 1; i <= f[1] && i <= x; i += 2) //Fix no of odd
    	{
    	//对奇数个数进行枚举，i+=2,避免了偶数个奇数的和不符合题意
    		int have = f[0], need = x - i;  //计算出当前需要的奇数个数
    		if(need <= f[0])		//如果需要的奇数个数小于有的
    	        flag = 1;
    	}
    	if(flag)
    	    cout << "Yes" << endl;
    	else
    	    cout << "No" << endl;
	}
	return 0;
}