题解

#include<bits/stdc++.h>
using namespace std;
int n;
int bl[9][9],tong[12]={0},ansx[7],ansy[7],yd[7];
bool bj[9][9];
void clean(){
	bool hasqc=true;
	while(hasqc){
		hasqc=false;
		bool dxl=true;
		while(dxl){
			dxl=false;
			for(int i=0;i<5;++i)
			for(int j=0;j<8;++j)
			if(bl[i][j]==0&&bl[i][j+1])
			bl[i][j]=bl[i][j+1],bl[i][j+1]=0,dxl=true;
		}
		memset(bj,0,sizeof bj);
		for(int i=0;i<5;++i)
		for(int j=0;j<8;++j){
			if(i&&i<4&&bl[i][j]&&bl[i][j]==bl[i-1][j]&&bl[i][j]==bl[i+1][j])
				bj[i][j]=bj[i-1][j]=bj[i+1][j]=hasqc=true;
			if(j&&bl[i][j]&&bl[i][j]==bl[i][j-1]&&bl[i][j]==bl[i][j+1])
			bj[i][j]=bj[i][j-1]=bj[i][j+1]=hasqc=true;
		}
		if(hasqc){
			for(int i=0;i<5;++i)
			for(int j=0;j<8;++j)
			if(bj[i][j])--tong[bl[i][j]],bl[i][j]=0;
		}
	}
}
void dfs(int now){
	if(now>n){
		for(int i=0;i<12;++i)
		if(tong[i])return;
		for(int i=1;i<=n;++i)
		cout<<ansx[i]<<' '<<ansy[i]<<' '<<yd[i]<<'\n';
		exit(0);
	}
	for(int i=0;i<12;++i)
	if(tong[i]&&tong[i]<3)return;
	int ylzt[9][9],yltong[12];
	for(int i=0;i<9;++i)for(int j=0;j<9;++j)
	ylzt[i][j]=bl[i][j];
	memcpy(yltong,tong,sizeof tong);
	for(int i=0;i<5;++i){
		for(int j=0;j<8;++j)
		if(ylzt[i][j]){
			if(i<4&&ylzt[i+1][j]!=ylzt[i][j]){
				memcpy(tong,yltong,sizeof tong);
				for(int i=0;i<9;++i)for(int j=0;j<9;++j)
				bl[i][j]=ylzt[i][j];
				int x=bl[i][j];
				bl[i][j]=bl[i+1][j];
				bl[i+1][j]=x;
				ansx[now]=i,ansy[now]=j,yd[now]=1;
				clean();
				dfs(now+1);
			}
			if(i&&!ylzt[i-1][j]){
				memcpy(tong,yltong,sizeof tong);
				for(int i=0;i<9;++i)for(int j=0;j<9;++j)
				bl[i][j]=ylzt[i][j];
				bl[i-1][j]=bl[i][j];
				bl[i][j]=0;
				ansx[now]=i,ansy[now]=j,yd[now]=-1;
				clean();
				dfs(now+1);
			}
		}
	}
	for(int i=0;i<9;++i)for(int j=0;j<9;++j)
	bl[i][j]=ylzt[i][j];
	memcpy(tong,yltong,sizeof tong);
}
int main(){
	cin>>n;
	for(int i=0;i<5;++i){
		int t;
		cin>>t;
		for(int j=0;t;++j){
			bl[i][j]=t;
			++tong[t];
			cin>>t;
		}
	}
	dfs(1);
	puts("-1");
	return 0;
}