2019杭电多校第四场 divide the stones

首先如果石子的总数不能被k整除必然无解，反之必然有解，此处注意n==k以及k=1的特殊情况。
然后分两种令m=n/k，若m为偶数则，前m/2行顺序取，后m/2行逆序取。每行取一个即为合并后的一堆石子。

若为奇数，则只考虑虑前三行，因为后m-3行必然为偶数的情况。前三行的话只需前两个按顺序取，最后一个拿平均数减一下就好了。

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<bitset>
#include<algorithm>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ull unsigned long long
#define endl '\n'
#define clr(a, b) memset(a, b, sizeof(a))
#define lowbit(x) x & -x
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define PB push_back
#define POP pop_back
const double pi = acos(-1);
const int maxn = 1e5 + 10;
const int maxm = (maxn<<5) + 5;
const ll mod = 998244353;
const int hash_mod = 19260817;
int T, n, k;
int main()
{
    //freopen("E://1005.in","r",stdin); //输入重定向，输入数据将从in.txt文件中读取
    //freopen("E://outt.txt","w",stdout); //输出重定向，输出数据将保存在out.txt文件中
    scanf("%d", &T);
    while(T --){
        scanf("%d %d", &n, &k);
        if(k == 1){
            cout << "yes" << endl;
            for(int i = 1 ; i <= n ; ++ i) cout << i << ' ';
            cout << endl;
        }
        else if((1LL*n*(n+1)/2) % k != 0 || n == k) cout << "no" << endl;
        else{
            cout << "yes" << endl;
            int m = n / k;
            if(m & 1){
                int id = 1;
                while(id <= k){
                    int tmp = (1+3LL*k)*(3LL*k)/(2*k);
                    int u = id;
                    int v = k + (id + k/2 - 1) % k + 1;
                    int w = tmp - u - v;
                    cout << u << ' ' << v << ' ' << w << ' ';
                    for(int i = 4 ; i <= min(m, (4+m)/2) ; ++ i){
                        cout << ((i-1)*k+id) << ' ';
                    }
                    for(int i = (4+m)/2 + 1 ; i <= m ; ++ i){
                        cout << ((i-1)*k+k-id+1) << ' ';
                    }
                    cout << endl;
                    id ++;
                }
            }
            else{
                int id = 1;
                while(id <= k){
                    for(int i = 1 ; i <= m / 2 ; ++ i){
                        cout << ((i-1)*k+id) << ' ';
                    }
                    for(int i = m / 2 + 1 ; i <= m ; ++ i){
                        cout << ((i-1)*k+k-id+1) << ' ';
                    }
                    cout << endl;
                    id ++;
                }
            }
        }
    }
    return 0;
}