B. Same Parity Summands(cf构造题)

Problem - 1352B - Codeforces

输入

8
10 3
100 4
8 7
97 2
8 8
3 10
5 3
1000000000 9

输出

YES
4 2 4
YES
55 5 5 35
NO
NO
YES
1 1 1 1 1 1 1 1
NO
YES
3 1 1
YES
111111110 111111110 111111110 111111110 111111110 111111110 111111110 111111110 111111120

给定一个总和 n，和k个位置，要求k个数的和等于n，且每个数的奇偶性相同

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#define x first
#define y second
#define fu(i,a,b) for(int i=a;i<=b;i ++ )
#define fd(i,a,b) for(int i=a;i>=b;i -- )
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<LL,LL> PLL;
//typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 4e4+ 10,M = 1e5 + 10,INF = 0x3f3f3f3f ;
const int mod = 1e9;
const double eps = 1e-8;


int n,m,p[N];


inline void solve()
{
    cin >> n>> m;
    
    // n为偶数 
    if(n % 2 == 0&& n >= 2 * m )
    {
        cout <<"YES\n";
        fu(i,0,m-1) 
        cout << (i?2:n-2 * (m-1) ) <<" \n"[i==m-1];
// n中提出 m-1个2 （2 * (m-1) 是偶数）, 剩余的一个数也是偶数 
    }
    else if(n % 2 == m % 2 && n >= m)
    // n 和 m 奇偶性相同 , n 和m-1奇偶性不同  n-(m-1) 为奇数  
    {
        cout <<"YES\n";
        fu(i,0,m-1)
        cout << (i?1:n - (m-1))<<" \n"[i == m-1];
        
    }
    else 
    cout <<"NO\n";
}


signed main()
{
//  freopen("1.txt","w",stdout);
     ios

    int t=1;
    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}