POJ 2996：Help Me with the Game

Help Me with the Game

Time Limit: 1000MS

Memory Limit: 65536KB

64bit IO Format: %I64d & %I64u

Submit Status

Description

Your task is to read a picture of a chessboard position and print it in the chess notation.

Input

The input consists of an ASCII-art picture of a chessboard with chess pieces on positions described by the input. The pieces of the white player are shown in upper-case letters, while the black player's pieces are lower-case letters. The letters are one of
"K" (King), "Q" (Queen), "R" (Rook), "B" (Bishop), "N" (Knight), or "P" (Pawn). The chessboard outline is made of plus ("+"), minus ("-"), and pipe ("|") characters. The black fields are filled with colons (":"), white fields with dots (".").

Output

The output consists of two lines. The first line consists of the string "White: ", followed by the description of positions of the pieces of the white player. The second line consists of the string "Black: ", followed by the description of positions of the
pieces of the black player. 



The description of the position of the pieces is a comma-separated list of terms describing the pieces of the appropriate player. The description of a piece consists of a single upper-case letter that denotes the type of the piece (except for pawns, for that
this identifier is omitted). This letter is immediatelly followed by the position of the piece in the standard chess notation -- a lower-case letter between "a" and "h" that determines the column ("a" is the leftmost column in the input) and a single digit
between 1 and 8 that determines the row (8 is the first row in the input). 



The pieces in the description must appear in the following order: King("K"), Queens ("Q"), Rooks ("R"), Bishops ("B"), Knights ("N"), and pawns. Note that the numbers of pieces may differ from the initial position because of capturing the pieces and the promotions
of pawns. In case two pieces of the same type appear in the input, the piece with the smaller row number must be described before the other one if the pieces are white, and the one with the larger row number must be described first if the pieces are black.
If two pieces of the same type appear in the same row, the one with the smaller column letter must appear first.

Sample Input

+---+---+---+---+---+---+---+---+
|.r.|:::|.b.|:q:|.k.|:::|.n.|:r:|
+---+---+---+---+---+---+---+---+
|:p:|.p.|:p:|.p.|:p:|.p.|:::|.p.|
+---+---+---+---+---+---+---+---+
|...|:::|.n.|:::|...|:::|...|:p:|
+---+---+---+---+---+---+---+---+
|:::|...|:::|...|:::|...|:::|...|
+---+---+---+---+---+---+---+---+
|...|:::|...|:::|.P.|:::|...|:::|
+---+---+---+---+---+---+---+---+
|:P:|...|:::|...|:::|...|:::|...|
+---+---+---+---+---+---+---+---+
|.P.|:::|.P.|:P:|...|:P:|.P.|:P:|
+---+---+---+---+---+---+---+---+
|:R:|.N.|:B:|.Q.|:K:|.B.|:::|.R.|
+---+---+---+---+---+---+---+---+

Sample Output

White: Ke1,Qd1,Ra1,Rh1,Bc1,Bf1,Nb1,a2,c2,d2,f2,g2,h2,a3,e4
Black: Ke8,Qd8,Ra8,Rh8,Bc8,Ng8,Nc6,a7,b7,c7,d7,e7,f7,h7,h6

给了一个固定大小的棋盘，要求输出黑白棋子的位置，本身题目不是很难，这种题目恶心在于要注意的地方很多：

1.白棋子是大写字母，黑棋子是小写字母。

2.棋盘的列是从左边开始是a一直到h，行驶从下面开始算1到上面的8。

3.白棋子输出是按照字母优先顺序，黑棋子输出是按照数字优先顺序。

4.本来到这里已经很恶心了，结果还有更奸诈的。。。那就是棋盘上的棋子数量是不固定的，不一定非得是这32个棋子，也是因为这个原因WA了一次。

代码：

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#pragma warning(disable:4996)
using namespace std;

char k_c[70],q_c[70],r_c[70],b_c[70],n_c[70],p_c[70],K_c[70],Q_c[70],R_c[70],B_c[70],N_c[70],P_c[70];

int  k_y[70],q_y[70],r_y[70],b_y[70],n_y[70],p_y[70],K_y[70],Q_y[70],R_y[70],B_y[70],N_y[70],P_y[70];

string temp,test[20];
int i,j,flag;
int k_num,q_num,r_num,b_num,n_num,p_num,K_num,Q_num,R_num,B_num,N_num,P_num;

