CSPCCF201604-2俄罗斯方块模拟题详细解题思路

最新推荐文章于 2022-02-27 11:40:01 发布

九筒-

最新推荐文章于 2022-02-27 11:40:01 发布

阅读量578

点赞数

分类专栏： CSPCCF 文章标签：算法 csp

本文链接：https://blog.csdn.net/weixin_44343282/article/details/103529589

版权

CSPCCF 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

CSPCCF201604-2俄罗斯方块

题目链接

本题思路

题目整体思路还是比较清晰也，只涉及摆放不涉及消除，位置也确定了，因此也不涉及左右移动
整道题的关键就是：确定板块图案的第一行（或第四行）应该在方格图中的哪个位置（即，行数）。

整体思路

自顶向下，将板块图案与方格图进行比对，方格图每往下移动一行，便要比对一次，当4*4的板块与方格图顺利匹配，方格图向下移动一行，继续比对；当比对失败，返回记录上一次的行数，即可填入板块图案。

几个细节

1、此题属于模拟题，不涉及算法，整个过程就是在模拟俄罗斯方块下移过程的
2、要注意方格图最上面无法放入全部的板块图案的情况，此时只填入板块的一部分

代码

#include <bits/stdc++.h>
using namespace std;
int mp[16][12];
int pattern[5][5];
int num;
//对pattern预处理，将图案移到最低端 
void initPattern()
{
	//检查三遍pattern的最底层，遍历三次 
	for(int i = 1; i <= 3; i++)//次数 
	{
		bool isRowNull = true;
		for(int j = 4; j >= 1; j--)//从后遍历，判断是否存在全0的空行 
		{
			if(pattern[4][j])
			{
				isRowNull = false;//不为空 
			}
		}
		if(isRowNull)
		{
			for(int k = 3; k >= 1; k--)
			{
				for(int j = 4; j >= 1; j--)
				{
					pattern[k + 1][j] = pattern[k][j];
					pattern[k][j] = 0;
				}
			}
		}
	}
}
//模拟下落过程
int ComputeRowStart()
{
	int startRow = 1;
	//i:mp的行应该比对12次(以最后一行为参照)
	for(int i = 1; i <= 12; i++)
	{
		bool cmplt = true;//标记此次比对是否成功 
		for(int mprow = i, pattrow = 1; mprow < i + 4 && pattrow <= 4; mprow++, pattrow++)
		{
			for(int mpcol = num, pattcol = 1; mpcol < num + 4 && pattcol <= 4; mpcol++, pattcol++)
			{
				if(!(mp[mprow][mpcol] & pattern[pattrow][pattcol]))//相与得0,可以放置 
				{
					continue;
				}
				else
				{
					cmplt = false;
					break;
				}
			}
		}
		if(cmplt)
		{
			startRow = i;
		}
		else
		{
			break;
		}
	}
	return startRow;
}

void displayMp()
{
	for(int i = 1; i <= 15; i++)
	{
		for(int j = 1; j <= 10; j++)
		{
			printf("%d ", mp[i][j]);
		}
		printf("\n");
	}
}
int main(int argc, char *argv[]) {
	//输入 
	for(int i = 1; i <= 15; i++)
	{
		for(int j = 1; j<= 10; j++)
		{
			scanf("%d", &mp[i][j]);
		}
	}
	for(int i = 1; i <= 4; i++)
	{
		for(int j = 1; j <= 4; j++)
		{
			scanf("%d", &pattern[i][j]);
		}
	}
	scanf("%d", &num);
	//pattern初始化 
	initPattern(); 
	int startRow = ComputeRowStart(); 
	if(startRow != 1)
	{
		for(int mprow = startRow, pattrow = 1; mprow < startRow + 4 && pattrow <= 4; mprow++, pattrow++)
		{
			for(int mpcol = num, pattcol = 1; mpcol < num + 4 && pattcol <= 4; mpcol++, pattcol++)
			{
				if(!mp[mprow][mpcol]) //原图位置为0， 
				{
					mp[mprow][mpcol] = pattern[pattrow][pattcol];
				}
			}
		}
	}
	else
	{	
		int temprow = 1;
		for(int mprow = startRow, pattrow = 4; mprow < startRow + 4 && pattrow >= 1; mprow++, pattrow--)
		{
			bool cmplt = true;//比对是否正确 
			for(int mpcol = num, pattcol = 1; mpcol < num + 4 && pattcol <= 4; mpcol++, pattcol++)
			{
				if(!(mp[mprow][mpcol] & pattern[pattrow][pattcol]))//相与得0,可以放置 
				{
					continue;
				}
				else
				{
					cmplt = false;
					break;
				} 
			}
			if(cmplt)
			{
				pattrow++;
				temprow = mprow;
			}
			else
			{
				break;
			}
		}
		for(int mprow = temprow, pattrow = 4; mprow >= 1 && pattrow >= 1; mprow--, pattrow--)
		{
			for(int mpcol = num, pattcol = 1; mpcol < num + 4 && pattcol <= 4; mpcol++, pattcol++)
			{
				if(!mp[mprow][mpcol]) //原图位置为0， 
				{
					mp[mprow][mpcol] = pattern[pattrow][pattcol];
				}
			}
		}
	}
	displayMp();
	return 0;
}

