ACM
文章平均质量分 81
RJ28
小学生
展开
-
Technocup 2021 - Elimination Round 2 D. XOR-gun
Arkady owns a non-decreasing array ????1,????2,…,????????. You are jealous of its beauty and want to destroy this property. You have a so-called XOR-gun that you can use one or more times.In one step you can select two consecutive elements of the array, l原创 2020-12-09 13:53:16 · 253 阅读 · 0 评论 -
Codeforces Round #614 (Div. 1) D. Chaotic V.
"Everything has been planned out. No more hidden concerns. The condition of Cytus is also perfect.The time right now… 00:01:12…It’s time."The emotion samples are now sufficient. After almost 3 year...原创 2020-01-28 19:34:45 · 323 阅读 · 0 评论 -
POJ-2586
Y2K Accounting BugTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 12273 Accepted: 6217Description Accounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lo原创 2016-02-13 17:19:44 · 273 阅读 · 0 评论 -
POJ-1860
Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 24359 Accepted: 8866Description Several currency exchange points are working in our city. Let us suppose that原创 2016-02-16 11:14:51 · 336 阅读 · 0 评论 -
POJ-3259
Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 39402 Accepted: 14473DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormhol原创 2016-02-16 15:15:42 · 435 阅读 · 0 评论 -
BZOJ-3671 [Noi2014]随机数生成器
Input第1行包含5个整数,依次为 x_0,a,b,c,d ,描述小H采用的随机数生成算法所需的随机种子。第2行包含三个整数 N,M,Q ,表示小H希望生成一个1到 N×M 的排列来填入她 N 行 M 列的棋盘,并且小H在初始的 N×M 次交换操作后,又进行了 Q 次额外的交换操作。接下来 Q 行,第 i 行包含两个整数 u_i,v_i,表示第 i 次额外交换操作将交换 T_(u_i )原创 2016-02-16 18:24:32 · 565 阅读 · 0 评论 -
bzoj-2434: [Noi2011]阿狸的打字机
2434: [Noi2011]阿狸的打字机Time Limit: 10 Sec Memory Limit: 256 MBSubmit: 1016 Solved: 572[Submit][Status]Description 阿狸喜欢收藏各种稀奇古怪的东西,最近他淘到一台老式的打字机。打字机上只有28个按键,分别印有26个小写英文字母和'B'、'P'两个字母。经阿原创 2016-02-16 20:37:49 · 326 阅读 · 0 评论 -
bzoj-1098: [POI2007]办公楼biu
1098: [POI2007]办公楼biuTime Limit: 20 Sec Memory Limit: 162 MBSubmit: 737 Solved: 306[Submit][Status]DescriptionFGD开办了一家电话公司。他雇用了N个职员,给了每个职员一部手机。每个职员的手机里都存储有一些同事的电话号码。由于FGD的公司规模不断扩大,旧的办公楼已原创 2016-02-16 20:40:57 · 846 阅读 · 0 评论 -
bzoj-2126: 排斥反应
2126: 排斥反应Time Limit: 40 Sec Memory Limit: 259 MBSubmit: 190 Solved: 90[Submit][Status]Description在一个圆上均匀分布p*q个点{A1,A2,A3…Ap*q},Ai与Aj的距离为min{abs(i-j),p*q-abs(i-j)},在上面选任意个点(可以选0个),如果选择的点原创 2016-02-16 20:43:24 · 662 阅读 · 0 评论 -
2014HA省队DAY8-1454. 送快递
1454. 送快递★ 输入文件:expressc.in 输出文件:expressc.out 简单对比时间限制:1 s 内存限制:256 MB 【题目描述】 小x因为要计划买iphone9,需要打工来赚钱,其中有一项就是周末回学校的路上顺便送一些快递。 小x是骑单车上学的,所以每次只能送一个快递,但是在送快递中间可以将快件寄存一下,送下一个快件。(这个会在样例中解原创 2016-02-16 20:45:03 · 445 阅读 · 0 评论 -
UVA 10795
#include #include #include #include using namespace std;int num,n,i,now[61],f[61];long long Find(int MAX,int target){ if(MAX == 1) return 0; int i=MAX-1; for(;(i > 0) && (now[i] ==原创 2016-03-03 17:43:49 · 537 阅读 · 0 评论 -
BZOJ刷题记录(2014)
BZOJ刷题记录1000: A+B Problem 太神不会。。1001: [BeiJing2006]狼抓兔子平面图转对偶图,然后SPFA求最小割 1002: [FJOI2007]轮状病毒 分三类讨论,可DP,需要高精度。 设f[n]表示第n个原子和中心相连的病毒数,g[n]表示第n个原子不和中心相连的病毒数,那么最后的结原创 2016-02-16 20:30:58 · 1203 阅读 · 0 评论 -
bzoj-2878(外向树DP)
bzoj-2878(外向树DP) 2878: [Noi2012]迷失游乐园Time Limit: 10 Sec Memory Limit: 512 MBSec Special JudgeSubmit: 338 Solved: 238[Submit][Status]Description放假了,小Z觉得呆在家里特别无聊,于是决定一个人去游乐园玩。进入游乐原创 2016-02-16 20:31:57 · 624 阅读 · 0 评论 -
bzoj-1076[SCOI2008]奖励关
1076: [SCOI2008]奖励关Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 689 Solved: 407[Submit][Status]Description你正在玩你最喜欢的电子游戏,并且刚刚进入一个奖励关。在这个奖励关里,系统将依次随机抛出k次宝物,每次你都可以选择吃或者不吃(必须在抛出下一个宝物之前做出选择原创 2016-02-16 20:36:17 · 675 阅读 · 0 评论 -
bzoj-1103 [POI2007]大都市meg
1103: [POI2007]大都市megTime Limit: 10 Sec Memory Limit: 162 MBSubmit: 1056 Solved: 521[Submit][Status]Description在经济全球化浪潮的影响下,习惯于漫步在清晨的乡间小路的邮递员Blue Mary也开始骑着摩托车传递邮件了。不过,她经常回忆起以前在乡间漫步的情景。昔日原创 2016-02-16 20:34:20 · 541 阅读 · 0 评论 -
Gym 100917 J. Judgement
time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe jury of Berland regional olympiad in informatics does not trust to con原创 2016-03-29 13:20:24 · 719 阅读 · 0 评论 -
VK Cup 2016 - Round 1 B. Bear and Forgotten Tree 3
time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tree is a connected undirected graph consisting of n vertices andn -原创 2016-03-29 13:32:15 · 711 阅读 · 0 评论 -
Gym 100917 F - Find the Length
time limit per test4 seconds (5 seconds for Java)memory limit per test256 megabytesinputstandard inputoutputstandard outputFor each vertice of given undirected weighted graph c原创 2016-03-29 13:48:18 · 655 阅读 · 0 评论 -
POJ-1789
Truck History Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 23300 Accepted: 9019Description Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are use原创 2016-02-19 00:37:09 · 275 阅读 · 0 评论 -
POJ-3276 Face The Right Way
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3740 Accepted: 1724DescriptionFarmer John has arranged his N (1 ≤ N ≤ 5,000) cows in a row and many of them are fa原创 2016-03-31 17:39:36 · 727 阅读 · 0 评论 -
POJ-3274 Gold Balanced Lineup
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13958 Accepted: 4038DescriptionFarmer John's N cows (1 ≤ N ≤ 100,000) share many similarities. In fact, FJ has been原创 2016-03-31 22:47:23 · 306 阅读 · 0 评论 -
POJ-3020
Antenna Placement Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7995 Accepted: 3959Description The Global Aerial Research Centre has been allotted the task of building the fift原创 2016-02-24 22:06:26 · 398 阅读 · 0 评论 -
Codeforces Round #345 (Div. 1) D. Zip-line
Vasya has decided to build a zip-line on trees of a nearby forest. He wants the line to be as long as possible but he doesn't remember exactly the heights of all trees in the forest. He is sure that h原创 2016-03-10 15:32:36 · 800 阅读 · 0 评论 -
Codeforces Round #345 (Div. 1) C. Table Compression
Little Petya is now fond of data compression algorithms. He has already studiedgz, bz,zip algorithms and many others. Inspired by the new knowledge, Petya is now developing the new compression alg原创 2016-03-10 08:09:08 · 676 阅读 · 0 评论 -
LA-4043
4043 - AntsTime limit: 3.000 secondsYoung naturalist Bill studies ants in school. His ants feed on plant-louses that live on apple trees. Each ant colony needs its own apple tree to feed itself.Bill ha原创 2016-02-24 22:00:34 · 635 阅读 · 0 评论 -
UVA-11383 (KM算法)
直接套KM模板。原创 2016-02-25 23:45:43 · 378 阅读 · 0 评论 -
Codeforces Round #337 (Div. 2) D. Vika and Segments
time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVika has an infinite sheet of squared paper. Initially all squares are w原创 2016-03-22 17:12:08 · 412 阅读 · 0 评论 -
LA-3942 (字典树模板)
分析:字典树+DP,当做字典树模板来做了。#include #include #include #include #include using namespace std;string m,s[4001];const int maxnode=400000,tot_size=26;int num,n,f[300001];struct Trie{ int ch[maxn原创 2016-02-27 15:20:22 · 557 阅读 · 0 评论 -
POJ-2151 Check the difficulty of problems
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6332 Accepted: 2756DescriptionOrganizing a programming contest is not an easy job. To avoid making the problems too di原创 2016-04-03 20:45:06 · 283 阅读 · 0 评论 -
POJ-1840 Eqs
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 14929 Accepted: 7329DescriptionConsider equations having the following form:a1x13+ a2x23+ a3x33+ a4x43+ a5x53=0The原创 2016-04-05 20:36:36 · 315 阅读 · 0 评论 -
POJ-2002 Squares
Time Limit: 3500MS Memory Limit: 65536KTotal Submissions: 18416 Accepted: 7081DescriptionA square is a 4-sided polygon whose sides have equal length and adjacent sides form 9原创 2016-04-05 21:30:20 · 287 阅读 · 0 评论 -
hud4328 - Cut the cake(垂线法)
Cut the cakeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1175 Accepted Submission(s): 441Problem DescriptionMark bought a huge原创 2016-03-24 17:20:27 · 574 阅读 · 0 评论 -
POJ-2503 Babelfish
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 38865 Accepted: 16594DescriptionYou have just moved from Waterloo to a big city. The people here speak an incompre原创 2016-04-06 21:27:17 · 292 阅读 · 0 评论 -
POJ-3253 Fence Repair
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 37213 Accepted: 12053DescriptionFarmer John wants to repair a small length of the fence around the pasture. He mea原创 2016-04-06 22:13:20 · 245 阅读 · 0 评论 -
Codeforces Round #344 (Div. 2) C. Report
time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEach month Blake gets the report containing main economic indicators of原创 2016-03-25 15:03:01 · 301 阅读 · 0 评论 -
POJ-2513 Colored Sticks
Time Limit: 5000MS Memory Limit: 128000KTotal Submissions: 34372 Accepted: 8976DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with so原创 2016-04-07 21:06:45 · 472 阅读 · 0 评论 -
STL 优先队列实现的DIJSKTRA算法
P转C几个月了,还在坚持用C写P的代码。。。是时候学习一下C++的STL库了。#include #include #include #include #include using namespace std;const int MAXN=23333,INF=1147483647;int n,a[MAXN],d[MAXN];bool done[MAXN];struct th原创 2016-02-18 11:56:37 · 483 阅读 · 0 评论 -
POJ-1724 ROADS
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12451 Accepted: 4597DescriptionN cities named with numbers 1 ... N are connected with one-way roads. Each road has原创 2016-04-11 22:36:05 · 211 阅读 · 0 评论 -
Educational Codeforces Round 3 C. Load Balancing
time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the school computer room there are n servers which are responsible for原创 2016-03-26 09:37:06 · 446 阅读 · 0 评论 -
POJ-3411 Paid Roads
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6472 Accepted: 2398DescriptionA network of m roads connects N cities (numbered from 1 toN). There may be more than原创 2016-04-07 22:32:18 · 396 阅读 · 0 评论