poj 2425 A Chess Game(SG函数)
A Chess Game
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 3551 | Accepted: 1440 |
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
4 2 1 2 0 1 3 0 1 0 2 0 2 0 4 1 1 1 2 0 0 2 0 1 2 1 1 3 0 1 3 0
Sample Output
WIN WIN WIN LOSE WIN
Hint
Huge input,scanf is recommended.
Source
PKU Monthly,CHEN Shixi(xreborner)
【思路】
SG函数。
把每个询问视作一组游戏,ans为每组游戏sg函数的xor值。
sg(x)=mex(S),其中mex(S)表示取后继集合所没有出现的sg值中最小的一个。
做这道题学到了一个有意思的经验:因为vis每一层dfs都会独立用到,所以如果放在dfs外面声明为全局变量的话vis就会被接下来的dfs所覆盖。
【代码】
1 #include<cstdio> 2 #include<vector> 3 #include<cstring> 4 #include<iostream> 5 #define FOR(a,b,c) for(int a=(b);a<(c);a++) 6 using namespace std; 7 8 const int N = 1000+10; 9 10 int n,m,sg[N]; 11 vector<int> G[N]; 12 13 int dfs(int u) { 14 if(sg[u]!=-1) return sg[u]; 15 int vis[N]; 16 memset(vis,0,sizeof(vis)); 17 FOR(i,0,G[u].size()) 18 vis[dfs(G[u][i])]=1; 19 for(int i=0;;i++) 20 if(!vis[i]) return sg[u]=i; 21 } 22 int main() { 23 while(scanf("%d",&n)==1) { 24 FOR(i,0,n) G[i].clear(); 25 int v; 26 FOR(i,0,n) { 27 scanf("%d",&m); 28 FOR(j,0,m) { 29 scanf("%d",&v); 30 G[i].push_back(v); 31 } 32 } 33 memset(sg,-1,sizeof(sg)); 34 while(scanf("%d",&m) && m) { 35 int ans=0,q; 36 FOR(i,0,m) 37 scanf("%d",&q) , ans^=dfs(q); 38 if(ans) puts("WIN"); else puts("LOSE"); 39 } 40 } 41 return 0; 42 }
posted on 2016-01-30 17:22 hahalidaxin 阅读(248) 评论(0) 编辑 收藏 举报
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· Java 中堆内存和栈内存上的数据分布和特点
· 开发中对象命名的一点思考
· .NET Core内存结构体系(Windows环境)底层原理浅谈
· C# 深度学习:对抗生成网络(GAN)训练头像生成模型
· .NET 适配 HarmonyOS 进展
· 手把手教你更优雅的享受 DeepSeek
· 腾讯元宝接入 DeepSeek R1 模型,支持深度思考 + 联网搜索,好用不卡机!
· AI工具推荐:领先的开源 AI 代码助手——Continue
· 探秘Transformer系列之(2)---总体架构
· V-Control:一个基于 .NET MAUI 的开箱即用的UI组件库