- 博客(18)
- 资源 (1)
- 收藏
- 关注
原创 Regionals 2015 :: Asia - Taipei C - Least Crucial Node 割点应用
http://acm.hust.edu.cn/vjudge/contest/130396#problem/C题意:一个图,给一个源点可以流水,只要在一个连通块都能流到。找一个点,使得去掉这个点后,水能流到的点最少。割点的应用,找出所有的割点,枚举删除每个割点后有多少个点不能被流到。因为数据范围只有100,所以标记割点过后,从源点开始dfs,能跑多少点就跑多少点,剩下的就是不能跑
2016-08-31 21:29:21 527
原创 Regionals 2015 :: Asia - Taipei B Linear Ecosystem 高斯消元(真模板)
http://acm.hust.edu.cn/vjudge/contest/130396#problem/B给个n*n的矩阵,每个变量为Xi,a[i][j]代表第i个方程的第j个变量的系数,=号右边为一个未知数Xi问这个方程组是否有解,且解全非0.高斯消元模板#include using namespace std;const int N = 10+5;con
2016-08-31 21:21:39 427
原创 codeforces 711D. Directed Roads 找环
D. Directed Roadstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon has explored Uday
2016-08-31 21:09:14 948
原创 UVALive 7269 Snake Carpet 构造 2015北京区域赛的铜牌题
链接点击打开链接题意:给一个数字n,代表有n条蛇编号为1--n,第i条蛇长度为i,用这些蛇构成一个矩形,要求是,编号为奇数的只能转奇数次弯,偶数只能转偶数次弯(蛇身)。输出要求先输出这个矩形的宽和长,然后从编号1开始,输出每条蛇从舌头到蛇尾的坐标。长和宽很容易确定,毕竟只有(n+1)*n/2个数字一开始我是蒙蔽的,涛神给我讲了还是蒙蔽的,直到学长给我讲了一种方法。先特判1到
2016-08-22 20:14:58 873
原创 hdu 4587 TWO NODES (割点的应用)
TWO NODESTime Limit: 24000/12000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1925 Accepted Submission(s): 632Problem DescriptionSuppose that G
2016-08-19 16:30:17 577
原创 hdu 5724 Chess (SG函数)
ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1935 Accepted Submission(s): 842Problem DescriptionAlice and Bob are pla
2016-08-18 22:45:35 357
原创 hdu 5833 Zhu and 772002 高斯消元
Zhu and 772002Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1253 Accepted Submission(s): 444Problem DescriptionZhu and 7720
2016-08-17 21:49:01 560 1
原创 hdu 5742 chess SG函数
ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1908 Accepted Submission(s): 831Problem DescriptionAlice and Bob are pla
2016-08-17 17:12:01 448
原创 基础博弈论题目
关于博弈论的博客:点击打开链接看几遍博客再做题是极好的。hdu1846巴什博奕,看博客#include using namespace std;int main(void){ int T; scanf("%d",&T); while(T--){ int n,m; scanf("%d%d",&n,&m)
2016-08-17 13:23:05 2096
原创 hdu 2196 Computer 树形DP或者树的直径
ComputerTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5805 Accepted Submission(s): 2909Problem DescriptionA school bought t
2016-08-15 13:00:11 508
原创 codeforces 706D. Vasiliy's Multiset 带删除操作的字典树(真模版)
D. Vasiliy's Multisettime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAuthor has gone out of the stories about Vasili
2016-08-13 16:07:24 817
原创 PowerOJ 1100 最短的名字 字典树半个模版
Description 在一个奇怪的村子中,很多人的名字都很长,比如aaaaa, bbb and abababab。名字这么长,叫全名显然起来很不方便。所以村民之间一般只叫名字的前缀。比如叫'aaaaa'的时候可以只叫'aaa',因为没有第二个人名字的前三个字母是'aaa'。不过你不能叫'a',因为有两个人的名字都以'a'开头。村里的人都很聪明,他们总是用最短的称呼叫人。输入保证村
2016-08-10 11:06:41 553
原创 HDU 1150 Machine Schedule 二分匹配
Machine ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8191 Accepted Submission(s): 4094Problem DescriptionAs we all
2016-08-08 20:26:40 449
原创 HDU 5234 Happy birthday 类背包dp
Problem DescriptionToday is Gorwin’s birthday. So her mother want to realize her a wish. Gorwin says that she wants to eat many cakes. Thus, her mother takes her to a cake garden. The garden i
2016-08-08 11:50:53 466
原创 codeforces 17D. Notepad 欧拉函数降幂
D. Notepadtime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputNick is attracted by everything unconventional. H
2016-08-07 11:09:09 800
原创 HDU 5806 NanoApe Loves Sequence Ⅱ two pointers
NanoApe Loves Sequence ⅡTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 425 Accepted Submission(s): 207Problem DescriptionN
2016-08-07 09:46:10 439
原创 codeforces 701E. Connecting Universities 树
E. Connecting Universitiestime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTreeland is a country in which t
2016-08-03 15:18:02 981
原创 codeforces 701C. They Are Everywhere two pointers
C. They Are Everywheretime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSergei B., the young coach of Pokemo
2016-08-02 10:52:23 479
EasyCopy.zip
2024-08-09
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人