poj_A Chess Game2425
来源:互联网 发布:淘宝网店怎么设置客服 编辑:程序博客网 时间:2024/06/07 02:20
A Chess Game
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 3094 Accepted: 1266
Description
Let's design a new chess game. There are N positions to hold M chesses in this game. Multiple chesses can be located in the same position. The positions are constituted as a topological graph, i.e. there are directed edges connecting some positions, and no cycle exists. Two players you and I move chesses alternately. In each turn the player should move only one chess from the current position to one of its out-positions along an edge. The game does not end, until one of the players cannot move chess any more. If you cannot move any chess in your turn, you lose. Otherwise, if the misfortune falls on me... I will disturb the chesses and play it again.
Do you want to challenge me? Just write your program to show your qualification!
Do you want to challenge me? Just write your program to show your qualification!
Input
Input contains multiple test cases. Each test case starts with a number N (1 <= N <= 1000) in one line. Then the following N lines describe the out-positions of each position. Each line starts with an integer Xi that is the number of out-positions for the position i. Then Xi integers following specify the out-positions. Positions are indexed from 0 to N-1. Then multiple queries follow. Each query occupies only one line. The line starts with a number M (1 <= M <= 10), and then come M integers, which are the initial positions of chesses. A line with number 0 ends the test case.
Output
There is one line for each query, which contains a string "WIN" or "LOSE". "WIN" means that the player taking the first turn can win the game according to a clever strategy; otherwise "LOSE" should be printed.
Sample Input
42 1 201 301 02 0 2041 11 2002 0 12 1 13 0 1 30
Sample Output
WINWINWINLOSEWIN
#include <istream>#include <cstring>#include <cstdio>#define N 1010using namespace std;int g[N];int n;bool map[N][N];int sg(int num){ if(g[num] != -1) return g[num]; int temp = 0; for (int i = 0; i < n; i++) { if (map[num][i]) { if (sg(i) == temp) temp++; } } g[num] = temp; return temp;}int main(){ while (scanf("%d", &n) != EOF) { memset(g, -1, sizeof(g)); memset(map, 0, sizeof(map)); for (int i = 0; i < n; i++) { int m; scanf("%d", &m); int sum = 0; while (m--) { int a; scanf("%d", &a); map[i][a] = 1; sum ++; } if(sum == 0) g[i] = 0; } int m; while (scanf("%d", &m) != EOF && m) { int res = 0; while (m--) { int a; scanf("%d", &a); res = res ^ sg(a); } if(res == 0) printf("LOSE\n"); else printf("WIN\n"); } } return 0;}
0 0
- poj_A Chess Game2425
- chess
- Chess
- chess
- chess
- Chess
- Chess
- Chess
- chess
- Chess
- Chess
- Chess Tutorial
- Network chess
- java chess
- MM-Chess
- codeforces Chess
- CSU1459:Chess
- AHOI2009 chess
- uva 11538 - Chess Queen(数论)
- SELECT超时小结
- 备忘之 拷贝构造函数
- [hdu4041]Eliminate Witches!
- struts2使用JSP直接访问国际化资源文件
- poj_A Chess Game2425
- uva 103Stacking Boxes
- PAT 1006. 换个格式输出整数
- 《程序员面试宝典》打印规律矩阵
- 单例模式的七种写法
- Socket通信(TCP)非阻塞模式-select模型
- ABAP內表中列累加的两种方法。
- 12项目四。日期时间类
- Linq To EF 使用小知识(添加记录后获取添加的自增ID和叫“ID”的列不是自增列不让插入的问题)