dfs
文章平均质量分 82
KeyboardPianist
这个作者很懒,什么都没留下…
展开
-
HDU 5305 Friends DFS+剪枝
题意:n个人,m对朋友,每一对朋友可以是online friend或者offline friends,m对朋友不重复,每个人的两种朋友数量必须相等,问有多少种方法满足要求方法:注意:朋友的朋友和自己没有关系,用DFS回溯+剪枝,测试每对朋友为online friend和offline friends的情况,当任一个人的朋友数为奇数时候可以直接输出0因为分配不 了,原创 2015-08-27 22:46:32 · 480 阅读 · 0 评论 -
Codeforces Round #383 (Div. 2)C. Arpa's loud Owf and Mehrdad's evil plan
C. Arpa's loud Owf and Mehrdad's evil plantime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs you have noticed, there are lovely g原创 2016-12-07 06:53:50 · 886 阅读 · 0 评论 -
Codeforces700B. Connecting Universities
B. Connecting Universitiestime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTreeland is a country in which there are n towns conne原创 2016-09-29 21:10:33 · 462 阅读 · 0 评论 -
CodeForces 731C. Socks(DFS)
C. Sockstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputArseniy is already grown-up and independent. His mother decided to leave原创 2016-10-24 21:06:53 · 406 阅读 · 0 评论 -
HDU5927 Auxiliary Set(dfs)
Auxiliary SetTime Limit: 9000/4500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 937 Accepted Submission(s): 289Problem DescriptionGiven a rooted t原创 2016-10-23 23:21:57 · 432 阅读 · 0 评论 -
HDU5877 Weak Pair(树状数组+dfs)
Weak PairTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1161 Accepted Submission(s): 392Problem DescriptionYou are given a r原创 2016-09-12 10:56:31 · 468 阅读 · 0 评论 -
Codeforces Round #313 (Div. 2)560D. Equivalent Strings
D. Equivalent Stringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday on a lecture about strings Gera原创 2016-08-31 10:10:23 · 796 阅读 · 0 评论 -
Codeforces586D. Phillip and Trains(DFS)
D. Phillip and Trainstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe mobile application store has a new原创 2016-08-18 15:07:15 · 548 阅读 · 0 评论 -
CodeForces 688C-NP-Hard Problem(dfs)
C. NP-Hard Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Pari and Arya did some research about NP-Hard proble原创 2016-07-24 23:10:25 · 515 阅读 · 0 评论 -
codeforces 653B Bear and Compressing (dfs)
B. Bear and Compressingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is a little polar bear. Polar bears hate long strin原创 2016-05-07 14:11:21 · 745 阅读 · 0 评论 -
HDU 2918 Tobo or not Tobo DFS
题意:给出10个数,第一个数表示旋转最大次数Y(小于10),后面的为1~9之间的数依次代表3*3矩阵的从上到下,左到右的数。旋转方法:一个2*2的矩阵逆时针或顺时针旋 转90度。问有没有不大于 旋转最大次数 的方法旋转,使得矩阵变为 row1: 123 row2:456, row3:789, 若有再输出最小值,若无则输出-1。思路:因为是3*3矩阵,能旋转的不同方法就8钟, 可以用原创 2015-09-09 15:18:30 · 517 阅读 · 0 评论 -
Codeforces Round #385 (Div. 1)A. Hongcow Builds A Nation
A. Hongcow Builds A Nationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHongcow is ruler of the world. As ruler of the world,原创 2016-12-18 22:13:30 · 520 阅读 · 0 评论