贪心
文章平均质量分 86
lethalboy
这个作者很懒,什么都没留下…
展开
-
codeforces 721B B. Passwords -- by lethalboyd
题意:给了n个密码串,然后按长度从小到大开始试,同长度串任意顺序试,尝试k次后需等待5s再试,试一次1s,问最少和最多的花费时间;记录待尝试的串中长度小于正确串的个数s,长度等于正确串的个数t则: 最少时间:s+s/k*5+1 最大时间:t+s+(s+t-1)/k*5附代码:[cpp] view plain copy#in原创 2016-10-08 13:13:13 · 623 阅读 · 0 评论 -
1639: [Usaco2007 Mar]Monthly Expense 月度开支
1639: [Usaco2007 Mar]Monthly Expense 月度开支Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 927 Solved: 455[Submit][Status][Discuss]DescriptionFarmer John是一个令人惊讶的会计学天才,他已经明白了他可能会花光他的钱,这些钱本来是要维原创 2016-11-12 20:57:23 · 534 阅读 · 0 评论 -
1640: [Usaco2007 Nov]Best Cow Line 队列变换
1640: [Usaco2007 Nov]Best Cow Line 队列变换Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 854 Solved: 441[Submit][Status][Discuss]DescriptionFJ打算带着他可爱的N (1 ≤ N ≤ 2,000)头奶牛去参加”年度最佳老农”的比赛.在比赛中,每原创 2016-11-12 21:37:15 · 293 阅读 · 0 评论 -
1650: [Usaco2006 Dec]River Hopscotch 跳石子
1650: [Usaco2006 Dec]River Hopscotch 跳石子Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 567 Solved: 373[Submit][Status][Discuss]DescriptionEvery year the cows hold an event featuring a pecu原创 2016-11-13 17:48:05 · 291 阅读 · 0 评论 -
1689: [Usaco2005 Open] Muddy roads 泥泞的路
1689: [Usaco2005 Open] Muddy roads 泥泞的路Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 374 Solved: 265[Submit][Status][Discuss]DescriptionFarmer John has a problem: the dirt road from his f原创 2016-11-15 13:38:27 · 330 阅读 · 0 评论 -
2020: [Usaco2010 Jan]Buying Feed, II
2020: [Usaco2010 Jan]Buying Feed, IITime Limit: 3 Sec Memory Limit: 64 MBSubmit: 300 Solved: 220[Submit][Status][Discuss]Description(buying.pas/buying.in/buying.out 128M 1S) Farmer John原创 2016-11-15 20:42:30 · 390 阅读 · 0 评论 -
bzoj2430: [Poi2003]Chocolate
2430: [Poi2003]Chocolate Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 163 Solved: 126[Submit][Status][Discuss]Description有一块n*m的矩形巧克力,准备将它切成n*m块。巧克力上共有n-1条横线和m-1条竖线,你每次可以沿着其中的一条横线或竖原创 2016-12-11 12:40:19 · 441 阅读 · 0 评论 -
bzoj1016 最小生成树计数 (性质+克鲁斯卡尔)[省选计划系列题]
1016: [JSOI2008]最小生成树计数Time Limit: 1 Sec Memory Limit: 162 MBSubmit: 5098 Solved: 2074[Submit][Status][Discuss]Description 现在给出了一个简单无向加权图。你不满足于求出这个图的最小生成树,而希望知道这个图中有多少个不同的最小生成树。(如果两颗最原创 2016-12-23 22:05:00 · 616 阅读 · 0 评论 -
codeforces 758 D. Ability To Convert
D. Ability To Converttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlexander is learning how to conve原创 2017-01-20 04:34:04 · 664 阅读 · 0 评论