kuangbin - 博客园

HDU 4496 D-City （并查集，水题）

摘要： D-CityTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 18Accepted Submission(s): 15Problem DescriptionLuxer is a really bad guy. He destroys everything he met.One day Luxer went to D-city. D-city has N D-points and M D-lines. Each D-line connects ex 阅读全文

posted @ 2013-08-24 18:31 kuangbin 阅读(1188) 评论(0) 推荐(1) 编辑

HDU 4493 Tutor （水题）

摘要： TutorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 47Accepted Submission(s): 26Problem DescriptionLilin was a student of Tonghua Normal University. She is studying at University of Chicago now. Besides studying, she worked as a tutor teaching Chi 阅读全文

posted @ 2013-08-24 18:30 kuangbin 阅读(995) 评论(1) 推荐(0) 编辑

HDU 4498 Function Curve （分段，算曲线积分）

摘要： Function CurveTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 31Accepted Submission(s): 10Problem DescriptionGiven sequences of k1, k2, … kn, a1, a2, …, anand b1, b2, …, bn. Consider following function:Then we draw F(x) on a xy-plane, the value of 阅读全文

posted @ 2013-08-24 18:29 kuangbin 阅读(710) 评论(4) 推荐(1) 编辑

POJ 2417 Discrete Logging （Baby-Step Giant-Step）

摘要： Discrete LoggingTime Limit:5000MSMemory Limit:65536KTotal Submissions:2819Accepted:1386DescriptionGiven a prime P, 2 8 #include 9 #include 10 #include 11 #include 12 #include 13 #include 14 #include 15 #include 16 #include 17 #include 18 #include 19 using namespace std;20 //baby_step giant_step21 .. 阅读全文

posted @ 2013-08-24 00:35 kuangbin 阅读(1628) 评论(0) 推荐(0) 编辑

URAL 1099. Work Scheduling （一般图匹配带花树）

摘要： 1099. Work SchedulingTime limit: 0.5 secondMemory limit: 64 MBThere is certain amount of night guards that are available to protect the local junkyard from possible junk robberies. These guards need to scheduled in pairs, so that each pair guards at different night. The junkyard CEO ordered you to w 阅读全文

posted @ 2013-08-23 20:41 kuangbin 阅读(1511) 评论(0) 推荐(0) 编辑

HDU 4687 Boke and Tsukkomi （一般图匹配带花树）

摘要： Boke and TsukkomiTime Limit: 3000/3000 MS (Java/Others)Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 336Accepted Submission(s): 116Problem DescriptionA new season of Touhou M-1 Grand Prix is approaching. Girls in Gensokyo cannot wait for participating it. Before the registration, t 阅读全文

posted @ 2013-08-23 20:40 kuangbin 阅读(1653) 评论(0) 推荐(0) 编辑

HDU 4705 Y （2013多校10,1010题，简单树形DP）

摘要： YTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 60Accepted Submission(s): 20Problem DescriptionSample Input41 21 31 4Sample Output1Hint1. The only set is {2,3,4}.2. Please use #pragma comment(linker, "/STACK:16777216")Source2013 Multi- 阅读全文

posted @ 2013-08-22 18:24 kuangbin 阅读(841) 评论(0) 推荐(0) 编辑

HDU 4704 Sum （2013多校10,1009题）

摘要： SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 94Accepted Submission(s): 41Problem DescriptionSample Input2Sample Output2Hint1. For N = 2, S(1) = S(2) = 1.2. The input file consists of multiple test cases. Source2013 Multi-University Traini.. 阅读全文

posted @ 2013-08-22 18:22 kuangbin 阅读(446) 评论(0) 推荐(0) 编辑

HDU 4699 Editor （2013多校10,1004题）

摘要： EditorTime Limit: 3000/2000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 118Accepted Submission(s): 38Problem DescriptionSample Input8I 2I -1I 1Q 3LDRQ 2Sample Output23HintThe following diagram shows the status of sequence after each instruction:Source2013 Multi-Un 阅读全文

posted @ 2013-08-22 18:21 kuangbin 阅读(631) 评论(0) 推荐(0) 编辑

HDU 4696 Answers （2013多校10,1001题）

摘要： AnswersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 25Accepted Submission(s): 16Problem DescriptionSample Input2 42 22 10 1 2 3Sample OutputNOYESYESYESSource2013 Multi-University Training Contest 10Recommendzhuyuanchen520分容易发现规律。如果M 8 #include 阅读全文

posted @ 2013-08-22 18:19 kuangbin 阅读(393) 评论(0) 推荐(0) 编辑