几个测试用例

//输入
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 1 0 0 0
1 1 1 0 0 0 1 1 1 1
0 0 0 0 0 0 0 0 0 0
0 1 0 0
1 1 1 0
0 0 0 0
0 0 0 0
4
//输出
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 1 0 0 0
1 1 1 0 1 0 1 1 1 1
0 0 0 1 1 1 0 0 0 0


//输入
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 1 0 0 0
1 1 1 0 0 0 1 1 1 1
0 0 0 0 0 0 0 0 0 0
0 0 0 0
1 1 1 0
0 1 0 0
0 0 0 0
4
//输出
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 1 0 0 0
1 1 1 1 1 1 1 1 1 1
0 0 0 0 1 0 0 0 0 0


//输入
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 1 0 0 0
1 1 1 0 0 0 1 1 1 1
0 0 0 0 1 0 0 0 0 0
0 1 0 0
1 1 1 0
0 0 0 0
0 0 0 0
4
//输出
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 1 0 0 0
0 0 0 0 1 0 1 0 0 0
1 1 1 1 1 1 1 1 1 1
0 0 0 0 1 0 0 0 0 0


//输入*****
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 1 0 0 0
1 1 1 0 0 0 1 1 1 1
0 0 0 0 1 0 0 0 0 0
0 0 0 0
0 1 1 1
0 0 0 1
0 0 0 0
7
//输出
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 1 1
0 0 0 0 0 0 0 1 0 1
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 1 0 0 0
1 1 1 0 0 0 1 1 1 1
0 0 0 0 1 0 0 0 0 0



//输入
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 1 0 0 0
1 1 1 0 0 0 1 1 1 1
0 0 0 0 1 0 0 0 0 0
1 0 0 0
1 0 0 0
1 0 0 0
1 0 0 0
6
//输出
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 1 1 0 0 0
0 0 0 0 0 1 1 0 0 0
1 1 1 0 0 1 1 1 1 1
0 0 0 0 1 1 0 0 0 0



//输入
0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 1 0 0
1 0 0 0 0 0 1 0 0 0
1 0 0 0 0 0 1 0 0 0
1 1 1 0 0 0 1 1 1 1
0 0 0 0 1 0 0 0 0 0
0 1 0 0
1 1 1 0
0 0 0 0
0 0 0 0
1
//输出
1 1 1 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 1 0 0
1 0 0 0 0 0 1 0 0 0
1 0 0 0 0 0 1 0 0 0
1 1 1 0 0 0 1 1 1 1
0 0 0 0 1 0 0 0 0 0




//输入
0 0 0 0 1 1 0 0 0 0 
0 1 1 0 0 1 0 0 1 0 
0 0 0 1 1 1 0 0 0 1 
0 1 0 0 0 1 1 0 0 1 
1 1 0 0 1 0 0 0 1 1 
1 1 0 0 1 1 1 0 1 1 
0 1 1 0 0 1 1 1 1 1 
1 0 0 0 1 1 0 1 1 0 
1 0 0 0 1 0 1 1 0 1 
1 0 0 0 0 0 1 0 0 1 
0 0 0 1 1 1 1 0 0 0 
1 0 0 0 0 0 1 0 0 0 
1 0 0 0 0 1 1 1 0 0 
1 1 1 1 0 0 0 0 0 0 
0 0 0 0 1 1 1 1 0 0 
0 0 0 0 
1 1 1 0 
0 1 0 0 
0 0 0 0 
2
//输出
0 0 1 0 1 1 0 0 0 0
0 1 1 0 0 1 0 0 1 0
0 0 0 1 1 1 0 0 0 1
0 1 0 0 0 1 1 0 0 1
1 1 0 0 1 0 0 0 1 1
1 1 0 0 1 1 1 0 1 1
0 1 1 0 0 1 1 1 1 1
1 0 0 0 1 1 0 1 1 0
1 0 0 0 1 0 1 1 0 1
1 0 0 0 0 0 1 0 0 1
0 0 0 1 1 1 1 0 0 0
1 0 0 0 0 0 1 0 0 0
1 0 0 0 0 1 1 1 0 0
1 1 1 1 0 0 0 0 0 0
0 0 0 0 1 1 1 1 0 0

