CodeForces 69D Dot (游戏+记忆)
2015-09-10 12:47
357 查看
Description
Anton and Dasha like to play different games during breaks on checkered paper. By the 11th grade they managed to play all the games of this type and asked Vova the programmer to come up with a new game. Vova suggested to them to play a game under the code
name "dot" with the following rules:
On the checkered paper a coordinate system is drawn. A dot is initially put in the position
(x, y).
A move is shifting a dot to one of the pre-selected vectors. Also each player can once per game symmetrically reflect a dot relatively to the line
y = x.
Anton and Dasha take turns. Anton goes first.
The player after whose move the distance from the dot to the coordinates' origin exceeds
d, loses.
Help them to determine the winner.
Input
The first line of the input file contains 4 integers x,
y, n,
d ( - 200 ≤ x, y ≤ 200, 1 ≤ d ≤ 200, 1 ≤ n ≤ 20) — the initial coordinates of the dot, the distance
d and the number of vectors. It is guaranteed that the initial dot is at the distance less than
d from the origin of the coordinates. The following
n lines each contain two non-negative numbers
xi and
yi (0 ≤ xi, yi ≤ 200) — the coordinates of the i-th
vector. It is guaranteed that all the vectors are nonzero and different.
Output
You should print "Anton", if the winner is Anton in case of both players play the game optimally, and "Dasha" otherwise.
Sample Input
Input
Output
Input
Output
题意:有一个移点的游戏,Anton先移,有n个移动选择。也能够沿着直线y=x对称且仅仅能一次,假设有人先移动到距离原点>=d的时候为输
思路:对于直线y=x对称的情况,没有考虑。由于假设有人下一步一定移到>=d的位置的话。那对称是解决不了问题的,所以我们不考虑,如今设dfs(x, y)表示当前移动人能否赢,一旦有必赢的情况就返回赢
Anton and Dasha like to play different games during breaks on checkered paper. By the 11th grade they managed to play all the games of this type and asked Vova the programmer to come up with a new game. Vova suggested to them to play a game under the code
name "dot" with the following rules:
On the checkered paper a coordinate system is drawn. A dot is initially put in the position
(x, y).
A move is shifting a dot to one of the pre-selected vectors. Also each player can once per game symmetrically reflect a dot relatively to the line
y = x.
Anton and Dasha take turns. Anton goes first.
The player after whose move the distance from the dot to the coordinates' origin exceeds
d, loses.
Help them to determine the winner.
Input
The first line of the input file contains 4 integers x,
y, n,
d ( - 200 ≤ x, y ≤ 200, 1 ≤ d ≤ 200, 1 ≤ n ≤ 20) — the initial coordinates of the dot, the distance
d and the number of vectors. It is guaranteed that the initial dot is at the distance less than
d from the origin of the coordinates. The following
n lines each contain two non-negative numbers
xi and
yi (0 ≤ xi, yi ≤ 200) — the coordinates of the i-th
vector. It is guaranteed that all the vectors are nonzero and different.
Output
You should print "Anton", if the winner is Anton in case of both players play the game optimally, and "Dasha" otherwise.
Sample Input
Input
0 0 2 3 1 1 1 2
Output
Anton
Input
0 0 2 4 1 1 1 2
Output
Dasha
题意:有一个移点的游戏,Anton先移,有n个移动选择。也能够沿着直线y=x对称且仅仅能一次,假设有人先移动到距离原点>=d的时候为输
思路:对于直线y=x对称的情况,没有考虑。由于假设有人下一步一定移到>=d的位置的话。那对称是解决不了问题的,所以我们不考虑,如今设dfs(x, y)表示当前移动人能否赢,一旦有必赢的情况就返回赢
#include <iostream> #include <cstring> #include <cstdio> #include <algorithm> using namespace std; const int maxn = 500; int n, d; int dx[maxn], dy[maxn]; int vis[maxn][maxn]; int dfs(int x, int y) { if ((x-200)*(x-200) + (y-200)*(y-200) >= d*d) return 1; if (vis[x][y] != -1) return vis[x][y]; for (int i = 0; i < n; i++) if (dfs(x+dx[i], y+dy[i]) == 0) return vis[x][y] = 1; return vis[x][y] = 0; } int main() { int x, y; scanf("%d%d%d%d", &x, &y, &n, &d); x += 200, y += 200; for (int i = 0; i < n; i++) scanf("%d%d", &dx[i], &dy[i]); memset(vis, -1, sizeof(vis)); if (dfs(x, y)) printf("Anton\n"); else printf("Dasha\n"); return 0; }
相关文章推荐
- C#读写txt文件的两种方法介绍
- C++用法的学习心得
- c语言学习一
- 数据结构与算法学习之链表的增加、删除
- C强大而灵活的数据
- LA 3882 And Then There Was One 递推
- PowerDesigner修改设计图中文字的字体大小等样式
- ssm中关于basedao和baseMapper的区别
- Golang资源
- UI一揽子计划 1 (UIView UILabel)
- 什么导致了Context泄露:Handler&内部类
- I2C 不良
- Java HTTPS客户端如何处理证书
- 同余定理 专题
- malloc_stats---检查内存泄露的神器
- malloc_stats---检查内存泄露的神器
- malloc_stats---检查内存泄露的神器
- 如何区分cassandra里primary key,partition key,cluster key,clustering key
- iOS 如何在ARC下 使用MRC的类库
- Android项目中TabHost标签切换