- 博客(54)
- 收藏
- 关注
RSS订阅原创 HDU 5607 graph(矩阵快速幂)
类似图上的概率dp#include#include#include#include#include#include#include#include#include#include#include#include#include#define hash hashhusing namespace std;typedef long long ll;#defin
2016-03-31 21:58:40
401
原创 hdu 1241 Oil Deposits (BFS)
简单BFS#include#include#include#include#include#include#include#include#include#include#include#include#include#define hash hashhusing namespace std;typedef long long ll;#define in
2016-03-25 12:41:54
432
原创 HDU 1495非常可乐(BFS)
当s为奇数时直接输出NO 否则容易超时。。#include#include#include#include#include#include#include#include#include#include#include#include#include#define hash hashhusing namespace std;typedef long long
2016-03-25 11:18:19
375
原创 ZOJ 3846 GCD Reduce(数学)
给出一个序列，你可以将任意两个数字替换成他们的最大公约数，问需要几次操作可以都变成1.可以知道该问题有解的充必条件为gcd(a1,a2,a3....an)=1，#include#include#include#include#include#include#include#include#include#include#include#include
2016-03-24 17:43:47
525
原创 POJ 3126 Prime Path(BFS)
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define mt(a) memset(a,0,sizeof (a))#define fl(a,b,c) f
2016-03-22 18:28:06
355
原创 POJ 1426 Find The Multiple (BFS)
好题，相对应还有更难的题目#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define mt(a) memset(a,0,sizeof (a))
2016-03-22 18:03:57
346
原创 ZOJ 3777 Problem Arrangement(状压DP)
#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;#define sp system("pause")#define mt(dp) memset
2016-03-20 18:24:53
506
原创 ZOJ 3822 Domination(概率DP)
#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;#define sp system("pause")#define mt(dp) memset
2016-03-20 18:24:15
431
原创 ZOJ 3908 Number Game
#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long ll;#define PB push_
2016-03-20 18:23:42
414
原创 ZOJ 3870 Team Formation（位运算）
#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long ll;#define PB push_
2016-03-20 18:21:50
403
原创 ZOJ 3844 Easy Task(暴力)
直接暴力#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long ll;#def
2016-03-20 18:21:04
402
原创 POJ 3984 迷宫问题(BFS)
简单深搜#include#include#include#include#include#include#include#include#include#include#include#include#include#define hash hashhusing namespace std;typedef long long ll;#define sp
2016-03-19 16:51:44
397
原创 ZOJ 3620 Escape Time II(BFS)
给出一个无向图，给出时间，问在时间范围内你最多能取走多少珠宝#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;int ans[120];
2016-03-19 11:08:22
367
原创 POJ 3278 Catch That Cow
给出两个数字 和三种操作分别是加一减一和乘2，问第一个数变成第二个书的最小操作数#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;int
2016-03-19 11:06:39
343
原创 POJ 2488 A Knight's Journey（DFS）
给出棋盘，要求判断马能否只经过每个格子一次并走完全部格子 要求字典序输出#include#include#include#include#include#include#include#include#include#include#include#include#include#define hash hashhusing namespace std;t
2016-03-19 11:05:30
325
原创 POJ 1753 Flip Game
#include#include#include#include#include#include#include #define ll long longusing namespace std;int st,vis[(1 17)];int change(int x,int w){ x ^= (1 w); if(w > 3) {
2016-03-19 11:03:48
345
原创 CodeForces 217A Ice Skating(DFS)
判断联通快个数 答案为个数减一#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;int ans[120];#define sp s
2016-03-19 11:03:14
621
原创 POJ 2251 Dungeon Master(BFS)
好玩 三维BFS#include#include#include#include#include#include#include#include#include#include#include#include#include#define hash hashhusing namespace std;typedef long long ll;#defi
2016-03-18 12:52:53
340
原创 POJ 1321 棋盘问题(DFS)
跟八皇后差不多的搜索问题，稍微复杂一点#include#include#include#include#include#include#include#include#include#include#include#include#define hash hashhusing namespace std;typedef long long ll;#def
2016-03-18 10:45:38
361
原创 CodeForces 148D Bag of mice(概率DP)
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;int ans[120];#define sp system("pause")#define mt(dp) m
2016-03-16 21:15:41
469
原创 CodeForces 148C Terse princess(模拟)
太坑了。。。这题#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;int ans[120];#define sp system("pause")#d
2016-03-16 21:13:58
519
原创 CodeForces 148B Escape(数学)
#include#include#include#includeusing namespace std;typedef long long ll;ll ans[120];#define sp system("pause");int main(){ double vd, vp, t, f, c; cin >> vp >> vd >> t >> f >> c; if (v
2016-03-16 21:12:55
739
原创 CodeForces 148A Insomnia cure
#includeusing namespace std;int main(){ int a[4], b; for (int i = 0; i 4; i++) cin >> a[i]; cin >> b; int ans = b; for (int i = 1; i b; i++) { int ok = 0; for (int j = 0; j 4; j++)
2016-03-16 21:10:52
553
原创 HDU 2412 Party at Hali-Bula(树状DP)
如何得到最大人数还是比较简单的。。。难的是如何判断唯一。。搞不出来#include#include#include#include#include#include#include#include#include#include#include#include#define hash hashhusing namespace std;typedef long
2016-03-16 21:03:55
319
原创 HDU 5067 Harry And Dig Machine(暴力)
好像状压DP也能搞，2^10的复杂度应该是比直接暴力40W的复杂度好很多，不减枝的话900ms，减枝可以优化到600ms#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include
2016-03-15 21:01:02
441
原创 HDU 5066 Harry And Physical Teacher(数学)
动能方程。。。。。#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define mt(a) memset(a,0,sizeof (a))#define
2016-03-15 21:00:14
383
原创 ZOJ 2852 Deck of Cards(DP)
按要求把牌一次放入#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define mt(a) memset(a,0,sizeof
2016-03-15 17:31:50
474
原创 HDU 1074 The Highest Mark(状压DP)
坑需要输出路径，方法是对每种状态保存当前最优的路径，这题还要求字典序，需要比较#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define mt(a)
2016-03-14 21:20:00
384
原创 HDU 1257 SDOI(贪心)
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define mt(a) memset(a,0,sizeof (a))#define fl(a,b,c) f
2016-03-14 21:18:57
463
原创 ZOJ 3487 Ordinal Numbers（模拟）
分类讨论#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long
2016-03-13 20:22:47
396
原创 ZOJ 3488 Conic Section
#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long ll;#define PB push_
2016-03-13 20:22:14
350
原创 ZOJ 3490 String Successor(模拟)
比较麻烦 坑的地方比较多#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long l
2016-03-13 20:21:36
416
原创 ZOJ 3492 Kagome Kagome
#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long ll;#define PB push_
2016-03-13 20:20:57
400
原创 ZOJ 3497 Mistwald(矩阵快速幂)
水题#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long ll
2016-03-13 18:01:54
411
原创 ZOJ 3498 Javabeans(数学)
吃豆子，log2+1#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long ll;
2016-03-13 18:00:35
374
原创 ZOJ 3499 Median(数学)
求中间数，水题#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long ll;#de
2016-03-13 17:59:47
460
原创 CodeForces 611C New Year and Domino(DP)
给定一个矩形。要求算出该矩形里相邻两个元素都为空的个数；查询次数很多 所以先对大的矩形dp分别求列上的个数和行上的个数，然后根据给出的条件逐个求和#include#include#include#include#include#include#include#include#include#include#include#include#include#
2016-03-12 12:54:41
515
原创 CodeForces 611B New Year and Old Property(模拟)
给定一个区间，要求求出该区间内，二进制数中只有一个0的数字的个数；直接模拟，将十进制转成二进制，直接枚举所有可能的结果#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includ
2016-03-12 12:26:25
479
原创 ZOJ 3919 Ellipse(数学)
给出一个椭圆，要求算与圆心在原点的圆相切 且四个点都在椭圆上的平行四边形的最大和最小面积#include#include#include#include#include#include #include #include #include #include #include #include #include #include#include#includ
2016-03-08 19:28:27
756
原创 ZOJ 3926 Parity Modulo P(XJB)
随机数啊 缘分过#include#include#include#include#include#include #include #include #include #include #include #include #include #include#include#include#include using namespace std;#d
2016-03-08 19:25:59
602
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人