usaco题解
文章平均质量分 88
阿蒋
啦啦啦
展开
-
poj3251 & usaco 月赛 2006 Big Square 题解
【原题】Big SquareTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2569 Accepted: 624DescriptionFarmer John's cows have entered into a competition wi原创 2014-04-10 16:16:48 · 2505 阅读 · 0 评论 -
*usaco training 5.4.4 Betsy's Tour 题解
【原题】Betsy's TourDon PieleA square township has been divided up into N2 square plots (1 <= N <= 7). The Farm is located in the upper left plot and the Market is located in the lower left plot原创 2014-03-15 13:46:38 · 2501 阅读 · 0 评论 -
usaco 月赛 2007 Cow Traffic 题解
Cow TrafficTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3603 Accepted: 987DescriptionThe bovine population boom down on the farm has caused serious原创 2014-03-10 16:08:00 · 1347 阅读 · 0 评论 -
usaco 月赛 2003 Fall Popular Cows 受欢迎的奶牛 题解
【大意】给定N(N<=10000)个点和M(M<=50000)条边(注意:是有向边),求有多少个“受欢迎的点”。所谓的“受欢迎的点”当且仅当任何一个点出发都能到达它。【首先发现】99%的人都会想到直接用floyed来求。可惜的是,N太大了。我们再考虑新的算法。【分析】让人厌烦的是,这道题可能会有环,即A--B,B--C,C--A。先考虑无环的情况。定理1:若有向无环图是连通的,只有出度为0的点才是“受欢迎的点”。伪证明:设某点X是“受欢迎的点”,且该点仍有出度。不妨设它能到达Y点。因为是有向无环图,原创 2014-03-10 13:28:06 · 2608 阅读 · 0 评论 -
usaco training 4.3.2 The Primes 题解
序言:总算AC了。我花了一个半小时编完了程序,又花了两个小时调试程序,眼睛都花了。尽管在种种挫折前,我屡次萌生“放弃此题,随便贴个代码”的想法,但最终还是挺过去了。这种方阵题很是多见。原来我都是直接暴力地顺序枚举(准确地说是有顺序枚举)。但是在这个题目面前,效率显然是非常低的。经过很长时间的探索,我总结出了一张枚举顺序的图。原创 2014-02-27 15:32:34 · 2173 阅读 · 0 评论 -
usaco training 5.4.1 All Latin Squares 题解
【原题】All Latin SquaresA square arrangement of numbers1 2 3 4 52 1 4 5 33 4 5 1 24 5 2 3 15 3 1 2 4is a 5 x 5 Latin Square because each whole number from 1 to 5 ap原创 2014-03-14 08:35:50 · 2409 阅读 · 0 评论 -
usaco training 5.3.4 Big Barn 题解
【原题】Big BarnA Special TreatFarmer John wants to place a big square barn on his square farm. He hates to cut down trees on his farm and wants to find a location for his barn that enables hi原创 2014-03-14 08:25:21 · 1883 阅读 · 0 评论 -
usaco training 5.3.3 Network of Schools 题解
【原题】Network of SchoolsIOI '96 Day 1 Problem 3A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of scho原创 2014-03-13 21:55:58 · 1750 阅读 · 0 评论 -
usaco training 5.4.2 Canada Tour 题解
【原题】Canada TourYou have won a contest sponsored by an airline. The prize is a ticket to travel around Canada, beginning in the most western point served by this airline, then traveling only原创 2014-03-14 10:46:43 · 2288 阅读 · 0 评论 -
usaco 月赛 2008 January Best Cow Line 贝茜的晨练计划 题解
然据说标算是贪心,但我打算还是用DP来写。第一次志在必得,直接推方程:for (i=1;i<=n;i++){ f[i][0]=f[i-1][1]; for (j=1;j<=m;j++) f[i][j]=max(f[i-1][j+1],f[i-1][j-1]+a[i]);}其中f[i][j]表示到第i秒,疲劳度为j时最远的距离。然后一遍过样例,提交~~~~~~WA!仔细一看题目:每次休息时必须休息到0为止!这可怎么办呢?SYC大牛指点:只能顺推才能防止此错误!于是又吭哧吭哧写原创 2014-03-04 10:55:17 · 1762 阅读 · 0 评论 -
usaco training 5.5.1 Picture 题解
【原题】PictureIOI 1998A number, N (1 <= N < 5000), of rectangular posters, photographs and other pictures of the same shape are pasted on a wall. Their sides are all vertical or horizontal. Eac原创 2014-03-15 14:06:50 · 2084 阅读 · 0 评论 -
usaco training 5.5.2 Hidden Password 题解
【原题】Hidden PasswordACM South Eastern Europe -- 2003Sometimes the programmers have very strange ways of hiding their passwords. Billy "Hacker" Geits chooses a string S composed of L (5 <=原创 2014-03-15 15:39:00 · 2311 阅读 · 0 评论 -
usaco training 6.1.2 A Rectangular Barn 题解
【原题】A Rectangular BarnMircea Pasoi -- 2003Ever the capitalist, Farmer John wants to extend his milking business by purchasing more cows. He needs space to build a new barn for the cows.原创 2014-03-17 20:28:19 · 2074 阅读 · 0 评论 -
bzoj 1629 & Usaco 月赛 2007 DemoCow Acrobats 题解
【原题】【fe原创 2014-04-22 08:55:15 · 1350 阅读 · 0 评论 -
bzoj 1600 & Usaco 月赛 2008 建造栅栏 题解
【原题】1600: [Usaco2008 Oct]建造栅栏Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 785 Solved: 443[Submit][Status]Description勤奋的Farmer John想要建造一个四面的栅栏来关住牛们。他有一块长为n(4<=n<=2500)的木板,他想把这块本板切成4原创 2014-04-21 08:41:02 · 1392 阅读 · 0 评论 -
usaco 2003 月赛 Best Cow Fences & poj2018 题解
【原题】Best Cow FencesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9137 Accepted: 2919DescriptionFarmer John's farm consists of a long row of N原创 2014-03-24 16:15:16 · 2127 阅读 · 0 评论 -
poj 2227 & usaco 2005 月赛 The Wedding Juicer 题解
【原题】The Wedding JuicerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2953 Accepted: 1306DescriptionFarmer John's cowshave taken原创 2014-04-19 20:28:19 · 2132 阅读 · 0 评论 -
斜率优化专题1——bzoj 1597 [Usaco2008 Mar] 土地购买 题解
【原题】1597: [Usaco2008 Mar]土地购买Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 1396 Solved: 480[Submit][Status]Description农夫John准备扩大他的农场,他正在考虑N (1 <= N <= 50,000) 块长方形的土地. 每块土地的长宽满足(1原创 2014-04-24 07:39:41 · 2370 阅读 · 0 评论 -
矩阵乘法专题2——bzoj 1706 [usaco2007 Nov] relays 奶牛接力跑 题解
【原题】1706: [usaco2007 Nov]relays 奶牛接力跑Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 340 Solved: 162[Submit][Status]DescriptionFJ的N(2 <= N <= 1,000,000)头奶牛选择了接力跑作为她们的日常锻炼项目。至于进行接力跑的地点原创 2014-05-04 09:50:59 · 2526 阅读 · 0 评论 -
usaco 总结
辛苦了一段时间后,总算把USACO刷通了。现在来好好总结一下。【USACO的优点】①绝对经典的题库,任何OI都要刷。真可谓量少题精啊!②里面的题目思考量很大,想出之后使人觉得“柳暗花明又一村“啊!③有些题目的解法已成经典,如各种搜索的剪枝。【USACO的缺点】①有些题目出的太偏了,没有应用价值。②采用天梯的模式,过于死板,没刷完一节就不能往后刷。③有些数据非常可笑,原创 2014-03-18 11:11:59 · 2453 阅读 · 0 评论 -
usaco training 6.1.1 Postal Vans 题解
预备知识:哈密度路:由一个点出发到另外一个点结束,要求经过图中所有的点的一条路(不能重复经过点)。哈密顿回路:从一个点出发再回到此点,经过图中所有点的一条路(不能重复经过点)。 问题显然的解法:对于一个n*4的图求哈密顿回路的个数。用陈丹琦的方法。但是由于宽度只有4,所以有另外一种递推的方法,达到优化的目的:设f[i]为前i列中,第i列的第一个格子到第二个格子的哈密度路的条数。(显然,f[n]就为答案)1 2 3 。。i-1 i设g[i]为前i原创 2014-03-18 10:49:55 · 4161 阅读 · 0 评论 -
usaco training 6.1.3 Cow XOR 题解
这是字母树的经典应用。首先因为是求xor的最大值,可以用前缀和计算xor值,然后n^2枚举即可。for (i=1;i<=n;i++) for (j=1;j<i;j++) if ((sum[i]^sum[j-1])>ans) 就记录;然而由于范围的关系,我们只能优化这个算法。事实证明,每次枚举到一个i时,我们不必用O(N)的效率去寻找。我们可以构建一个字母树(准确的说是01树),它的分叉只是0或1(也像一棵二叉树)。每次算好一个前缀和时,我就把它拆成二进制并加入字母树。在查找的时候,我只需沿着原创 2014-03-18 09:19:55 · 2950 阅读 · 0 评论 -
usaco 月赛 2008 February Eating Together 题解
【序言】本来像这种水题是不发题解的。但是我的DP比较薄弱,而且也好长时间没有训练了,因此写一下来加深印象。【大意】给出N头奶牛的编号(1~3),每次修改一头奶牛编号代价是1,求最小的代价使得N头奶牛呈递增或递减。【分析1】这道题奶牛编号的范围放的比较小。有一种方法可以直接求代价,而且没有编号限制。设S为代价,则可得Smin=(N-K),其中N是元素个数,K是这段数中最长的不下降(或不上升)序列的元素个数。【分析1的证明】我们设在N个数中改变其中的S个数使其规范。假设把这S个数全部去掉,剩下的数必然呈不原创 2014-03-04 15:34:54 · 1132 阅读 · 0 评论 -
usaco 2008 January Telephone Lines 架设电话线 题解
题目大意:有N个点(N<=1000),P条边(P<=10000)(ps:真稀疏啊!)你可以把其中的K条边的权值改为0。(K<=N) 最后要求出从起点(1)到终点(N)经过的边中的最大值的最小值。(ps:好绕啊!)SYC大神邀请我做此题,并表示他用DP过了!(ORZ)我想了一会,觉得可以用二分答案+验证。原创 2014-02-28 16:06:00 · 1987 阅读 · 0 评论 -
usaco 2002 月赛 Fiber Communications 题解
DescriptionFarmer John wants to connect his N (1 <= N <= 1,000) barns (numbered 1..N) with a new fiber-optic network. However, the barns are located in a circle around the edge of a large pond, so原创 2014-02-22 13:30:48 · 1550 阅读 · 0 评论 -
usaco training 4.3.1 Buy Low, Buy Lower 题解
Buy Low, Buy Lower题解The advice to "buy low" is half the formula to success in the stock market. But to be considered a great investor you must also follow this problems' advice:"Buy low, buy l原创 2014-02-27 08:43:19 · 1814 阅读 · 0 评论 -
usaco training 4.2.4 Cowcycles 题解
搜索和剪枝。原创 2014-02-26 21:16:25 · 1967 阅读 · 0 评论 -
usaco training 3.4.3 fence9 题解
前言:咳咳,正当我向大视野、PKU等众多题库征战的时候,我猛然发现最最经典的USACO原题我竟然还没有刷完!!!于是最近我要把这个刷到5、6版,并且会陆续写一些题解。(水题就不解释了)原创 2014-02-25 14:11:53 · 1681 阅读 · 0 评论 -
usaco training 4.4.1 Shuttle Puzzle 题解
usaco training 4.4.1 Shuttle Puzzle 题解原创 2014-02-28 10:21:37 · 43942 阅读 · 1 评论 -
usaco training 4.2.2 The Perfect Stall 最佳牛栏 题解
二分图的最大匹配与网络流的关系。原创 2014-02-26 16:16:06 · 6597 阅读 · 0 评论 -
usaco training 4.1.2 Fence Rails 题解
强大的搜索剪枝!原创 2014-02-25 19:52:07 · 1943 阅读 · 0 评论 -
usaco training 4.1.1 麦香牛块 题解
通过深入研究,我总结了以下的思路。 ①我们先来证明为什么出解范围为什么可以<=256^2.有数论知识“有两个数p,q,且gcd(q,p)=1,则最大无法表示成px+qy(x>=0,y>=0)的数是pq-q-p”(证明可以参见http://blog.csdn.net/archibaldyangfan/article/details/7637831)因为题目中的数据都是小于等于256的,所以如果有最大无法表示的数,必然小于256^2(我们甚至可以抹去后面的减法)。 ②那么,就可以采用原创 2014-02-25 15:31:46 · 2857 阅读 · 0 评论 -
usaco training 4.1.3 fence6 题解
关于最小环实现方法的取舍。原创 2014-02-25 21:06:55 · 1411 阅读 · 0 评论 -
usaco training 4.3.3 Street Race 题解
Street Race题解IOI'95Figure 1 gives an example of a course for a street race. You see some points, labeled from 0 to N (here, N=9), and some arrows connecting them. Point 0 is the start of the rac原创 2014-02-27 18:44:02 · 1870 阅读 · 0 评论 -
usaco training 4.3.4 Letter Game 题解
usaco training 4.3.4 Letter Game 题解原创 2014-02-28 09:05:44 · 1520 阅读 · 0 评论 -
usaco 2004 Open Cube Stacking 堆方块 题解
大意:给定N个方块,排成一行,将它们编号1到N。再给出P个操作:①M i j表示将i所在的那一堆移到j所在那一堆的顶上。②C i表示一个询问,询问i下面有多少个方块。•你需要写一个程序来完成这些操作。毫无疑问,这么大的数据范围,暴力肯定不行。而效率几乎为O(N)的并查集跳入了我们的视线。原创 2014-02-28 14:30:27 · 3178 阅读 · 2 评论 -
usaco training 4.4.2 Pollutant Control 追查坏牛奶 题解
Pollutant Control题解Hal BurchIt's your first day in Quality Control at Merry Milk Makers, and already there's been a catastrophe: a shipment of bad milk has been sent out. Unfortunately, you didn原创 2014-03-03 11:03:56 · 2580 阅读 · 0 评论 -
usaco 2003 fall Cow Exhibition 奶牛展览会 题解
Cow Exhibition题解Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8380 Accepted: 3106Description"Fat and docile, big and dumb, they look so stupid, they原创 2014-03-07 20:12:18 · 2426 阅读 · 0 评论 -
usaco traini 5.2.2 Electric Fences 题解
【序言】这个题目真的是太神了!它适合任何非主流的算法(特别是随机化算法)。从此,我对模拟退火、爬山法等有了更深的了解。【优化】因为只要保留一位小数,我们可以把它扩大10倍当整数计算,输出时再缩小即可。【验证方法】假设我们已经知道了某个点X的坐标,现在要求电线的总长度。那么我们可以用O(N)的效率求出。每次枚举一条线段Y,如果X到Y可以有垂直线段,电线的长度就是这垂线段;否则枚举线段的两个端点,最短值肯定是其中之一。>>>>>>>>最关键的是,如何知道X的坐标呢?【算法一】枚举。当然不是纯枚举,否则效率原创 2014-03-13 14:42:46 · 2021 阅读 · 1 评论 -
usaco training 5.3.1 Milk Measuring 题解
【原题】 Milk MeasuringHal BurchFarmer John must measure Q (1 Farmer John has always been frugal. He is at the cow hardware store where he must purchase a set of pails with which to measure o原创 2014-03-13 16:48:01 · 2009 阅读 · 0 评论