5168. 【NOIP2017模拟6.26】冲击哥

Description

Input

Output

Sample Input

1 3

Sample Output

ABA

Data Constraint

n、m≤100

Solution

贪心。枚举每一块砖，如果这个位置为空，就填入字典序最小的砖块，然后将边长一格格拓展 如果当前右侧位置可以填入字典序更小的砖块，就不拓展 否则判断能否拓展并拓展。

Code1

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
using namespace std;

char ch[110][110];
int o[4][2]={{-1,0},{0,-1},{1,0},{0,1}};

char zx(int x,int y)
{
	for (char i='A';i<='D';i++)
	{
		bool b=true;
		for (int j=0;j<4;j++)
		if (ch[x+o[j][0]][y+o[j][1]]==i)
		{
			b=false;
			break;
		}
		if (b) return i;
	}
}

int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	
	for (int i=0;i<=n+1;i++)
	for (int j=0;j<=m+1;j++)
	ch[i][j]='.';
	
	for (int i=1;i<=n;i++)
	for (int j=1;j<=m;j++)
	if (ch[i][j]=='.')
	{
		int x;
		char t=zx(i,j);
		for (int k=1;k<=100;k++)
		{
			if (i+k-1>n || j+k-1>m || zx(i,j+k-1)!=t || ch[i][j+k-1]!='.')
			{
				x=k-1;
				break;
			}
		}
		
		for (int p=1;p<=x;p++)
		for (int q=1;q<=x;q++)
		ch[i+p-1][j+q-1]=t;
	}
	
	for (int i=1;i<=n;i++)
	{
		for (int j=1;j<=m;j++)
		printf("%c",ch[i][j]);
		printf("\n");
	}
}

 

Code2 

#include<cstdio> 
#include<cstring>
#include<algorithm>
#include<cmath>
#define N 110
using namespace std;
int n,m,x,y,k,c,a[N][N];
int color(int x,int y){
	for(int i=1;i<=26;i++){
		if(a[x+1][y]!=i&&a[x-1][y]!=i&&a[x][y-1]!=i&&a[x][y+1]!=i) return i;
	}
}
int main(){
	freopen("Shock brother.in","r",stdin);
	freopen("Shock brother.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]!=0) continue;
			c=a[i][j]=color(i,j);
			if(color(i,j+1)<c||a[i][j+1]!=0) continue;
			a[i][j]=0;
			for(x=i;x<=n;x++) if(color(x,j)>c) break;
			k=x-i;
			for(y=j;y<=m;y++) if(color(i,y)>c) break;
			k=min(k,y-j);
			for(int x=i;x<=i+k-1;x++){
				for(int y=j;y<=j+k-1;y++) a[x][y]=c;
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]==0) a[i][j]=a[i][j-1];
			printf("%c",'A'+a[i][j]-1);
		}
		printf("\n");
	}
	return 0;
}

---

---

作者：zsjzliziyang 
QQ:1634151125 
转载及修改请注明 
本文地址:https://blog.csdn.net/zsjzliziyang/article/details/83188469