2015年02月_TaoSama

原创 POJ 3262 Protecting the Flowers （贪心）

Protecting the FlowersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4723 Accepted: 1892DescriptionFarmer John went to cut some wood and left N (2 ≤

2015-02-23 23:12:52 565

原创 POJ 1862 Stripies （贪心、优先队列）

StripiesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 12784 Accepted: 6055DescriptionOur chemical biologists have invented a new very useful form of

2015-02-23 23:06:46 458

原创 POJ 3040 Allowance （贪心）

AllowanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1696 Accepted: 708DescriptionAs a reward for record milk production, Farmer John has decided

2015-02-23 23:02:57 487

原创 POJ 1017 Packets （贪心）

PacketsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 45720 Accepted: 15454DescriptionA factory produces products packed in square packets of the sam

2015-02-23 22:59:48 396

原创 POJ 2392 Yogurt Factory （贪心）

Yogurt factoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7091 Accepted: 3630DescriptionThe cows have purchased a yogurt factory that makes world-

2015-02-23 22:59:08 457

原创 POJ 3190 Stall Reservations （贪心、优先队列/set）

Stall ReservationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3384 Accepted: 1209 Special JudgeDescriptionOh those picky N (1 <= N <= 50,000)

2015-02-23 22:44:40 614

原创 POJ 1328 Radar Installation （贪心）

Radar InstallationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 56811 Accepted: 12809DescriptionAssume the coasting is an infinite straight line. La

2015-02-23 22:35:21 357

原创 POJ 2376 Cleaning Shifts （贪心）

Cleaning ShiftsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12079 Accepted: 3145DescriptionFarmer John is assigning some of his N (1 <= N <= 25,000

2015-02-23 22:27:31 424

原创 AOJ 0525 Osenbei （dfs）

题意：药药!切克闹! 煎饼果子来一套!有一个烤饼器可以烤r行c列的煎饼，煎饼可以正面朝上（用1表示）也可以背面朝上（用0表示）。一次可将同一行或同一列的煎饼全部翻转。现在需要把尽可能多的煎饼翻成正面朝上，问最多能使多少煎饼正面朝上？输入：多组输入，每组第一行为二整数r, c (1 ≤ r ≤ 10, 1 ≤ c ≤ 10 000)，剩下r行c列表示煎饼初始状态。r=c=0

2015-02-21 23:13:43 455

原创 POJ 3050 Hopscotch （dfs）

HopscotchTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2244 Accepted: 1608DescriptionThe cows play the child's game of hopscotch in a non-traditiona

2015-02-21 23:10:43 446

原创 POJ 3187 Backward Digit Sums （dfs全排列）

Backward Digit SumsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4705 Accepted: 2703DescriptionFJ and his cows enjoy playing a mental game. They wri

2015-02-21 23:05:52 414

原创 POJ 2718 Smallest Difference （dfs）

Smallest DifferenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5005 Accepted: 1372DescriptionGiven a number of distinct decimal digits, you can fo

2015-02-21 22:55:44 592 1

原创 AOJ 0121 Seven Puzzle （bfs）

题意：给你8个格子 0那个格子可以上下左右的动 - - 一开始以为所有格子都能动毕竟日文题目那么就很像8数码问题了由其他格子到“01234567” - - 如果挨个bfs的话 case多肯定TLE 那么思维反向一下由“01234567”到其他状态把每个最小步数存到map中对于每个case直接查找就好了AC代码如下：//// AOJ 0121 Seven Puz

2015-02-21 22:51:15 415

原创 POJ 3669 Meteor Shower （bfs）

Meteor ShowerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9896 Accepted: 2762DescriptionBessie hears that an extraordinary meteor shower is coming;

2015-02-21 22:37:04 383

原创 AOJ 0558 Cheese （bfs）

题意：在H * W的地图上有N个奶酪工厂，分别生产硬度为1-N的奶酪。有一只吃货老鼠准备从老鼠洞出发吃遍每一个工厂的奶酪。老鼠有一个体力值，初始时为1，每吃一个工厂的奶酪体力值增加1（每个工厂只能吃一次），且老鼠只能吃硬度不大于当前体力值的奶酪。老鼠从当前格走到相邻无障碍物的格（上下左右）需要时间1单位，有障碍物的格不能走。走到工厂上时即可吃到该工厂奶酪，吃奶酪时间不计。问吃遍所有奶

2015-02-21 22:30:41 562

原创 POJ 3009 Curling 2.0 （dfs剪枝）

Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12867 Accepted: 5412DescriptionOn Planet MM-21, after their Olympic games this year, curlin

2015-02-21 22:26:16 429

原创 AOJ 0033 Ball （dfs）

题意：有一个形似央视大楼（Orz）的筒，从A口可以放球，放进去的球可通过挡板DE使其掉进B裤管或C裤管里，现有带1-10标号的球按给定顺序从A口放入，问是否有一种控制挡板的策略可以使B裤管和C裤管中的球从下往上标号递增。输入：第一行输入数据组数N。接下来N行为N组具体数据，每组数据中有10个整数，代表球的放入顺序。输出：对于每组数据，若策略存在，输出YE

2015-02-21 22:20:04 558

原创 POJ 1979 Red and Black （dfs）

Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 24100 Accepted: 13020DescriptionThere is a rectangular room, covered with square tiles. E

2015-02-21 22:13:12 391

原创 POJ 3253 Fence Repair （优先队列）

Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 28684 Accepted: 9314DescriptionFarmer John wants to repair a small length of the fence aro

2015-02-21 22:00:54 368

原创 POJ 3069 Saruman's Army （贪心）

Saruman's ArmyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4644 Accepted: 2400DescriptionSaruman the White must lead his army along a straight pa

2015-02-21 21:57:40 429

原创 POJ 3617 Best Cow Line （贪心）

Best Cow LineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11618 Accepted: 3413DescriptionFJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annu

2015-02-21 21:54:19 408

原创 POJ 1852 Ants （贪心）

AntsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 10735 Accepted: 4762DescriptionAn army of ants walk on a horizontal pole of length l cm, each with

2015-02-21 21:42:12 366

原创 Codeforces #292 （div2）

A. Drazil and Datetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSomeday, Drazil wanted to go on date with

2015-02-18 18:16:09 545

原创 Codeforces #291 (div2)

A. Chewbaсca and Numbertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLuke Skywalker gave Chewbacca an int

2015-02-15 03:52:57 652

原创 HDU 2870 Largest Submatrix （最大子矩形面积）

Largest SubmatrixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1690 Accepted Submission(s): 805Problem DescriptionNow h

2015-02-12 02:01:31 615

原创 HDU 1069 Monkey and Banana （dp）

Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8274 Accepted Submission(s): 4272Problem DescriptionA gr

2015-02-12 00:55:39 575

原创 HDU 2571 命运（dp）

命运Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10875 Accepted Submission(s): 3837Problem Description穿过幽谷意味着离大魔王lemon已经

2015-02-11 23:56:06 541

原创 HDU 1087 Super Jumping! Jumping! Jumping! （最长上升子序列和）

Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24382 Accepted Submission(s): 10742Problem De

2015-02-09 01:27:59 393

原创 HDU 2602 Bone Collector （01背包）

Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 34170 Accepted Submission(s): 14054Problem DescriptionMany

2015-02-09 00:06:41 452

原创 HDU 2159 FATE （二维完全背包）

FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8674 Accepted Submission(s): 4067Problem Description最近xhd正在玩一款叫做FATE的

2015-02-08 23:52:44 463

原创 Codeforces Rockethon 2015

A. Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo players play a simple game. Each player is prov

2015-02-08 18:16:30 532

原创 HDU 2577 How to Type （dp）

2015-02-08 00:28:03 429

原创 HDU 2844 Coins （二进制优化多重背包）

2015-02-08 00:11:41 465

原创 HDU 1171 Big Event in HDU （多重背包）

题目链接：轻点我一下 >3简单多重背包需要注意的是背包大小是sum/2 输出的时候需要注意左边的大于等于右边的写了O(nvk)的 - - 题目数据不是很大就没写二进制优化 - - 其实是我忘记了QAQ半夜脑残 - - 50*50 = 250 果然我是250 数组少算一个0 RE了一发好吧 AC代码如下：//// HDU 1171 Big Event in

2015-02-08 00:03:16 376

原创 HDU 1176 免费馅饼（经典dp）

2015-02-07 23:29:10 396

原创 HDU 2084 数塔（经典dp）

题目链接：轻点我一下 >3从下往上的姿势特别好 - - 其实可以优化下空间直接把读入到dp数组中就可以了懒得改了写的有点久了然后状态方程变为dp[i][j] += max(dp[i + 1][j], dp[i + 1][j + 1])AC代码如下：//// HDU 2084 数塔//// Created by TaoSama on 2015-01-23// Co

2015-02-07 23:21:27 437

原创 HDU 2830 Matrix Swapping II （最大列可移动子矩形面积）

题目链接：轻点我一下 >3本题类似于 HDU 1505 1506 不过本题列可移动 - - 机智的就是可以通过辅助高度数组t 直接降序排序从而达到t[i]*i即是最优子矩形面积的方便然后扫一遍类似与1505 求出最大子矩形面积就好了AC代码如下：//// HDU 2830 Matrix Swapping II//// Created by TaoSama

2015-02-07 18:03:07 464

原创 HDU 1505 City Game （最大子矩形面积）

题目链接：轻点我一下 >3本题和 HDU1506 很像不过本题要对前i行求最大子矩形面积进而可得最大子矩形面积 - - 需要注意的是关于高度的读入要仔细想一想不要忘记每次清零h高度数组AC代码如下：//// HDU 1505 City Game//// Created by TaoSama on 2015-02-07// Copyright (c) 2

2015-02-07 17:40:00 462

原创 HDU 1506 Largest Rectangle in a Histogram （最大子矩形面积）

题目链接：轻点我一下~ >3求最大子矩形面积 = = 一开始很逗比的在求边界的时候写成了 - - l[i] = l[i]-1 r[i] = r[i] +1 n^2直接超时~ 正确的姿势应该是迭代类似于动归的思想AC代码如下：//// HDU 1506 Largest Rectangle in a Histogram//// Created by TaoSama o

2015-02-07 15:55:55 589

原创 HDU 2845 Beans 行列dp

HDU 2845 BeansTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3118 Accepted Submission(s): 1506Problem DescriptionBean-ea

2015-02-07 00:17:48 436

斯坦福大学2014机器学习个人笔记

空空如也