2020牛客多校第六场 Grid Coloring

题目

https://ac.nowcoder.com/acm/contest/5671/G

思路

构造题 注意n==1 其他没啥好说的

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[210][210],b[210][210];
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		memset(a,0,sizeof a);
		memset(b,0,sizeof b);
		int n,k;
		cin>>n>>k;
		int m=2*(n+1)*n;
		if(k>m||(m%k!=0)||k==1||n==1) cout<<"-1"<<endl;
		else{
			int cnt=-1;
		//	cout<<1<<endl;
			for(int i=1;i<=n+1;i++){
				bool flag=0;
				for(int j=1;j<=n;j++){
					cnt++;
					a[i][j]=(cnt%k)+1;
					if(i!=1){
//						cout<<a[i-1][j]<<" "<<a[i][j]<<" "<<i<<" "<<j<<endl;
						if(j==1){if(a[i-1][j]==a[i][j]) flag=1;}
						else if((a[i-1][j]==a[i][j])||flag){
//							cout<<a[i][j]<<" "<<a[i][j-1]<<" "<<flag<<endl;
							swap(a[i][j],a[i][j-1]),flag=0;
//							cout<<a[i][j]<<" "<<a[i][j-1]<<" "<<flag<<endl;
							}
					//	cout<<flag<<" "<<a[i][j-1]<<" "<<a[i][j]<<endl;
					} 
				}
			}
			//cout<<2<<endl;
			for(int i=1;i<=n+1;i++){
				bool flag=0;
				for(int j=1;j<=n;j++){
					cnt++;
					b[i][j]=(cnt%k)+1; 
					if(i!=1){
						if(j==1){if(b[i-1][j]==b[i][j]) flag=1;}
						else if((b[i-1][j]==b[i][j])||flag){
	//						cout<<a[i][j]<<" "<<a[i][j-1]<<" "<<flag<<endl;
							swap(b[i][j],b[i][j-1]),flag=0;
//						cout<<a[i][j]<<" "<<a[i][j-1]<<" "<<flag<<endl;
						}
					}
				}
			}
		//	cout<<3<<endl;
			for(int i=1;i<=n+1;i++)
				for(int j=1;j<=n;j++) 
					cout<<a[i][j]<<" \n"[j==n];
			for(int i=1;i<=n+1;i++)
				for(int j=1;j<=n;j++) 
					cout<<b[i][j]<<" \n"[j==n];
		}
	}
    return 0;
}