本题链接:象棋
注意:在UVa提交时过了debug所有测试样例,但是还是一直WA。开始想法是是由scanf("%c %d %d", &c, &a1, &b1);之后使用getchar();吸收回车,之后改成scanf(" %c%d%d", &c, &a1, &b1);使用空格去吸收回车便AC了,如果测试样例都过了就是WA可以试下。
本题思路:使用两个结构体数组一个用于表示棋盘,另一个记录棋子位置。
struct board {
int num; //这里num 为0时代表没有当前位置没有红方棋子, 1时为有红方棋子, 2为红方棋子所能走到的位置
char ch;//记录棋子种类: ‘G', 'H', 'R', 'C'
}board[15][15];
struct check{
int r; //棋子所在行坐标
int c;//棋子所在列坐标
}check[10];
对棋盘进行模拟如果, 将红方棋子所能够下到的位置记为2, 分别判断黑将,向上,向左,向下,向右,的位置上是否为2,如果为2,cnt++, cnt为4时输出“YES”。
考虑情况:
- 当帅与将开始时就在同一列且之间没有其他棋子时,红方失败输出“NO”
- 黑子帅可以吃掉红子,模拟吃掉时对棋盘进行初始化。
AC代码
这里Function函数用来对棋子能走到的位置赋值为2。initialization用来初始化棋盘。print用来打印棋盘用于测试。
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#define BIG 10000
#define maxn 100
using namespace std;
struct board {
int num;
char ch;
}board[15][15];
struct check{
int r;
int c;
}check[10];
void Function(int n){
for(int i = 0;i < n;i++) {
if(board[check[i].r][check[i].c].num != 1)
continue;
if(board[check[i].r][check[i].c].ch == 'G') {
for(int j = check[i].r - 1;j >= 1;j--) {
if(board[j][check[i].c].num==1)
break;
if(j != check[i].r)
board[j][check[i].c].num = 2;
}
for(int j = check[i].r + 1;j <= 10;j++) {
if(board[j][check[i].c].num==1)
break;
if(j != check[i].r)
board[j][check[i].c].num = 2;
}
} else if(board[check[i].r][check[i].c].ch == 'R') {
for(int j = check[i].r - 1;j >= 1;j--){
if(board[j][check[i].c].num==1)
break;
if(j != check[i].r)
board[j][check[i].c].num = 2;
}
for(int j = check[i].r + 1;j <= 10;j++){
if(board[j][check[i].c].num==1)
break;
if(j != check[i].r)
board[j][check[i].c].num = 2;
}
for(int j = check[i].c - 1;j >= 1;j--){
if(board[check[i].r][j].num==1)
break;
if(j != check[i].c)
board[check[i].r][j].num = 2;
}
for(int j = check[i].c + 1;j <= 9;j++) {
if(board[check[i].r][j].num==1)
break;
if(j != check[i].c)
board[check[i].r][j].num = 2;
}
} else if(board[check[i].r][check[i].c].ch == 'H') {
if(board[check[i].r - 1][check[i].c].num != 1&&check[i].r - 2 >= 1) {
if(board[check[i].r - 2][check[i].c + 1].num!=1&&check[i].c + 1 <= 9)
board[check[i].r - 2][check[i].c + 1].num = 2;
if(board[check[i].r - 2][check[i].c - 1].num!=1&&check[i].c - 1 >= 1)
board[check[i].r - 2][check[i].c - 1].num = 2;
}
if(board[check[i].r][check[i].c + 1].num != 1&&check[i].c + 2 <= 9) {
if(board[check[i].r - 1][check[i].c + 2].num!=1&&check[i].r - 1 >= 1)
board[check[i].r - 1][check[i].c + 2].num = 2;
if(board[check[i].r + 1][check[i].c + 2].num!=1&&check[i].r + 1 <= 10)
board[check[i].r + 1][check[i].c + 2].num = 2;
}
if(board[check[i].r + 1][check[i].c].num != 1&&check[i].r + 2 <= 10) {
if(board[check[i].r + 2][check[i].c + 1].num!= 1&&check[i].c + 1 <= 9)
board[check[i].r + 2][check[i].c + 1].num = 2;
if(board[check[i].r + 2][check[i].c - 1].num!=1&&check[i].c - 1 >= 1)
board[check[i].r + 2][check[i].c - 1].num = 2;
}
if(board[check[i].r][check[i].c - 1].num != 1&&check[i].c - 2 >= 1) {
if(board[check[i].r + 1][check[i].c - 2].num!=1&&check[i].r + 1 <= 10)
board[check[i].r + 1][check[i].c - 2].num = 2;
if(board[check[i].r - 1][check[i].c - 2].num!=1&&check[i].r - 1 >= 1)
board[check[i].r - 1][check[i].c - 2].num = 2;
}
} else if(board[check[i].r][check[i].c].ch == 'C') {
int flag = 0;
for(int j = check[i].r - 1;j >= 1;j--){
if(j != check[i].r&&flag == 1&&board[j][check[i].c].num!=1)
board[j][check[i].c].num = 2;
if(board[j][check[i].c].num==1)
flag++;
}
flag = 0;
for(int j = check[i].r + 1;j <= 10;j++){
if(j != check[i].r&&flag==1&&board[j][check[i].c].num!=1)
board[j][check[i].c].num = 2;
if(board[j][check[i].c].num==1)
flag++;
}
flag = 0;
for(int j = check[i].c - 1;j >= 1;j--) {
if(j != check[i].c&&flag==1&&board[check[i].r][j].num!=1)
board[check[i].r][j].num = 2;
if(board[check[i].r][j].num==1)
flag++;
}
flag = 0;
for(int j = check[i].c + 1;j <= 9;j++){
if(j != check[i].c&&flag==1&&board[check[i].r][j].num!=1)
board[check[i].r][j].num = 2;
if(board[check[i].r][j].num==1)
flag++;
}
}
}
}
void initialization(int n) {
for(int i = 1;i <= 10;i++) {
for(int j = 1;j <= 9;j++) {
board[i][j].num = 0;
}
}
if(n!=0) {
for(int i = 0;i < n;i++) {
board[check[i].r][check[i].c].num = 1;
}
}
}
void print() {
for(int i = 1;i <= 10;i++) {
for(int j = 1;j <= 9;j++) {
if(board[i][j].num == 1)
printf("%c ", board[i][j].ch);
else
printf("%d ", board[i][j].num);
}
printf("\n");
}
printf("\n");
}
int main(void) {
int n, a, b;
char c;
int a1, b1;
while(scanf("%d%d%d", &n, &a, &b)&&n) {
initialization(0);
//for(int i = 1;i <= 10;i++) {
// for(int j = 1;j <= 9;j++) {
// board[i][j].ch = 0;
//}
//}
//for(int i = 0;i < n;i++) {
// check[i].c = 0;
//check[i].r = 0;
//}
int cnt = 0;
int flag = 1;
int NUM;
getchar();
for(int i = 0;i < n;i++) {
scanf(" %c%d%d", &c, &a1, &b1);
if(c == 'G')
NUM = i;
board[a1][b1].ch = c;
board[a1][b1].num = 1;
check[i].r = a1;
check[i].c = b1;
//getchar();
}
//getchar();
int k;
for(k = 0;k < n;k++) {
if(check[k].c == check[NUM].c&&check[k].r < check[NUM].r)
break;
}
if(k == n&&check[NUM].c == b) {
flag = 0;
}
if(a - 1 >= 1){
if(board[a - 1][b].num == 1)
board[a - 1][b].num = 0;
Function(n);
//print();
if(board[a - 1][b].num == 2){
cnt++;
}
initialization(n);
} else {
//printf("1");
cnt++;
}
if(b + 1 <= 6) {
if(board[a][b + 1].num == 1)
board[a][b + 1].num = 0;
Function(n);
//print();
if(board[a][b + 1].num == 2){
cnt++;//printf("2");
}
initialization(n);
} else {
cnt++;
}
if (a + 1 <= 3) {
if(board[a + 1][b].num == 1)
board[a + 1][b].num = 0;
Function(n);
//print();
if(board[a + 1][b].num == 2){
cnt++;//printf("3");
}
initialization(n);
} else {
cnt++;
}
if (b - 1 >= 4) {
if(board[a][b - 1].num == 1)
board[a][b - 1].num = 0;
Function(n);
//print();
if(board[a][b - 1].num == 2){
cnt++;//printf("4");
}
initialization(n);
} else {
cnt++;
}
if(cnt == 4&&flag == 1) {
printf("YES\n");
} else {
printf("NO\n");
}
//getchar();
//getchar();
}
return 0;
}