搞一波ICPC!
文章平均质量分 76
ruclion
天上一日,地下十年
展开
-
15北京网络赛 E题
题目描述:题目5 : Border Length时间限制:1000ms单点时限:1000ms内存限制:256MB描述Garlic-Counting Chicken is a special species living around the Lake of Peking University.A Garlic-Counting Chicken always flies out from home i原创 2015-09-25 12:06:29 · 380 阅读 · 0 评论 -
Party
题目描述:G. PartyTime Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status n frogs are invited to a tea party. Frogs are conveniently numbered by 1,2原创 2015-10-09 16:08:26 · 378 阅读 · 0 评论 -
Epic Fail of a Genie
题目描述:E. Epic Fail of a GenieTime Limit: Unknown msMemory Limit: 65536KB 64-bit integer IO format: %I64d Java class name: (Any) Submit Status PID: 49355 Input/Output: standard input/outputAladdin原创 2015-10-09 15:19:20 · 379 阅读 · 0 评论 -
Billy, Willy and Moscow Underground
题目描述:B. Billy, Willy and Moscow UndergroundTime Limit: 1000msMemory Limit: 262144KB 64-bit integer IO format: %I64d Java class name: (Any) Submit Status PID: 49352 Input/Output: standard input/o原创 2015-10-09 15:02:15 · 441 阅读 · 0 评论 -
Problem I. Improvements
题目描述:Problem I. Improvements Input file: improvements.in Output file: improvements.out Son Halo owns n spaceships numbered from 1 to n and a space station. They are initially placed on one line wit原创 2015-10-27 19:07:47 · 345 阅读 · 0 评论 -
Problem E. Epic Win!
题目描述:Problem E. Epic Win! Input file: epic.in Output file: epic.out A game of rock-paper-scissors is played by two players who simultaneously show out their moves: Rock, Paper , or Scissors. If the原创 2015-10-27 19:00:50 · 468 阅读 · 0 评论 -
Problem A. Alter Board
题目描述:Problem A. Alter Board Input file: alter.in Output file: alter.out Little Dima gave his little brother Petya interactive chess board of size n × m as a present. There are many awesome features原创 2015-10-27 18:48:19 · 344 阅读 · 0 评论 -
HDU 5120 Intersection
题目描述:Matt is a big fan of logo design. Recently he falls in love with logo made up by rings. The following figures are some famous examples you may know. A ring is a 2-D figure bounded by two circles s原创 2015-09-16 18:49:30 · 279 阅读 · 0 评论 -
HDU5361 In Touch
题目描述:In Touch Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1634 Accepted Submission(s): 440Problem DescriptionThere are n soda living原创 2015-09-24 14:45:38 · 328 阅读 · 0 评论 -
15北京网络赛 B题
题目描述:题目2 : Mission Impossible 6时间限制:1000ms单点时限:1000ms内存限制:256MB描述You must have seen the very famous movie series,”Mission Impossible”, from 1 to 4. And “Mission Impossible 5” is now on screen in China.原创 2015-09-24 14:56:41 · 810 阅读 · 0 评论 -
H - Relief grain
题目描述:H - Relief grain Time Limit:5000MS Memory Limit:100000KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 5029 Appoint description: Description The soil is cracking up because o原创 2015-10-30 19:32:30 · 343 阅读 · 0 评论 -
C. Three States
题目描述:C. Three States time limit per test5 seconds memory limit per test512 megabytes inputstandard input outputstandard output The famous global economic crisis is approaching rapidly, so the stat原创 2015-10-27 19:14:33 · 479 阅读 · 0 评论 -
B - A Corrupt Mayor's Performance Art
题目描述:B - A Corrupt Mayor’s Performance Art Time Limit:1000MS Memory Limit:100000KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 5023 Appoint description: Description Corrupt gove原创 2015-10-30 19:27:14 · 308 阅读 · 0 评论 -
J - Lines
题目描述:J - Lines Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 5031 Appoint description: Description You play a game with your friend. He draw原创 2015-10-30 19:40:50 · 285 阅读 · 0 评论 -
F - Help!
题目描述:F - Help! Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 5027 Appoint description: Description “Help! Help!” While walking in the park,原创 2015-10-30 20:01:45 · 374 阅读 · 0 评论 -
15北京赛区总结
北京赛区拿了铜牌,这是最终的结果,对于我们队感觉挺耻辱的,虽然曾经侥幸想要蹭一个银牌,但是并没有什么卵用额。既然是铜牌狗,既然还有一年的机会,那就好好安排下。先总结下赛场上的感觉。从崩盘的最后来想吧。最后一个阶段是实现一个很简单的思路。当时写的时候还有40+分钟,对于我们队来说绝逼是轻轻松松拿下的。但是现在仔细回想一下,我在碰键盘之前其实已经理过了大致的结构,剩下的小细节的确可以边敲边理。原创 2015-11-20 22:10:14 · 428 阅读 · 0 评论 -
Repairing
题目描述:H. RepairingTime Limit: 5000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 39570 RepairingIn the International City of Pipe Construction, it原创 2015-10-09 15:49:11 · 656 阅读 · 0 评论 -
Vertex Cover
题目描述:D. Vertex CoverTime Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status frog has a graph with n vertices v(1),v(2),…,v(n) and m edges (v(a1原创 2015-10-09 16:00:21 · 308 阅读 · 0 评论 -
hdu5527 Too Rich
题目描述:Too RichTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 169 Accepted Submission(s): 50Problem Description You are a rich person, and原创 2015-11-03 15:01:09 · 1607 阅读 · 0 评论 -
hdu5534 Partial Tree
题目描述:Partial TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 222 Accepted Submission(s): 133Problem Description In mathematics, and m原创 2015-11-04 17:11:58 · 531 阅读 · 0 评论 -
hdu 5528 Count a * b
题目描述:Count a * bTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 203 Accepted Submission(s): 114Problem Description Marry likes to count t原创 2015-11-04 11:24:13 · 1261 阅读 · 0 评论 -
hdu5521 Meeting
题目描述:MeetingTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 397 Accepted Submission(s): 129Problem Description Bessie and her friend Els原创 2015-11-04 20:20:12 · 10897 阅读 · 0 评论 -
2014北京 HDU 5113 Black And White
题目描述:In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colo原创 2015-09-16 16:45:00 · 318 阅读 · 0 评论 -
HDU 5117 Fluorescent
题目描述:DescriptionMatt, a famous adventurer who once defeated a pack of dire wolves alone, found a lost court. Matt finds that there are N fluorescent lights which seem to be the stars from the firmament原创 2015-09-16 17:10:55 · 399 阅读 · 0 评论 -
A Big Dinner
题目描述:A. A Big DinnerTime Limit: 1000msMemory Limit: 65535KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 24249 As is known to all, an ACM team consists of three member原创 2015-10-08 11:07:31 · 515 阅读 · 0 评论 -
Hanoi Towers
题目描述:H. Hanoi TowersTime Limit: 5000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 3691 The “Hanoi Towers” puzzle consists of three pegs (that we原创 2015-10-08 17:55:14 · 354 阅读 · 0 评论 -
Easy Problem With Numbers
题目描述:F. Fold The PaperTime Limit: 2000msMemory Limit: 65535KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 24254 You have a rectangular piece of paper that is divided原创 2015-10-08 16:45:34 · 293 阅读 · 0 评论 -
Sichuan Province 2012 F Fold The Paper
题目描述:F. Fold The PaperTime Limit: 2000msMemory Limit: 65535KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 24254 You have a rectangular piece of paper that is divided原创 2015-10-08 15:08:48 · 358 阅读 · 0 评论 -
poj3565 Ants
题目描述:AntsTime Limit: 5000msMemory Limit: 65536KB This problem will be judged on PKU. Original ID: 3565 64-bit integer IO format: %lld Java class name: Main Prev Submit Status Statistics Di原创 2015-10-08 16:59:19 · 500 阅读 · 0 评论 -
Equation
题目描述:E. EquationTime Limit: 5000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 3688 Your task is to solve an equation of the form f(x) = 0 where原创 2015-10-08 17:04:28 · 379 阅读 · 0 评论 -
Area Folding
题目描述:B. Area FoldingTime Limit: 5000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 39564 Area FoldingYou are given one polygonal line, which is a原创 2015-10-09 15:41:51 · 254 阅读 · 0 评论 -
Connect
题目描述:C. ConnectTime Limit: 5000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 39565 ConnectYou are playing a solitaire puzzle called “Connect”, w原创 2015-10-09 15:47:58 · 288 阅读 · 0 评论 -
Carries
题目描述:题解:当时真是傻.. 首先肯定是按照位来计算,然后麻烦的是进位的计算. 但是但是!! 进位是一个很好搞的东西,排个序,那么比一个特定数大的值都可以进位!!!! 之后就很好写了呗. 可以每次排序,然后二分找,也可以用两个指针o(n)搞重点:想到了进位不会,那么继续探索怎么搞定进位?大于一个数就会进位,那么后面的一段都会进位代码://代码找不到了.....但是实现很简单原创 2015-10-09 15:55:19 · 578 阅读 · 0 评论 -
Just Another Disney Problem
题目描述:J. Just Another Disney ProblemTime Limit: 1000msMemory Limit: 262144KB 64-bit integer IO format: %I64d Java class name: (Any) Submit Status PID: 49360 Input/Output: standard input/outputEvi原创 2015-10-09 15:24:11 · 446 阅读 · 0 评论 -
ACM-ICPC 大四退役
没想到这么快就退役了,好多事请都没做,或者说。。自己就没有做啥自己计划的事情。大四了有更多的事情,都非常有趣,特别期待能开开眼界,接触下新领域的东西。特别是现在实验室有了很好的机会,那么就退役吧。觉着退役之后可能和acm相关的东西:看完手里的那本书?自己赛前计划看的三个pdf?跟面试相关的算法题?tc?反正到2017年之前先不弄了,强制让自己搞其他的吧。其实还是很好奇很开心的。Lovely...原创 2016-11-14 21:10:52 · 822 阅读 · 0 评论