Problem 1979 --Diamond

1979: Diamond

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $1$ 正确数量 $1$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签
Diamond mine is a mini-game which is played on an 8 * 8 board as you can see below.
The board is filled with different colors of diamonds. The player can make one move at a time. A move is
legal if it swaps two adjacent diamonds(not diagonally) and after that, there are three or more adjacent
diamonds in a row or column with the same color. Those diamonds will be taken away and new
diamonds will be put in their positions. The game continues until no legal moves exist.
Given the board description. You are going to determine whether a move is legal.

The input contains several cases. Each case has exactly 9 lines. The first 8 lines each contains a string
of 8 characters. The characters are 'R'(Red), 'O'(Orange), 'G'(Green), 'P'(Purple), 'W'(White), 'Y'(Yellow)
or 'B'(Blue). All characters are uppercase. No 3 diamonds of the same color are initially in adjacent
positions in a row or column. The last line has 4 integers in the form " row1 column1 row2 column2"
describing the postions of the 2 diamonds that the player wants to swap. Rows are marked 1 to 8
increasingly from top to bottom while columns from left to right. Input is terminated by EOF.

For each case, output "Ok!" if the move is legal or "Illegal move!" if it is not.

PBPOWBGW
RRPRYWWP
YGBYYGPP
OWYGGRWB
GBBGBGGR
GBWPPORG
PPGORWOG
WYWGYWBY
4 3 3 3
PBPOWBGW
RRPRYWWP
YGBYYGPP
OWYGGRWB
GBBGBGGR
GBWPPORG
PPGORWOG
WYWGYWBY
5 5 6 5
Ok!
Illegal move!

推荐代码 查看1979 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$0 $ms] 范晋豪@信息与计算科学142 108888 2017-07-02 23:10:47
内存最少[$948 $KB] 范晋豪@信息与计算科学142 108888 2017-07-02 23:10:47
第一AC 范晋豪@信息与计算科学142 108888 2017-07-02 23:10:47
第一挑战 范晋豪@信息与计算科学142 108888 2017-07-02 23:10:47

赛题来源/所属竞赛 20100831湖工大校赛 N/A

竞赛编号 竞赛名称 竞赛时间 访问比赛