Labels (how to label visited cells)

http://codeforces.com/problemset/problem/86/B

Tetris revisited
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Physicist Woll likes to play one relaxing game in between his search of the theory of everything.

Game interface consists of a rectangular n × m playing field and a dashboard. Initially some cells of the playing field are filled while others are empty. Dashboard contains images of all various connected (we mean connectivity by side) figures of 2, 3, 4 and 5 cells, with all their rotations and reflections. Player can copy any figure from the dashboard and place it anywhere at the still empty cells of the playing field. Of course any figure can be used as many times as needed.

Woll's aim is to fill the whole field in such a way that there are no empty cells left, and also... just have some fun.

Every initially empty cell should be filled with exactly one cell of some figure. Every figure should be entirely inside the board.

In the picture black cells stand for initially filled cells of the field, and one-colour regions represent the figures.


Input

First line contains integers n and m (1 ≤ n, m ≤ 1000) — the height and the width of the field correspondingly. Next n lines contain msymbols each. They represent the field in a natural way: j-th character of the i-th line is "#" if the corresponding cell is filled, and "." if it is empty.


Output

If there is no chance to win the game output the only number "-1" (without the quotes). Otherwise output any filling of the field by the figures in the following format: each figure should be represented by some digit and figures that touch each other by side should be represented by distinct digits. Every initially filled cell should be represented by "#".


Sample test(s)
input
2 3
...
#.#
output
000
#0#
input
3 3
.#.
...
..#
output
5#1
511
55#
input
3 3
...
.##
.#.
output
-1
input
1 2
##
output
##

Note

In the third sample, there is no way to fill a cell with no empty neighbours.

In the forth sample, Woll does not have to fill anything, so we should output the field from the input.







Greedy algorithm using 1*2 and 2*1, and then adjust the colors. Got AC without rigor. Purely SHUI GUO.

#include <cstdio>
#include <cstring>
#include <cctype>

char g[1000][1001];
bool vst[1000][1000];

void change_color(int n,int m,int x,int y)
{
	bool used[10]={0};
	char ch=g[x][y];
	used[ch-'0']=true;
	const int cx[]={-1,1,0,0};
	const int cy[]={0,0,1,-1};
	int qx[10],qy[10],front=0,rear=1;
	qx[0]=x,qy[0]=y;
	memset(vst,0,sizeof(vst));
	vst[x][y]=1;
	while(front<rear)
	{
		int i=qx[front],j=qy[front++];
		for(int k=0;k<4;k++)
		{
			int ii=i+cx[k],jj=j+cy[k];
			if(ii>=0 && ii<n && jj>=0 && jj<m)
			{
				if(g[ii][jj]==ch && !vst[ii][jj])
					vst[ii][jj]=1,qx[rear]=ii,qy[rear++]=jj;
				else if(isdigit(g[ii][jj]))
					used[g[ii][jj]-'0']=1;
			}
		}
	}
	for(int i=0;i<10;i++)
		if(!used[i])
		{
			for(int j=0;j<rear;j++)
				g[qx[j]][qy[j]]='0'+i;
			break;
		}
}

int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)
		scanf("%s",g[i]);
	for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
		{
			if(j+1<m && g[i][j]=='.' && g[i][j+1]=='.')
			{
				bool used[10]={0};
				if(i>0)
				{
					if(isdigit(g[i-1][j]))
						used[g[i-1][j]-'0']=true;
					if(isdigit(g[i-1][j+1]))
						used[g[i-1][j+1]-'0']=true;
				}
				if(i+1<n)
				{
					if(isdigit(g[i+1][j]))
						used[g[i+1][j]-'0']=true;
					if(isdigit(g[i+1][j+1]))
						used[g[i+1][j+1]-'0']=true;
				}
				if(j>0 && isdigit(g[i][j-1]))
					used[g[i][j-1]-'0']=true;
				if(j<m-1 && isdigit(g[i][j+1]))
					used[g[i][j+1]-'0']=true;
				for(int k=0;k<10;k++)
					if(!used[k])
					{
						g[i][j]=g[i][j+1]='0'+k;
						break;
					}
				j++;
			}
		}
	for(int j=0;j<m;j++)
		for(int i=0;i<n;i++)
		{
			if(i+1<n && g[i][j]=='.' && g[i+1][j]=='.')
			{
				bool used[10]={0};
				if(j>0)
				{
					if(isdigit(g[i][j-1]))
						used[g[i][j-1]-'0']=true;
					if(isdigit(g[i+1][j-1]))
						used[g[i+1][j-1]-'0']=true;
				}
				if(j+1<m)
				{
					if(isdigit(g[i][j+1]))
						used[g[i][j+1]-'0']=true;
					if(isdigit(g[i+1][j+1]))
						used[g[i+1][j+1]-'0']=true;
				}
				if(i>0 && isdigit(g[i-1][j]))
					used[g[i-1][j]-'0']=true;
				if(i<n-1 && isdigit(g[i+1][j]))
					used[g[i+1][j]-'0']=true;
				for(int k=9;k>=0;k--)
					if(!used[k])
					{
						g[i][j]=g[i+1][j]='0'+k;
						break;
					}
				i++;
			}
		}
	bool ans=true;
	for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
			if(g[i][j]=='.')
			{
				if(i>0 && isdigit(g[i-1][j]))
				{
					if(i+1<n && g[i+1][j]==g[i-1][j])
						change_color(n,m,i+1,j);
					if(j>0 && g[i][j-1]==g[i-1][j])
						change_color(n,m,i,j-1);
					if(j+1<m && g[i][j+1]==g[i-1][j])
						change_color(n,m,i,j+1);
					g[i][j]=g[i-1][j];
				}
				else if(i+1<n && isdigit(g[i+1][j]))
				{
					if(j>0 && g[i][j-1]==g[i+1][j])
						change_color(n,m,i,j-1);
					if(j+1<m && g[i][j+1]==g[i+1][j])
						change_color(n,m,i,j+1);
					g[i][j]=g[i+1][j];
				}
				else if(j>0 && isdigit(g[i][j-1]))
				{
					if(j+1<m && g[i][j+1]==g[i][j-1])
						change_color(n,m,i,j+1);
					g[i][j]=g[i][j-1];
				}
				else if(j+1<m && isdigit(g[i][j+1]))
				{
					g[i][j]=g[i][j+1];
				}
				else
				{
					ans=false;
					i=n,j=m;
				}
			}
	if(ans)
		for(int i=0;i<n;i++)
			puts(g[i]);
	else
		puts("-1");
	return 0;
}