int main()
{
	//freopen("i.txt","r",stdin);
	//freopen("o.txt","w",stdout);

	k_num=1;q_num=1;r_num=1;b_num=1;n_num=1;p_num=1;K_num=1;Q_num=1;R_num=1;B_num=1;N_num=1;P_num=1;

	cin>>temp;
	for(i=1;i<=8;i++)
	{
		cin>>test[i];
		cin>>temp;

		for(j=2;j<=30;j=j+4)
		{
			if(test[i][j]=='r')
			{
				r_c[r_num]='a'+(j/4);
				r_y[r_num]=9-i;
				r_num++;
			}
			else if(test[i][j]=='b')
			{
				b_c[b_num]='a'+(j/4);
				b_y[b_num]=9-i;
				b_num++;
			}
			else if(test[i][j]=='k')
			{
				k_c[k_num]='a'+(j/4);
				k_y[k_num]=9-i;
				k_num++;
			}
			else if(test[i][j]=='q')
			{
				q_c[q_num]='a'+(j/4);
				q_y[q_num]=9-i;
				q_num++;
			}
			else if(test[i][j]=='n')
			{
				n_c[n_num]='a'+(j/4);
				n_y[n_num]=9-i;
				n_num++;
			}
			else if(test[i][j]=='p')
			{
				p_c[p_num]='a'+(j/4);
				p_y[p_num]=9-i;
				p_num++;
			}
		}
	}
	for(i=8;i>=1;i--)
	{
		for(j=2;j<=30;j=j+4)
		{
			if(test[i][j]=='R')
			{
				R_c[R_num]='a'+(j/4);
				R_y[R_num]=9-i;
				R_num++;
			}
			else if(test[i][j]=='B')
			{
				B_c[B_num]='a'+(j/4);
				B_y[B_num]=9-i;
				B_num++;
			}
			else if(test[i][j]=='K')
			{
				K_c[K_num]='a'+(j/4);
				K_y[K_num]=9-i;
				K_num++;
			}
			else if(test[i][j]=='Q')
			{
				Q_c[Q_num]='a'+(j/4);
				Q_y[Q_num]=9-i;
				Q_num++;
			}
			else if(test[i][j]=='N')
			{
				N_c[N_num]='a'+(j/4);
				N_y[N_num]=9-i;
				N_num++;
			}
			else if(test[i][j]=='P')
			{
				P_c[P_num]='a'+(j/4);
				P_y[P_num]=9-i;
				P_num++;
			}
		}
	}

	flag=1;
	cout<<"White: ";
	for(i=1;i<K_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<"K"<<K_c[i]<<K_y[i];
		}
		else
		{
			cout<<",K"<<K_c[i]<<K_y[i];
		}
	}
	for(i=1;i<Q_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<"Q"<<Q_c[i]<<Q_y[i];
		}
		else
		{
			cout<<",Q"<<Q_c[i]<<Q_y[i];
		}
	}
	for(i=1;i<R_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<"R"<<R_c[i]<<R_y[i];
		}
		else
		{
			cout<<",R"<<R_c[i]<<R_y[i];
		}
	}
	for(i=1;i<B_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<"B"<<B_c[i]<<B_y[i];
		}
		else
		{
			cout<<",B"<<B_c[i]<<B_y[i];
		}
	}
	for(i=1;i<N_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<"N"<<N_c[i]<<N_y[i];
		}
		else
		{
			cout<<",N"<<N_c[i]<<N_y[i];
		}
	}
	for(i=1;i<P_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<P_c[i]<<P_y[i];
		}
		else
		{
			cout<<","<<P_c[i]<<P_y[i];
		}
	}
	cout<<endl;

	flag=1;
	cout<<"Black: ";
	for(i=1;i<k_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<"K"<<k_c[i]<<k_y[i];
		}
		else
		{
			cout<<",K"<<k_c[i]<<k_y[i];
		}
	}
	for(i=1;i<q_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<"Q"<<q_c[i]<<q_y[i];
		}
		else
		{
			cout<<",Q"<<q_c[i]<<q_y[i];
		}
	}
	for(i=1;i<r_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<"R"<<r_c[i]<<r_y[i];
		}
		else
		{
			cout<<",R"<<r_c[i]<<r_y[i];
		}
	}
	for(i=1;i<b_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<"B"<<b_c[i]<<b_y[i];
		}
		else
		{
			cout<<",B"<<b_c[i]<<b_y[i];
		}
	}
	for(i=1;i<n_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<"N"<<n_c[i]<<n_y[i];
		}
		else
		{
			cout<<",N"<<n_c[i]<<n_y[i];
		}
	}
	for(i=1;i<p_num;i++)
	{
		if(flag)
		{
			flag=0;
			cout<<p_c[i]<<p_y[i];
		}
		else
		{
			cout<<","<<p_c[i]<<p_y[i];
		}
	}
	cout<<endl;

	return 0;
}

版权声明：本文为博主原创文章，未经博主允许不得转载。