CodeForces-code/CF_1363_A.cpp at main · codesmith25103/CodeForces-code · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
    int size, k;
        cin>>size>>k;
        int odd=0, even=0;
        vector<int> vec(size);
        for(int i=0; i<size; i++)
        {
            cin>>vec[i];
        }
        for(int i=0; i<size; i++)
        {
            if(vec[i]%2==0)
            {
                even++;
            }
            else
            {
                odd++;
            }
        }
        if(odd==0)
        {
            cout<<"No"<<endl;
            return;
        }
        k--;
        odd--;

        if(k==0)
        {
            cout<<"Yes"<<endl;
            return;
        }
        if(k<=even)
        {
            cout<<"Yes"<<endl;
            return;
        }
        k=k-even;
        if(k%2==0)
        {
            cout<<"Yes"<<endl;
            return;
        }
        else
        {
            if(even>0 && odd>=2)
            {
                cout<<"Yes"<<endl;
                return;
            }
            else
            {
                cout<<"No"<<endl;
                return;
            }
        }

}
int main()
{
    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();

    }
    return 0;
}