Other solution:

#include<cstdio>
int n,m;char a[1111][1111];
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)scanf("%s",a[i]);
	for(int i=0;i<n;i++)
		for(int j=0;j<m-1;j++)
			if(a[i][j]=='.'&&a[i][j+1]=='.')
				a[i][j]=a[i][j+1]=(((i+j)&1)?('0'+(i%3*3+(j+1)%3)):('0'+(i%3*3+j%3)));
	for(int i=0;i<n-1;i++)
		for(int j=0;j<m;j++)
			if(a[i][j]=='.'&&a[i+1][j]=='.')
				a[i][j]=a[i+1][j]=(((i+j)&1)?('0'+((i+1)%3*3+j%3)):('0'+(i%3*3+j%3)));
	for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
			if(a[i][j]=='.')
			{
				if(i>0&&a[i-1][j]!='#'){a[i][j]=a[i-1][j];continue;}
				if(j>0&&a[i][j-1]!='#'){a[i][j]=a[i][j-1];continue;}
				if(i<n-1&&a[i+1][j]!='#'){a[i][j]=a[i+1][j];continue;}
				if(j<m-1&&a[i][j+1]!='#'){a[i][j]=a[i][j+1];continue;}
				puts("-1");return 0;
			}
	for(int i=0;i<n;i++)printf("%s\n",a[i]);
	return 0;
}


1、资源项目源码均已通过严格测试验证,保证能够正常运行; 2、项目问题、技术讨论,可以给博主私信或留言,博主看到后会第一时间与您进行沟通; 3、本项目比较适合计算机领域相关的毕业设计课题、课程作业等使用,尤其对于人工智能、计算机科学与技术等相关专业,更为适合; 4、下载使用后,可先查看REAdMe.md或论文文件(如有),本项目仅用作交流学习参考,请切勿用于商业用途。 5、资源来自互联网采集,如有侵权,私聊博主删除。 6、可私信博主看论文后选择购买源代码。 1、资源项目源码均已通过严格测试验证,保证能够正常运行; 2、项目问题、技术讨论,可以给博主私信或留言,博主看到后会第一时间与您进行沟通; 3、本项目比较适合计算机领域相关的毕业设计课题、课程作业等使用,尤其对于人工智能、计算机科学与技术等相关专业,更为适合; 4、下载使用后,可先查看REAdMe.md或论文文件(如有),本项目仅用作交流学习参考,请切勿用于商业用途。 5、资源来自互联网采集,如有侵权,私聊博主删除。 6、可私信博主看论文后选择购买源代码。 1、资源项目源码均已通过严格测试验证,保证能够正常运行; 2、项目问题、技术讨论,可以给博主私信或留言,博主看到后会第一时间与您进行沟通; 3、本项目比较适合计算机领域相关的毕业设计课题、课程作业等使用,尤其对于人工智能、计算机科学与技术等相关专业,更为适合; 4、下载使用后,可先查看READme.md或论文文件(如有),本项目仅用作交流学习参考,请切勿用于商业用途。 5、资源来自互联网采集,如有侵权,私聊博主删除。 6、可私信博主看论文后选择购买源代码。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值