2017 东北四省赛热身赛 C

原题：清华大学出题（侵删）

题意：

模拟俄罗斯方块游戏给出 N 个方块，限高为 M

对于 N 个方块给出方块的类型，方块的方向，方块的最左端的列数。问 N 个方块径直下落后，共可以消除几层？游戏过程中保证不超出限高。

思路:

模拟

代码：

不知道对不对

#include <bits/stdc++.h>
using namespace std;
char kuai;
int n,m,fangxiang,lie,h[15],w[500050];
bool mp[11][500050];
int high,ans,tt;
void debug(){cout<<"debug:"<<endl;cout<<"high:"<<high<<endl;for(int i=0;i<10;i++)cout<<h[i]<<' ';cout<<endl;for(int i=0;i<=tt;i++)cout<<"w:"<<i<<"="<<w[i]<<endl;for(int i=tt;i>0;i--){for(int j=0;j<10;j++){cout<<mp[j][i]<<' ';}cout<<endl;}}
void check(){tt=h[0];for(int i=1;i<10;i++) tt=max(h[i],tt);for(int i=high+1;i<=high+4;i++){if(w[i]==10){int offset=0;while(1){if(w[i]==10){offset++;ans++;w[i]=0;}else break;i++;}int l;for(int j=i-offset;j<=tt;j++){l=0;for(int k=0;k<10;k++){mp[k][j]=mp[k][j+offset];if(mp[k][j]) l++;}w[j]=l;}for(int j=0;j<10;j++){h[j]-=offset;while(high>0&&mp[j][high]==0){h[j]--;high--;}}break;}}
}
void luo(){scanf("%c %d %d",&kuai,&fangxiang,&lie);getchar();if(kuai=='A'){high=max(h[lie],h[lie+1]);h[lie]=high+2;h[lie+1]=high+2;w[high+1]+=2;w[high+2]+=2;mp[lie][high+1]=1;mp[lie][high+2]=1;mp[lie+1][high+1]=1;mp[lie+1][high+2]=1;}else if(kuai=='B'){if(fangxiang==0||fangxiang==2){high=h[lie];h[lie]=high+4;for(int i=1;i<=4;i++) w[high+i]++;mp[lie][high+1]=1;mp[lie][high+2]=1;mp[lie][high+3]=1;mp[lie][high+4]=1;}else{high=h[lie];for(int i=1;i<4;i++) high=max(high,h[lie+i]);for(int i=0;i<4;i++) h[lie+i]=high+1;w[high+1]+=4;mp[lie][high+1]=1;mp[lie+1][high+1]=1;mp[lie+2][high+1]=1;mp[lie+3][high+1]=1;}}else if(kuai=='C'){if(fangxiang==0){high=max(h[lie],max(h[lie+1],h[lie+2]));h[lie]=high+2;h[lie+1]=high+1;h[lie+2]=high+1;w[high+1]+=3;w[high+2]++;mp[lie][high+1]=1;mp[lie][high+2]=1;mp[lie+1][high+1]=1;mp[lie+2][high+1]=1;}else if(fangxiang==1){high=max(h[lie],h[lie+1]);h[lie]=high+1;h[lie+1]=high+3;w[high+1]+=2;w[high+2]++;w[high+3]++;mp[lie][high+1]=1;mp[lie+1][high+1]=1;mp[lie+1][high+2]=1;mp[lie+1][high+3]=1;}else if(fangxiang==2){high=max(h[lie]-1,max(h[lie+1]-1,h[lie+2]));h[lie]=high+2;h[lie+1]=high+2;h[lie+2]=high+2;w[high+1]++;w[high+2]+=3;mp[lie][high+2]=1;mp[lie+1][high+2]=1;mp[lie+2][high+1]=1;mp[lie+2][high+2]=1;}else if(fangxiang==3){high=max(h[lie],h[lie+1]-2);h[lie]=high+3;h[lie+1]=high+3;w[high+1]++;w[high+2]++;w[high+3]+=2;mp[lie][high+1]=1;mp[lie][high+2]=1;mp[lie][high+3]=1;mp[lie+1][high+3]=1;}}else if(kuai=='D'){if(fangxiang==0){high=max(h[lie],max(h[lie+1],h[lie+2]));h[lie]=high+1;h[lie+1]=high+1;h[lie+2]=high+2;w[high+1]+=3;w[high+2]++;mp[lie][high+1]=1;mp[lie+1][high+1]=1;mp[lie+2][high+1]=1;mp[lie+2][high+2]=1;}else if(fangxiang==1){high=max(h[lie]-2,h[lie+1]);h[lie]=high+3;h[lie+1]=high+3;w[high+1]++;w[high+2]++;w[high+3]+=2;mp[lie][high+3]=1;mp[lie+1][high+1]=1;mp[lie+1][high+2]=1;mp[lie+1][high+3]=1;}else if(fangxiang==2){high=max(h[lie],max(h[lie+1]-1,h[lie+2]-1));h[lie]=high+2;h[lie+1]=high+2;h[lie+2]=high+2;w[high+1]++;w[high+2]+=3;mp[lie][high+1]=1;mp[lie][high+2]=1;mp[lie+1][high+2]=1;mp[lie+2][high+2]=1;}else if(fangxiang==3){high=max(h[lie],h[lie+1]);h[lie]=high+3;h[lie+1]=high+1;w[high+1]+=2;w[high+2]++;w[high+3]++;mp[lie][high+1]=1;mp[lie][high+2]=1;mp[lie][high+3]=1;mp[lie+1][high+1]=1;}}else if(kuai=='E'){if(fangxiang==0||fangxiang==2){high=max(h[lie]-1,max(h[lie+1],h[lie+2]));h[lie]=high+2;h[lie+1]=high+2;h[lie+2]=high+1;w[high+1]+=2;w[high+2]+=2;mp[lie][high+2]=1;mp[lie+1][high+1]=1;mp[lie+1][high+2]=1;mp[lie+2][high+1]=1;}else{high=max(h[lie],h[lie+1]-1);h[lie]=high+2;h[lie+1]=high+3;w[high+1]++;w[high+2]+=2;w[high+3]++;mp[lie][high+1]=1;mp[lie][high+2]=1;mp[lie+1][high+2]=1;mp[lie+1][high+3]=1;}}else if(kuai=='F'){if(fangxiang==0||fangxiang==2){high=max(h[lie],max(h[lie+1],h[lie+2]-1));h[lie]=high+1;h[lie+1]=high+2;h[lie+2]=high+2;w[high+1]+=2;w[high+2]+=2;mp[lie][high+1]=1;mp[lie+1][high+1]=1;mp[lie+1][high+2]=1;mp[lie+2][high+2]=1;}else{high=max(h[lie]-1,h[lie+1]);h[lie]=high+3;h[lie+1]=high+2;w[high+1]++;w[high+2]+=2;w[high+3]++;mp[lie][high+1]=1;mp[lie+1][high+1]=1;mp[lie+1][high+2]=1;mp[lie+2][high+2]=1;}}else if(kuai=='G'){if(fangxiang==0){high=max(h[lie],max(h[lie+1],h[lie+2]));h[lie]=high+1;h[lie+1]=high+2;h[lie+2]=high+1;w[high+1]+=3;w[high+2]++;mp[lie][high+1]=1;mp[lie+1][high+1]=1;mp[lie+2][high+1]=1;mp[lie+1][high+2]=1;}else if(fangxiang==1){high=max(h[lie]-1,h[lie+1]);h[lie]=high+2;h[lie+1]=high+3;w[high+1]++;w[high+2]+=2;w[high+3]++;mp[lie][high+2]=1;mp[lie+1][high+1]=1;mp[lie+1][high+2]=1;mp[lie+1][high+3]=1;}else if(fangxiang==2){high=max(h[lie]-1,max(h[lie+1],h[lie+2]-1));h[lie]=high+2;h[lie+1]=high+2;h[lie+2]=high+2;w[high+1]++;w[high+2]+=3;mp[lie][high+2]=1;mp[lie+1][high+1]=1;mp[lie+1][high+2]=1;mp[lie+2][high+2]=1;}else if(fangxiang==3){high=max(h[lie],h[lie+1]-1);h[lie]=high+3;h[lie+1]=high+2;w[high+1]++;w[high+2]+=2;w[high+3]++;mp[lie][high+1]=1;mp[lie][high+2]=1;mp[lie][high+3]=1;mp[lie+1][high+2]=1;}}
}
int main()
{while(scanf("%d %d",&n,&m)!=-1){getchar();memset(w,0,sizeof(w));memset(h,0,sizeof(h));memset(mp,0,sizeof(mp));ans=0;high=0;for(int i=0;i<n;i++){luo();check();//debug();}cout<<ans<<endl;}return 0;
}

2017 东北四省赛热身赛 C相关推荐

2018东北四省赛 Store The Matrix (矩阵）
2018东北四省赛 Store The Matrix (矩阵) 题目描述 Given a matrix M with r rows and c columns. It is obviously tha ...
2018东北四省赛 Spin A Web 曼哈顿距离最小生成树
莫队的论文,讲的很清晰问题描述:给定平面N个点,两边相连的代价为曼哈顿距离,求这些点的最小生成树按一般想法,prime复杂度O(n^2),Kruskal复杂度O(n^2 logn),N很大时,这复 ...
东北四省赛H-Skyscraper-线段树的区间合并优化
题目描述: At the main street of Byteland, there will be built n skyscrapers, standing sequentially one n ...
2021CCPC东北四省赛 D. Lowbit 势能线段树
传送门分析分析一下x+lowbit(x)x + lowbit(x)x+lowbit(x)这个操作如果多次操作之后,那么xxx中只会有最高位存在一,这个时候再执行一次操作就会使整个数字乘二所以, ...
【随笔】2015年ICPC四省赛/邀请赛小结
因为槽点太多了,所以周日比完赛,周一就开始写文章吐槽了QAQ 这比赛真坑,真坑,真坑啊!!!(重要的事情要说三遍) 本次比赛是ICPC主办的东北赛,哈工大跟吉大可能是因为有了CCPC所以不来参加了吧, ...
2017华东师范大学网赛-拼音魔法
拼音魔法 Time limit per test: 1.0 seconds Time limit all tests: 1.0 seconds Memory limit: 256 megabytes ...
和平精英明星四排赛，你的网游.fans域名抢了没？
<和平精英>可谓是当下游戏界的霸王了~随着越来越多的人在玩,"一起吃鸡"也成了这款游戏的代言词.就在上周日,<和平精英>的特种兵代言人"迪丽热巴. ...
2017 华东师范大学网赛 F.丽娃河的狼人传说 Problem #3263( 贪心)
丽娃河的狼人传说 Time limit per test: 1.0 seconds Time limit all tests: 1.0 seconds Memory limit: 256 megaby ...
百度杯2017年春秋欢乐赛
百度杯2017年春秋欢乐赛第一场 0x01 小电影分值:50分类型:Misc已解答题目: 我说过这次比赛是让大家开开心心的度过的所以送给你们一个小电影压缩包内只有一个无法正常打开的名为end ...
CT 系统参数标定及反投影重建成像-2017数模国赛论文A298编程分析
CT 系统参数标定及反投影重建成像-2017数模国赛论文A298编程分析之前的同学已经讲解清楚了这篇论文建模的主要思路,我主要讲解代码对建模思路的实现. 本文提到的论文下载地址:http://dxs ...

2017 东北四省赛热身赛 C

2017 东北四省赛热身赛 C相关推荐

最新文章

热门文章