usaco
文章平均质量分 83
酒酿小河桃
这个作者很懒,什么都没留下…
展开
-
bzoj1671 [Usaco2005 Dec]Knights of Ni 骑士
DescriptionBessie is in Camelot and has encountered a sticky situation: she needs to pass through the forest that is guarded by the Knights of Ni. In order to pass through safely, the Knights ha原创 2017-09-13 15:47:32 · 206 阅读 · 0 评论 -
USACO Contest NOV05 卫星照片
又写了一遍经典的搜索题#includeusing namespace std;template void read(T &x){ x=0;int f=1;char ch=getchar(); for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1; for(;isdigit(ch);ch=getchar())x=(x原创 2017-09-12 21:28:39 · 1284 阅读 · 0 评论 -
luogu2639 [USACO09OCT]Bessie的体重问题Bessie's Weight
题目描述Bessie像她的诸多姊妹一样,因为从Farmer John的草地吃了太多美味的草而长出了太多的赘肉。所以FJ将她置于一个及其严格的节食计划之中。她每天不能吃多过H (5 <= H <= 45,000)公斤的干草。 Bessie只能吃一整捆干草;当她开始吃一捆干草的之后就再也停不下来了。她有一个完整的N (1 <= N <= 500)捆可以给她当作晚餐的干草的清单。她自然想要尽原创 2017-09-28 21:13:02 · 490 阅读 · 0 评论 -
luogu2958 [USACO09OCT]木瓜的丛林Papaya Jungle
题目描述Bessie has wandered off the farm into the adjoining farmer's land. He raises delicious papaya fruit, which is a delicacy for cows. The papaya jungle is partitioned into a grid of squares with原创 2017-09-29 06:41:14 · 566 阅读 · 0 评论 -
luogu2035 iCow
题目描述被无止境的农活压榨得筋疲力尽后,Farmer John打算用他在MP3播放器市场新买的iCow来听些音乐,放松一下。FJ的iCow里存了N(1 第i首曲子有一个初始权值R_i(1 当一首曲子播放完毕,接下来播放的将是所有曲子中权值最大的那首(如果有两首或多首曲子的权值相同,那么这些曲子中编号最小的那首会被选中)。一首曲子在播放结束后,它的权值会被平均地分给其原创 2017-10-02 18:12:30 · 565 阅读 · 0 评论 -
luogu3009 [USACO11JAN]利润Profits
题目描述The cows have opened a new business, and Farmer John wants to see how well they are doing. The business has been running for N (1 Farmer John wants to find the largest total profit that原创 2017-10-02 18:17:12 · 580 阅读 · 0 评论 -
luogu1208 [USACO1.3]混合牛奶 Mixing Milk
题目描述由于乳制品产业利润很低,所以降低原材料(牛奶)价格就变得十分重要。帮助Marry乳业找到最优的牛奶采购方案。Marry乳业从一些奶农手中采购牛奶,并且每一位奶农为乳制品加工企业提供的价格是不同的。此外,就像每头奶牛每天只能挤出固定数量的奶,每位奶农每天能提供的牛奶数量是一定的。每天Marry乳业可以从奶农手中采购到小于或者等于奶农最大产量的整数数量的牛奶。给出M原创 2017-10-02 18:43:46 · 295 阅读 · 0 评论 -
luogu2978 [USACO10JAN]下午茶时间Tea Time
题目描述N (1 <= N <= 1000) cows, conveniently numbered 1..N all attend a tea time every day. M (1 <= M <= 2,000) unique pairs of those cows have already met before the first tea time. Pair i of these co原创 2017-10-02 22:03:52 · 497 阅读 · 0 评论 -
luogu2952 [USACO09OPEN]牛线Cow Line
题目描述Farmer John's N cows (conveniently numbered 1..N) are forming a line. The line begins with no cows and then, as time progresses, one by one, the cows join the line on the left or right side.原创 2017-10-03 07:17:06 · 535 阅读 · 0 评论 -
luogu2871 [USACO07DEC]手链Charm Bracelet
题目描述Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm原创 2017-09-28 20:58:07 · 216 阅读 · 0 评论 -
luogu1202 [USACO1.1]黑色星期五Friday the Thirteenth
题目描述13号又是一个星期五。13号在星期五比在其他日子少吗?为了回答这个问题,写一个程序,要求计算每个月的十三号落在周一到周日的次数。给出N年的一个周期,要求计算1900年1月1日至1900+N-1年12月31日中十三号落在周一到周日的次数,N为正整数且不大于400.这里有一些你要知道的:1、1900年1月1日是星期一.2、4,6,11和9月有30天.其他月份原创 2017-09-28 20:31:16 · 340 阅读 · 0 评论 -
luogu2911 [USACO08OCT]牛骨头Bovine Bones
题目描述Bessie loves board games and role-playing games so she persuaded Farmer John to drive her to the hobby shop where she purchased three dice for rolling. These fair dice have S1, S2, and S3 side原创 2017-09-28 06:56:28 · 746 阅读 · 0 评论 -
luogu2955 [USACO09OCT]奇数偶数Even? Odd?
题目描述Bessie's cruel second grade teacher has assigned a list of N (1 <= N <= 100) positive integers I (1 <= I <= 10^60) for which Bessie must determine their parity (explained in second grade as 'E原创 2017-09-28 07:04:23 · 664 阅读 · 0 评论 -
luogu1554 梦中的统计
题目背景Bessie 处于半梦半醒的状态。过了一会儿,她意识到她在数数,不能入睡。题目描述Bessie的大脑反应灵敏,仿佛真实地看到了她数过的一个又一个数。她开始注意每一个数码(0..9):每一个数码在计数的过程中出现过多少次?给出两个整数M 和N (1 ≤M ≤N ≤2,000,000,000 以及N-M ≤500,000),求每一个数码出现了多少次。原创 2017-09-28 07:17:05 · 674 阅读 · 0 评论 -
luogu2676 超级书架
题目描述Farmer John最近为奶牛们的图书馆添置了一个巨大的书架,尽管它是如此的大,但它还是几乎瞬间就被各种各样的书塞满了。现在,只有书架的顶上还留有一点空间。 所有N(1 <= N <= 20,000)头奶牛都有一个确定的身高H_i(1 <= H_i <= 10,000)。设所有奶牛身高的和为S。书架的高度为B,并且保证 1 <= B <= S < 2,000,000,007。原创 2017-09-28 07:30:15 · 402 阅读 · 0 评论 -
luogu2956 [USACO09OCT]机器人犁田The Robot Plow
题目描述Farmer John has purchased a new robotic plow in order to relieve him from the drudgery of plowing field after field after field. It achieves this goal but at a slight disadvantage: the robotic原创 2017-09-28 18:30:16 · 953 阅读 · 1 评论 -
luogu2666 Bessie的秘密牧场
题目背景背景就是描述,描述就是背景。题目描述Farmmer John最近收割了几乎无限多块牧草,将它们堆放在空地上。这些牧草都是正方形的,而且都有非负整数长度的边长(当然有0)。一天它的奶牛Bessie发现了这些美味的牧草,于是希望把它们种在自己的秘密牧场上。他总将草皮分割成1*1的小块,以放入他牧场上的N个格子中。Bessie感兴趣的是,她若选取四块会有多少种不同方法。如果N=4原创 2017-09-28 18:58:20 · 578 阅读 · 0 评论 -
luogu2907 [USACO08OPEN]农场周围的道路Roads Around The Farm
题目描述Farmer John's cows have taken an interest in exploring the territory around the farm. Initially, all N (1 <= N <= 1,000,000,000) cows commence traveling down a road in one big group. Upon en原创 2017-09-28 19:59:10 · 770 阅读 · 0 评论 -
luogu2637 第一次,第二次,成交!
题目描述因为奶牛们的节食运动(奶牛还节食?)给农夫JOHN余下了一大批干草无法处理,所以他准备要开一个拍卖会去出售他的干草。他有N(1<=N<=1000)批干草(每批大约100捆)。他的客户有M个(1<=M<=1000),都是和他相邻的农夫。 第I名农夫会告诉农夫JOHN他会为农夫JOHN的每批干草付P_i的钱(1<=P_i<=1,000,000)。每个农夫都想买(也只想买)农夫JOH原创 2017-09-28 20:13:34 · 1274 阅读 · 0 评论 -
luogu2945 [USACO09MAR]沙堡Sand Castle
题目描述Farmer John has built a sand castle! Like all good castles, the walls have crennelations, that nifty pattern of embrasures (gaps) and merlons (filled spaces); see the diagram below. The N (1 <=原创 2017-10-03 20:45:37 · 597 阅读 · 0 评论