玲珑杯 1003 Spoon Devil's Diamond Mine
来源:互联网 发布:知乎武林外传细思极恐 编辑:程序博客网 时间:2024/03/29 16:53
【题目链接】http://www.ifrog.cc/acm/problem/1003
【题意】其实就是开心消消乐,问给你一个消除的步骤,是否是合法的消除。
【解题方法】分类模拟就行了。
【AC代码】超长的模拟
////Created by just_sort 2016/9/25 15:11//Copyright (c) 2016 just_sort.All Rights Reserved//#include <set>#include <map>#include <queue>#include <stack>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>#include <algorithm>using namespace std;char s[10][10];int main(){ while(scanf("%s",s[1]+1)!=EOF) { for(int i=2; i<=8; i++) scanf("%s",s[i]+1); int x1,x2,y1,y2; scanf("%d%d%d%d",&x1,&y1,&x2,&y2); if(y1==y2&&x1==x2-1) { if(s[x1][y1-1]==s[x1][y1+1]&&s[x1][y1-1]==s[x2][y2]) { puts("Ok!"); } else if(s[x2][y2-1]==s[x2][y2+1]&&s[x2][y2-1]==s[x1][y1]) { puts("Ok!"); } else if(s[x1-1][y1]==s[x1-2][y1]&&s[x1-1][y1]==s[x2][y2]) { puts("Ok!"); } else if(s[x2+1][y1]==s[x2+2][y1]&&s[x2+1][y1]==s[x1][y1]) { puts("Ok!"); } else if(s[x1][y1-1]==s[x1][y1-2]&&s[x1][y1-1]==s[x2][y2]) { puts("Ok!"); } else if(s[x1][y1+1]==s[x1][y1+2]&&s[x1][y1+1]==s[x2][y2]) { puts("Ok!"); } else if(s[x2][y2-1]==s[x2][y2-2]&&s[x2][y2-1]==s[x1][y1]) { puts("Ok!"); } else if(s[x2][y2+1]==s[x2][y2+2]&&s[x2][y2+1]==s[x1][y1]) { puts("Ok!"); } else { puts("Illegal move!"); } } else if(y1==y2&&x1-1==x2) { if(s[x2][y2-1]==s[x2][y2+1]&&s[x2][y2-1]==s[x1][y1]) { puts("Ok!"); } else if(s[x1][y1-1]==s[x1][y1+1]&&s[x1][y1-1]==s[x2][y2]) { puts("Ok!"); } else if(s[x2-1][y1]==s[x2-2][y1]&&s[x2-1][y1]==s[x1][y1]) { puts("Ok!"); } else if(s[x1+1][y1]==s[x1+2][y1]&&s[x1+1][y1]==s[x2][y2]) { puts("Ok!"); } else if(s[x1][y1-1]==s[x1][y1-2]&&s[x1][y1-1]==s[x2][y2]) { puts("Ok!"); } else if(s[x1][y1+1]==s[x1][y1+2]&&s[x1][y1+1]==s[x2][y2]) { puts("Ok!"); } else if(s[x2][y2-1]==s[x2][y2-2]&&s[x2][y2-1]==s[x1][y1]) { puts("Ok!"); } else if(s[x2][y2+1]==s[x2][y2+2]&&s[x2][y2+1]==s[x1][y1]) { puts("Ok!"); } else { puts("Illegal move!"); } } else if(x1==x2&&y2+1==y1) { if(s[x2-1][y2]==s[x2+1][y2]&&s[x2-1][y2]==s[x1][y1]) { puts("Ok!"); } else if(s[x1-1][y1]==s[x1+1][y1]&&s[x1-1][y1]==s[x2][y2]) { puts("Ok!"); } else if(s[x2][y2-1]==s[x2][y2-2]&&s[x2][y2-1]==s[x1][y1]) { puts("Ok!"); } else if(s[x1][y1+1]==s[x1][y1+2]&&s[x1][y1+1]==s[x2][y2]) { puts("Ok!"); } else if(s[x2-1][y2]==s[x2-2][y2]&&s[x2-1][y2]==s[x1][y1]) { puts("Ok!"); } else if(s[x2+1][y2]==s[x2+2][y2]&&s[x2+1][y2]==s[x1][y1]) { puts("Ok!"); } else if(s[x1-1][y1]==s[x1-2][y1]&&s[x1-1][y1]==s[x2][y2]) { puts("Ok!"); } else if(s[x1+1][y1]==s[x1+2][y1]&&s[x1+1][y1]==s[x2][y2]) { puts("Ok!"); } else { puts("Illegal move!"); } } else if(x1==x2&&y1+1==y2) { if(s[x1-1][y1]==s[x1+1][y1]&&s[x1-1][y1]==s[x2][y2]) { puts("Ok!"); } else if(s[x2-1][y2]==s[x2+1][y2]&&s[x2-1][y2]==s[x1][y1]) { puts("Ok!"); } else if(s[x1][y1-1]==s[x1][y1-2]&&s[x1][y1-1]==s[x2][y2]) { puts("Ok!"); } else if(s[x2][y2+1]==s[x2][y2+2]&&s[x2][y2+1]==s[x1][y1]) { puts("Ok!"); } else if(s[x2-1][y2]==s[x2-2][y2]&&s[x2-1][y2]==s[x1][y1]) { puts("Ok!"); } else if(s[x2+1][y2]==s[x2+2][y2]&&s[x2+1][y2]==s[x1][y1]) { puts("Ok!"); } else if(s[x1-1][y1]==s[x1-2][y1]&&s[x1-1][y1]==s[x2][y2]) { puts("Ok!"); } else if(s[x1+1][y1]==s[x1+2][y1]&&s[x1+1][y1]==s[x2][y2]) { puts("Ok!"); } else { puts("Illegal move!"); } } else{ puts("Illegal move!"); } } return 0;}
0 0
- 玲珑杯 1003 Spoon Devil's Diamond Mine
- 玲珑杯 1005 Spoon Devil's RP Test(水题)
- 玲珑杯 1009 Spoon Devil's Bucket 矩阵优化DP
- 玲珑杯1006 Spoon Devil Love Arithmetic
- 玲珑杯 1007 Spoon Devil Love Game
- 玲珑学院OJ 1000 Spoon Devil's 3-D Matrix
- 玲珑杯 1008 Spoon Devil Love Arithmetic Again
- Lonlife-ACM 1000 - Spoon Devil's 3-D Matrix(最小生成树)——“玲珑杯”acm比赛-试运行赛
- Lonlife-ACM 1005 - Spoon Devil's RP Test(同余定理)——“玲珑杯”acm比赛-试运行赛
- 玲珑学院OJ 1000 - Spoon Devil's 3-D Matrix(3维最小生成树)
- 玲珑学院OJ 1005 - Spoon Devil's RP Test(求余问题)
- Lonlife 1000 - Spoon Devil's 3-D Matrix
- Spoon Devil Love Arithmetic
- it's mine
- 看魔鬼代言人(Devil's Advocate)有感
- The Devil's Guide to Debugging
- 玲珑杯
- Diamond
- ExtJs布局详解
- 利用Python子进程 subprocess模块和ffmpeg转化视频为图片
- javascript 找到第二个参数的位置
- 字符串以单词为单位进行反转,并且必须保留原有分隔符及其个数
- happens-before先行发生原则
- 玲珑杯 1003 Spoon Devil's Diamond Mine
- React Native填坑之旅--Button篇
- utf-8,unicode,gbk编码的来源和区别
- 数据结构课后习题 实现多项式的加法 c语言版
- apt-get 安装 node 和 nvm 安装 node 的区别
- 简单的深度优先遍历和广度优先遍历
- GZ的升级版DVD
- java面向对象——继承--初识继承
- GitLab环境搭建与项目导入