Two bears are playing tic-tac-toe via mail. It's boring for them to play usual tic-tac-toe game, so they are a playing modified version of this game. Here are its rules.
The game is played on the following field.
Players are making moves by turns. At first move a player can put his chip in any cell of any small field. For following moves, there are some restrictions: if during last move the opposite player put his chip to cell with coordinates(xl, yl) in some small field, the next move should be done in one of the cells of the small field with coordinates(xl, yl). For example, if in the first move a player puts his chip to lower left cell of central field, then the second player on his next move should put his chip into some cell of lower left field (pay attention to the first test case). If there are no free cells in the required field, the player can put his chip to any empty cell on any field.
You are given current state of the game and coordinates of cell in which the last move was done. You should find all cells in which the current player can put his chip.
A hare works as a postman in the forest, he likes to foul bears. Sometimes he changes the game field a bit, so the current state of the game could be unreachable. However, after his changes the cell where the last move was done is not empty. You don't need to find if the state is unreachable or not, just output possible next moves according to the rules.
First 11 lines contains descriptions of table with 9 rows and 9 columns which are divided into 9 small fields by spaces and empty lines. Each small field is described by 9 characters without spaces and empty lines. character "x" (ASCII-code 120) means that the cell is occupied with chip of the first player, character "o" (ASCII-code 111) denotes a field occupied with chip of the second player, character "." (ASCII-code 46) describes empty cell.
The line after the table contains two integers x andy (1 ≤ x, y ≤ 9). They describe coordinates of the cell in table where the last move was done. Rows in the table are numbered from up to down and columns are numbered from left to right.
It's guaranteed that cell where the last move was done is filled with "x" or "o". Also, it's guaranteed that there is at least one empty cell. It's not guaranteed that current state of game is reachable.
Output the field in same format with characters "!" (ASCII-code 33) on positions where the current player can put his chip. All other cells should not be modified.
... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... x.. ... ... ... ... ... ... ... ... ... ... 6 4
... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... x.. ... !!! ... ... !!! ... ... !!! ... ...
xoo x.. x.. ooo ... ... ooo ... ... x.. x.. x.. ... ... ... ... ... ... x.. x.. x.. ... ... ... ... ... ... 7 4
xoo x!! x!! ooo !!! !!! ooo !!! !!! x!! x!! x!! !!! !!! !!! !!! !!! !!! x!! x!! x!! !!! !!! !!! !!! !!! !!!
o.. ... ... ... ... ... ... ... ... ... xxx ... ... xox ... ... ooo ... ... ... ... ... ... ... ... ... ... 5 5
o!! !!! !!! !!! !!! !!! !!! !!! !!! !!! xxx !!! !!! xox !!! !!! ooo !!! !!! !!! !!! !!! !!! !!! !!! !!! !!!
In the first test case the first player made a move to lower left cell of central field, so the second player can put a chip only to cells of lower left field.
In the second test case the last move was done to upper left cell of lower central field, however all cells in upper left field are occupied, so the second player can put his chip to any empty cell.
In the third test case the last move was done to central cell of central field, so current player can put his chip to any cell of central field, which is already occupied, so he can move anywhere. Pay attention that this state of the game is unreachable.
题意：给你一个由三个3*3组成的9*9的方格，然后给出x，y，找到这个位置在它所在的小方块的哪个位置，然后对应到大方块（这是要把大方块看成3*3了）中的哪个小方块，判断这个小方块有没有‘.’了，如果有的话，把 ‘.‘ 换成 ’!' 输出，其他的字符原样输出，如果这个小方块中的九个位置都不是‘.’ ，那么把其他所有是 ‘.’ 的位置换成 '!' 输出，其他的原样输出。
模拟：就是输入的时候有点麻烦，要控制好空格和换行，我这里使用getchar()来吸收的。先把所有的空格去掉存在一个数组里，然后再根据给出的x，y来判断对应的大方块中的小方块中是否有'.' ,然后再分情况输出。详细请看代码：
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#define inf 0x3fffffff
using namespace std;
typedef long long LL;
char s[15][15];//存字符
int a[5][5];//计数，九个小方块，如果每个小方块中有一个位置不是'.'就加一，加到9就说明这个方块中都不是'.'
int main()
{
memset(a,0,sizeof(a));
memset(s,'0',sizeof(s));
int tx,ty,x,y,k=1,kk=1;
for(int i=0;i<11;i++)
{
if(i==3||i==7) getchar();//吸收空行
else
{
for(int j=0;j<11;j++)
{
if(j==3||j==7) getchar();//吸收空格
else scanf("%c",&s[k][kk++]);
}
getchar();//吸收换行
k++,kk=1;
}
}
//计数，看每个小方块中有多少个不是'.'
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
if(s[i][j]!='.')
{
if(i%3) tx=i/3+1;
else tx=i/3;
if(j%3) ty=j/3+1;
else ty=j/3;
a[tx][ty]++;
}
}
}
scanf("%d%d",&x,&y);
tx=x%3,ty=y%3;
if(!tx) x=3;
else x=tx;
if(!ty) y=3;
else y=ty;
//分情况输出
if(a[x][y]!=9)
{
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
if(j==4||j==7) printf(" ");
if(i>(x-1)*3&&i<=x*3&&j>(y-1)*3&&j<=y*3&&s[i][j]=='.')
printf("!");
else printf("%c",s[i][j]);
}
if(i==3||i==6) printf("\n");
printf("\n");
}
}
else
{
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
if(j==4||j==7) printf(" ");
if(s[i][j]!='.') printf("%c",s[i][j]);
else printf("!");
}
if(i==3||i==6) printf("\n");
printf("\n");
}
}
}
附加样例：
输入：
... .o. ...
... ... ...
... ... ...
... ... ...
... ... ...
... .x. ..x
.x. ... ...
..o ... .o.
... o.o xx.
1 5
输出：
... !o! ...
... !!! ...
... !!! ...
... ... ...
... ... ...
... .x. ..x
.x. ... ...
..o ... .o.
... o.o xx.
292
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
