ACM_二分
文章平均质量分 83
雨狮子
这个作者很懒,什么都没留下…
展开
-
CodeForces 492D Vanya and Computer Game
D. Vanya and Computer Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya and his friend Vova play a原创 2015-02-10 14:02:01 · 688 阅读 · 0 评论 -
POJ 3122
PieTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11269 Accepted: 3934 Special JudgeDescriptionMy birthday is coming up and traditionally I'm ser原创 2015-02-10 17:10:13 · 416 阅读 · 0 评论 -
POJ 1905 Expanding Rods
Expanding RodsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 12160 Accepted: 3160DescriptionWhen a thin rod of length L is heated n degrees, it expands原创 2015-02-10 20:42:55 · 486 阅读 · 0 评论 -
POJ 3258 River Hopscotch
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7836 Accepted: 3370DescriptionEvery year the cows hold an event featuring a peculiar vers原创 2015-02-10 21:03:50 · 353 阅读 · 0 评论 -
POJ 3273 Monthly Expense
Monthly ExpenseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15876 Accepted: 6346DescriptionFarmer John is an astounding accounting wizard and has rea原创 2015-02-10 20:06:32 · 348 阅读 · 0 评论 -
Codeforces Round #321 (Div. 2)B. Kefa and Company
B. Kefa and Companytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKefa wants to celebrate his first big salary by g原创 2015-10-11 13:13:38 · 868 阅读 · 0 评论 -
hihoCoder#1269 : 优化延迟
时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Ho编写了一个处理数据包的程序。程序的输入是一个包含N个数据包的序列。每个数据包根据其重要程度不同,具有不同的"延迟惩罚值"。序列中的第i个数据包的"延迟惩罚值"是Pi。如果N个数据包按照i1, Pi2, ... PiN>的顺序被处理,那么总延迟惩罚SP=1*Pi1+2*Pi2+3*Pi原创 2016-03-10 20:32:41 · 539 阅读 · 0 评论 -
P1918 保龄球 (简单二分)
DL 算缘分算得很烦闷,所以常常到体育馆去打保龄球解闷。因为他保龄球已经打了几十年了,所以技术上不成问题,于是他就想玩点新花招。DL 的视力真的很不错,竟然能够数清楚在他前方十米左右每个位置的瓶子的数量。他突然发现这是一个炫耀自己好视力的借口——他看清远方瓶子的个数后从某个位置发球,这样就能打倒一定数量的瓶子。1 OOO2 OOOO3 O4原创 2016-03-13 11:35:18 · 1275 阅读 · 0 评论