hdu4461 The Power of Xiangqi

发布时间:2017-1-18 22:01:19 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"hdu4461 The Power of Xiangqi",主要涉及到hdu4461 The Power of Xiangqi方面的内容,对于hdu4461 The Power of Xiangqi感兴趣的同学可以参考一下。

The Power of Xiangqi Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 679 Accepted Submission(s): 363 Problem Description Xiangqi is one of the most popular two-player board games in China. The game represents a battle between two armies with the goal of capturing the enemy’s “general” piece. Now we introduce some basic rules of Xiangqi. Xiangqi is played on a 10×9 board and the pieces are placed on the intersections (points). There are two groups of pieces marked by black or red Chinese characters, belonging to the two players separately. During the game, each player in turn moves one piece from the point it occupies to another point. No two pieces can occupy the same point at the same time. A piece can be moved onto a point occupied by an enemy piece, in which case the enemy piece is "captured" and removed from the board. When the general is in danger of being captured by the enemy player on the enemy player’s next move, the enemy player is said to have "delivered a check". If the general's player can make no move to prevent the general's capture by next enemy move, the situation is called “checkmate”. Each player has 7 kinds of pieces in this game. Their names, offense power and symbol letters are shown in the table below: Now show you the pieces of red player and black player, you are going to find out which player has the larger total offense power. Since Ma and Pao working together can have good effect, if a player has no Ma or no Pao, or has neither, his total offense power will be decreased by one. But the total offense power can't be decreased to zero, it is at least one. Input The first line is an integer T ( T <= 20) meaning there are T test cases. For each test case: The first line shows which pieces the red player has. It begins with an integer n ( 0 < n <= 16) meaning the number of pieces. Then n letters follows, all separated by one or more blanks. Each letter is a symbol letter standing for a piece, as shown in the table above. The second line describes the situation of the black player, in the same format as the first line. Output For each test case, if the red player has more offense power, then print "red". If the black player has more offense power, then print "black". If there is a tie, print "tie". Sample Input 3 2 A B 2 A B 7 A A B C D D F 7 A A B B C C F 5 A A B B F 3 A B F Sample Output tie black red Source #include <iostream> #include <stdio.h> #include <algorithm> #include <string.h> using namespace std; int num[]={16,7,8,1,1,2,3},no[8]; int main() { int tcase,n,sum1,sum2; char c; scanf("%d",&tcase); while(tcase--) { memset(no,0,sizeof(no)); sum1=sum2=0; scanf("%d",&n); getchar(); while(n--) { c=getchar(); getchar(); sum1+=num[c-'A']; no[c-'A']++; } if(no[1]==0||no[2]==0) { if(sum1>=2) sum1--; } memset(no,0,sizeof(no)); scanf("%d",&n); getchar(); while(n--) { c=getchar(); getchar(); sum2+=num[c-'A']; no[c-'A']++; } if(no[1]==0||no[2]==0) { if(sum2>=2) sum2--; } if(sum1>sum2) printf("red\n"); else if(sum1==sum2) { printf("tie\n"); } else printf("black\n"); } return 0; } 2012 Asia Hangzhou Regional Contest