Codeforces 439C Devu and Partitioning of the Array【大力讨论】

C. Devu and Partitioning of the Array

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Devu being a small kid, likes to play a lot, but he only likes to play with arrays. While playing he came up with an interesting question which he could not solve, can you please solve it for him?

Given an array consisting of distinct integers. Is it possible to partition the whole array into k disjoint non-empty parts such that p of the parts have even sum (each of them must have even sum) and remaining k - p have odd sum? (note that parts need not to be continuous).

If it is possible to partition the array, also give any possible way of valid partitioning.

Input

The first line will contain three space separated integers n, k, p (1 ≤ k ≤ n ≤ 10⁵; 0 ≤ p ≤ k). The next line will contain n space-separated distinct integers representing the content of array a: a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹).

Output

In the first line print "YES" (without the quotes) if it is possible to partition the array in the required way. Otherwise print "NO" (without the quotes).

If the required partition exists, print k lines after the first line. The i^th of them should contain the content of the i^th part. Print the content of the part in the line in the following way: firstly print the number of elements of the part, then print all the elements of the part in arbitrary order. There must be exactly p parts with even sum, each of the remaining k - p parts must have odd sum.

As there can be multiple partitions, you are allowed to print any valid partition.

Examples

Input

5 5 3
2 6 10 5 9

Output

YES
1 9
1 5
1 10
1 6
1 2

Input

5 5 3
7 14 2 9 5

Output

NO

Input

5 3 1
1 2 3 7 5

Output

YES
3 5 1 3
1 7
1 2

题目大意：

给你N个数，让你将其分成K组，使得其中P组的元素和为偶数，使得K-P组的元素和为奇数。

问是否存在这样一种分配集合的方式。

思路：

首先，我们知道：

奇数+奇数=偶数

偶数+偶数=偶数

偶数+奇数=奇数

很显然，假设我们已经分配好了这K个组合，然后多出来了很多个偶数，那么这些偶数放在哪个集合中任意数量，都不会影响其元素和的性质（该是偶数还是偶数，该是奇数还是奇数）；

所以我们不妨先处理奇数，分类讨论：

①奇数个数<k-p，无解。

②奇数个数==k-p，有解。

③奇数个数>k-p.也就是说现在的奇数多出来了，那么如果多出来的奇数的个数为奇数个，那么显然无解，否则有解。

有解的话那么多出来的奇数就可以两两配对变成偶数，同理两两配对组成的偶数放在任意集合中任意个数量，都不会影响其元素和的性质。 

注意元素的个数能否足够去组成这K个集合。

细节比较多，多注意P=0的情况。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<queue>
#include<vector>
using namespace std;
queue<int >ji;
queue<int >ou;
int n,k,p;
vector<int >ans[150000];
void Slove()
{
    int cnt=0;
    printf("YES\n");
    while(ji.size()>0)
    {
        if(cnt==k-p)break;
        int u=ji.front();
        ji.pop();
        if(cnt<k-p)ans[cnt++].push_back(u);
    }
    while(ji.size()>0)
    {
        if(cnt>=k)cnt--;
        int u=ji.front();
        ji.pop();
        int v=ji.front();
        ji.pop();
        if(cnt<k-1)ans[cnt].push_back(u),ans[cnt++].push_back(v);
        else ans[cnt].push_back(u),ans[cnt].push_back(v);
    }
    while(ou.size()>0)
    {
        if(cnt>=k)cnt--;
        int u=ou.front();
        ou.pop();
        if(cnt<k-1)ans[cnt++].push_back(u);
        else ans[cnt].push_back(u);
    }
    for(int i=0; i<k; i++)
    {
        printf("%d ",ans[i].size());
        for(int j=0; j<ans[i].size(); j++)
        {
            printf("%d ",ans[i][j]);
        }
        printf("\n");
    }
}
int main()
{
    while(~scanf("%d%d%d",&n,&k,&p))
    {
        for(int i=0; i<=k+1; i++)ans[i].clear();
        for(int i=1; i<=n; i++)
        {
            int x;
            scanf("%d",&x);
            if(x%2==1)ji.push(x);
            else ou.push(x);
        }
        if(ji.size()<k-p)
        {
            printf("NO\n");
        }
        if(ji.size()==k-p)
        {
            if(ou.size()>=p)
            {
                Slove();
            }
            else printf("NO\n");
        }
        if(ji.size()>k-p)
        {
            if((ji.size()-(k-p))%2==0)
            {
                int tmp=(ji.size()-(k-p))/2;
                if(tmp+ou.size()>=p)
                {
                    Slove();
                }
                else printf("NO\n");
            }
            else printf("NO\n");
        }
        return 0;
    }
}