2017年03月_Yishui_Blog

原创 UESTCoj - 1329 卿学姐与魔法 (优先队列

卿学姐与魔法 Edit Time Limit: 1200/800MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status

2017-03-30 01:33:47 466

原创 HPUoj 1275 God's ladder ( 动态规划

题目描述天明来到神之宫殿，在他眼前出现了若干个石柱，每个石柱上有1枚金币，天明可以任意选择一个石柱开始，然后向前方的石柱瞬移，而且他所瞬移到的石柱的高度必须要大于现在所在石柱的高度。求天明所能获得的最大金币数以及任意一种可以获得这么多金币的路线（每个石柱的高度）。输入第一行一个数n，表示石柱的个数。然后2~n+1行，每行一个石柱的高度h[i]，分别是1,2，，n石柱的高度。2 最长上升

2017-03-29 02:04:10 288

原创 UESTC - 1512 可怜的非洲人（模拟

可怜的非洲银 Edit Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status

2017-03-27 07:35:16 605

原创 UESTC oj- 1515 保护果实（几何

保护果实 Edit Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status

2017-03-27 00:53:38 484

原创 Codeforces E. Two Labyrinths ( BFS

E. Two Labyrinthstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA labyrinth is the rectangular grid, each of the cells of which is either free or

2017-03-26 23:40:27 722

原创入门训练兰顿蚂蚁（模拟

#兰顿蚂蚁　　兰顿蚂蚁，是于1986年，由克里斯·兰顿提出来的，属于细胞自动机的一种。　　平面上的正方形格子被填上黑色或白色。在其中一格正方形内有一只“蚂蚁”。　　蚂蚁的头部朝向为：上下左右其中一方。　　蚂蚁的移动规则十分简单：　　若蚂蚁在黑格，右转90度，将该格改为白格，并向前移一格；　　若蚂蚁在白格，左转90度，将该格改为黑格，并向前移一格。　　规则虽然简单，蚂蚁的行为却十分复杂。刚刚开始

2017-03-25 17:08:21 449

原创 Codeforces #318 (Div. 2 A. Bear and Elections (模拟/优先队列

A. Bear and Electionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is a grizzly bear who desires power and adoration. He wants to win in up

2017-03-25 17:04:53 925

原创 Codeforces #406 (Div. 2) B. Bear and Friendship Condition（并查集

B. Bear and Friendship Conditiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBear Limak examines a social network. Its main functionality is that

2017-03-24 12:41:32 673

原创 Codeforces #406 (Div. 2 A. The Monster&B. Not Afraid （暴力

A. The Monstertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA monster is chasing after Rick and Morty on another planet. They’re so frightened tha

2017-03-24 09:50:59 1505

原创 Poj 2031 Building a Space Station ( 最小生成树Krustra

Building a Space StationTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 8435Accepted: 4029DescriptionYou are a member of the space station engineering team, and are assigned a task in the cons

2017-03-22 22:30:42 421

原创 NYoj 58 最小的步数（BFS

最少步数时间限制：3000 ms | 内存限制：65535 KB 难度：4 描述这有一个迷宫，有0~8行和0~8列：1,1,1,1,1,1,1,1,1 1,0,0,1,0,0,1,0,1 1,0,0,1,1,0,0,0,1 1,0,1,0,1,1,0,1,1 1,0,0,0,0,1,0,0,1 1,1,0,1,0,1,0,0,1 1,1,0,1,0,1,0,0,1

2017-03-22 16:27:46 277

原创 HPUoj 瞎子与瘸子的故事 ( BFS

问题 : 瞎子与瘸子的故事时间限制: 3 Sec 内存限制: 128 MB提交: 1 解决: 1 题目描述瞎子和瘸子两人共骑一辆摩托车，瞎子骑，瘸子看路，一路无事。转过一道弯，瘸子忽然发现路上有一道沟，连忙大声喊道：“沟！沟！沟！”瞎子一听来了劲，接着唱道：“啊涞，啊涞，啊涞……”结果瞎子和瘸子两人连人带车一起跌进沟内。上次的事故使瘸子不幸离开人世，瞎子却因祸得福，用瘸子的眼角膜进行了移植手术

2017-03-22 15:50:18 508

原创 HDUoj 1242 Rescue ( BFS+优先队列

RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29289 Accepted Submission(s): 10347Problem Description Angel was caught by the MOLIGPY!

2017-03-22 15:13:18 325

原创 Poj 1915 Knight Moves ( BFS

Knight MovesTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 25761Accepted: 12178DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knig

2017-03-22 08:32:32 402

原创 Codeforces #297 (Div. 2) C. Ilya and Sticks（贪心

C. Ilya and Stickstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the evening, after the contest Ilya was bored, and he really felt like maximiz

2017-03-21 23:39:10 325

原创 Codeforces #297 (Div. 2) B. Pasha and String （贪心

B. Pasha and Stringtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPasha got a very beautiful string s for his birthday, the string consists of low

2017-03-21 23:34:45 314

原创 Codeforces #297 (Div. 2) A. Vitaliy and Pie （水

A. Vitaliy and Pietime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter a hard day Vitaly got very hungry and he wants to eat his favorite potato p

2017-03-21 22:51:45 404

原创 Codeforces #404 (Div. 2) C. Anton and Fairy Tale (二分

C. Anton and Fairy Taletime limit per testmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton likes to listen to fairy tales, especially when Danik, Anton’s best friend, te

2017-03-18 14:09:48 706

原创 Codeforces #404 (Div. 2) B. Anton and Classes （贪心

B. Anton and Classestime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton likes to play chess. Also he likes to do programming. No wonder that he d

2017-03-17 17:45:43 771

原创 51Nod 1133 不重叠的线段 (区间贪心

1133 不重叠的线段基准时间限制：1 秒空间限制：131072 KB 分值: 10 难度：2级算法题收藏关注 X轴上有N条线段，每条线段有1个起点S和终点E。最多能够选出多少条互不重叠的线段。（注：起点或终点重叠，不算重叠）。例如：[1 5][2 3][3 6]，可以选[2 3][3 6]，这2条线段互不重叠。 Input 第1行：1个数N，线段的数量(2 <= N <= 100

2017-03-17 00:24:16 1109

原创 51Nod 1091 线段的重叠 (区间贪心

1091 线段的重叠基准时间限制：1 秒空间限制：131072 KB 分值: 5 难度：1级算法题收藏关注 X轴上有N条线段，每条线段包括1个起点和终点。线段的重叠是这样来算的，[10 20]和[12 25]的重叠部分为[12 20]。给出N条线段的起点和终点，从中选出2条线段，这两条线段的重叠部分是最长的。输出这个最长的距离。如果没有重叠，输出0。 Input 第1行：线段的数量

2017-03-16 23:43:41 384

原创 Codeforces #164 C. Beautiful Sets of Points ( 思维

C. Beautiful Sets of Pointstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputManao has invented a new mathematical term — a beautiful set of points.

2017-03-15 07:32:03 452

原创 Codeforces #164 B. Buttons （数学

B. Buttonstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputManao is trying to open a rather challenging lock. The lock has n buttons on it and to ope

2017-03-15 00:20:20 334

原创 Codeforces #164 A. Games （水

A. Gamestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputManao works on a sports TV. He’s spent much time watching the football games of some country

2017-03-14 23:49:33 571

原创 HDUoj 4278 Faulty Odometer （数学

Faulty OdometerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2017 Accepted Submission(s): 1398Problem Description 　　You are given a car odom

2017-03-13 23:58:47 258

Yishui_lovely