Atcoder Grand Contest 016F - Games on DAG

最新推荐文章于 2020-06-24 09:13:16 发布

wxh010910

最新推荐文章于 2020-06-24 09:13:16 发布

阅读量1.3k

点赞数 3

本文链接：https://blog.csdn.net/wxh010910/article/details/73467905

版权

给定一个有向无环图（DAG），Alice和Bob进行一场移动棋子的游戏。从节点1和2开始，玩家按顺序选择一条有棋子的边并将棋子移动到相邻节点。无法移动的玩家输。求所有可能的子图中，Alice能获胜的数量（模10^9 + 7）。

摘要由CSDN通过智能技术生成

Problem Statement

There is a directed graph G with N vertices and M edges. The vertices are numbered 1 through N, and the edges are numbered 1 through M. Edge i is directed from xi to yi. Here, xi<yi holds. Also, there are no multiple edges in G.

Consider selecting a subset of the set of the M edges in G, and removing these edges from G to obtain another graph G'. There are 2M different possible graphs as G'.

Alice and Bob play against each other in the following game played on G'. First, place two pieces on vertices 1 and 2, one on each. Then,