Topcoder SRM 514div2 500point
2011-08-10 14:24
357 查看
可以说是一道水题,本以为dfs一下就ok,但是仔细想想,是有规律的,因为题目说可以任意使用,所以,只要jumptype里面有偶数,就一定yes,为啥呢?因为以2为例,2是可以到达棋盘任何地方的,推广到其它偶数,他们都可以到达任何地方。另外,当(x+y)为偶数时,也一定yes
#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> using namespace std; class MagicalGirlLevelTwoDivTwo { public: string isReachable(vector <int>, int, int); bool dfs(int s,int t,int x,int y); }; string MagicalGirlLevelTwoDivTwo::isReachable(vector <int> v, int x, int y) { int i,j; if(!x&&!y)return "YES"; bool even=0; for(i=0;i<v.size();i++) if(v[i]%2==0)even=1; if(even)return "YES"; if((x+y)%2==0)return "YES"; return "NO"; }
相关文章推荐
- TopCoder SRM 152 div 2 500point
- Topcoder SRM 358:SameDigits
- TOPCODER_SRM580_DIV2_2---------枚举
- TopCoder 250 points 10-SRM 148 DIV 2 167.20/250 66.88%
- TopCoder 550 points 1-SRM 144 DIV 1 165/550 30%
- TopCoder SRM 582 ColorfulBuilding
- TopCoder SRM 596 Div2 第3题
- TopCoder SRM 598 Div1 第1题
- TopCoder SRM 144 DIV2(200-point)
- topcoder srm 610
- TOPCODER SRM 613 DIV2
- topcoder SRM 625 DIV2 AddMultiply
- 【TopCoder】SRM159 DIV2总结
- Topcoder SRM 148 Div2 1000(dfs搜索+hash判重)
- topcoder SRM 637 DIV2题解
- TopCoder SRM 647 Div2 Problem 500 - TravellingSalesmanEasy (思维)
- TopCoder SRM 654 Div2 Problem 500 - OneEntrance (思维)
- Topcoder SRM 662 Div1, ExactTree,DP
- [TopCoder] SRM 586 DIV 2, 500p, 1000p, Solution
- TopCoder SRM 701 div1. 900 FibonacciStringSum - 矩阵乘法