//输入
0 0 1 1 1 1 0 0 0 0 
0 1 1 0 0 1 0 0 1 0 
0 0 0 1 1 1 0 0 0 1 
0 1 0 0 0 1 1 0 0 1 
1 1 0 0 1 0 0 0 1 1 
1 1 0 0 1 1 1 0 1 1 
0 1 1 0 0 1 1 1 1 1 
1 0 0 0 1 1 0 1 1 0 
1 0 0 0 1 0 1 1 0 1 
1 0 0 0 0 0 1 0 0 1 
0 0 0 1 1 1 1 0 0 0 
1 0 0 0 0 0 1 0 0 0 
1 0 0 0 0 1 1 1 0 0 
1 1 1 1 0 0 0 0 0 0 
0 0 0 0 1 1 1 1 0 0 
1 0 0 0
1 0 0 0
1 0 0 0
1 0 0 0
1
//输出
1 0 1 1 1 1 0 0 0 0 
1 1 1 0 0 1 0 0 1 0 
1 0 0 1 1 1 0 0 0 1 
1 1 0 0 0 1 1 0 0 1 
1 1 0 0 1 0 0 0 1 1 
1 1 0 0 1 1 1 0 1 1 
0 1 1 0 0 1 1 1 1 1 
1 0 0 0 1 1 0 1 1 0 
1 0 0 0 1 0 1 1 0 1 
1 0 0 0 0 0 1 0 0 1 
0 0 0 1 1 1 1 0 0 0 
1 0 0 0 0 0 1 0 0 0 
1 0 0 0 0 1 1 1 0 0 
1 1 1 1 0 0 0 0 0 0 
0 0 0 0 1 1 1 1 0 0 
//输入
0 0 0 0 1 1 0 0 0 0 
0 1 1 0 0 1 0 0 1 0 
0 0 0 1 1 1 0 0 0 1 
0 1 0 0 0 1 1 0 0 1 
1 1 0 0 1 0 0 0 1 1 
1 1 0 0 1 1 1 0 1 1 
0 1 1 0 0 1 1 1 1 1 
1 0 0 0 1 1 0 1 1 0 
1 0 0 0 1 0 1 1 0 1 
1 0 0 0 0 0 1 0 0 1 
0 0 0 1 1 1 1 0 0 0 
1 0 0 0 0 0 1 0 0 0 
1 0 0 0 0 1 1 1 0 0 
1 1 1 1 0 0 0 0 0 0 
0 0 0 0 1 1 1 1 0 0 
1 0 0 0
1 0 0 0
1 0 0 0
1 0 0 0
3
//输出
0 0 1 0 1 1 0 0 0 0 
0 1 1 0 0 1 0 0 1 0 
0 0 0 1 1 1 0 0 0 1 
0 1 0 0 0 1 1 0 0 1 
1 1 0 0 1 0 0 0 1 1 
1 1 0 0 1 1 1 0 1 1 
0 1 1 0 0 1 1 1 1 1 
1 0 0 0 1 1 0 1 1 0 
1 0 0 0 1 0 1 1 0 1 
1 0 0 0 0 0 1 0 0 1 
0 0 0 1 1 1 1 0 0 0 
1 0 0 0 0 0 1 0 0 0 
1 0 0 0 0 1 1 1 0 0 
1 1 1 1 0 0 0 0 0 0 
0 0 0 0 1 1 1 1 0 0

九筒-

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
CSPCCF201604-2俄罗斯方块模拟题详细解题思路

A1033题目链接本题思路题目整体思路还是比较清晰也，只涉及摆放不涉及消除，位置也确定了，因此也不涉及左右移动整道题的关键就是：确定板块图案的第一行（或第四行）应该在方格图中的哪个位置（即，行数）。整体思路自顶向下，将板块图案与方格图进行比对，方格图每往下移动一行，便要比对一次，当4*4的板块与方格图顺利匹配，方格图向下移动一行，继续比对；当比对失败，返回记录上一次的行数，即可填入板块...
复制链接

扫一扫