2015年03月_左眼皮跳跳~

原创 HDU 4614 Vases and Flowers(线段树+二分)

Problem Description　　Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers, she will try to put them in the vases, one

2015-03-30 22:09:11 492

原创 HDU 1255 覆盖的面积（线段树扫描线求面积的交）

Problem Description给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. Input输入数据的第一行是一个正整数T(1注意:本题的输入数据较多,推荐使用scanf读入数据. Output对于每组测试数据,请计算出被这些矩形覆盖过至少两次的区域的面积.结果保留两位小数. Sample Inpu

2015-03-30 11:40:13 500

原创 HDU 5194 DZY Loves Balls（排列组合瞎搞）

Problem DescriptionThere are n black balls and m white balls in the big box.Now, DZY starts to randomly pick out the balls one by one. It forms a sequence S. If at the i-th operation,

2015-03-28 22:36:58 1263

原创 Codeforces Round #297 (Div. 2) D Arthur and Walls（bfs）

D. Arthur and Wallstime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputFinally it is a day when Arthur has eno

2015-03-28 10:09:40 686

原创 Codeforces Round #297 (Div. 2) E Anya and Cubes

E. Anya and Cubestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnya loves to fold and stick. Today she d

2015-03-28 10:05:07 821

原创 HDU 4734 F(x) （数位dp+ 记忆化）

Problem DescriptionFor a decimal number x with n digits (AnAn-1An-2 ... A2A1), we define its weight as F(x) = An * 2n-1 + An-1 * 2n-2 + ... + A2 * 2 + A1 * 1. Now you are given two numbers A and B

2015-03-26 12:15:15 609

原创 HDU 3974 Assign the task（线段树单点更新+lazy）

Problem DescriptionThere is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader of whole company).If you are the immediate

2015-03-25 23:02:59 714

原创 ural 1057 Amount of degrees （数位dp）

1057. Amount of DegreesTime limit: 1.0 secondMemory limit: 64 MBCreate a code to determine the amount of integers, lying in the set [X;Y] and being a sum of exactlyK different integer de

2015-03-25 22:02:18 571

原创 HDU 3182 Hamburger Magi（状压dp）

Problem DescriptionIn the mysterious forest, there is a group of Magi. Most of them like to eat human beings, so they are called “The Ogre Magi”, but there is an special one whose favorite food is h

2015-03-25 12:01:16 592

原创 CF 205 C Little Elephant and Interval（模拟）

The Little Elephant very much loves sums on intervals.This time he has a pair of integers l and r (l ≤ r). The Little Elephant has to find the number of such integers x (l ≤ x ≤ r), that the f

2015-03-23 23:08:46 569

原创 HDU 4027 Can you answer these queries（线段树成段更新）

Problem DescriptionA lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battleships can be

2015-03-21 17:18:49 519

原创 POJ 3264 Balanced Lineup（最大最小差值线段树水题）

Language:DefaultBalanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 37122 Accepted: 17383Case Time Limit: 2000MSDescriptionFor th

2015-03-21 16:32:25 904

原创 ZOJ 1610 Count the Colors（线段树区间更新）

Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting the segments of different colors you can see at last.

2015-03-21 16:12:48 762

原创 HDU 4685 Prince and Princess（二分图 + 强连通）

Problem DescriptionThere are n princes and m princesses. Princess can marry any prince. But prince can only marry the princess they DO love.For all princes,give all the princesses that they love.

2015-03-20 22:38:23 681

原创 POJ 1904 King's Quest（强连通）

Language:DefaultKing's QuestTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 7635 Accepted: 2769Case Time Limit: 2000MSDescriptionOnce upon

2015-03-20 11:02:11 723

原创 HDU 4751 Divide Groups（二分图的判断）

Problem Description This year is the 60th anniversary of NJUST, and to make the celebration more colorful, Tom200 is going to invite distinguished alumnus back to visit and take photos. Af

2015-03-19 22:54:17 644

原创 HDU 1054 Strategic Game（二分图匈牙利算法）

Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a medieva

2015-03-19 21:06:15 530

原创 HDU 4405 Aeroplane chess （概率dp）

Problem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice have six faces with equal pr

2015-03-18 19:36:14 530

原创 ZOJ 3329 One Person Game （概率dp 难）

There is a very simple and interesting one-person game. You have 3 dice, namelyDie1, Die2 and Die3. Die1 hasK1 faces. Die2 has K2 faces.Die3 has K3 faces. All the dice are fair dice, so the prob

2015-03-18 16:39:40 544

原创 CF # 296 C Glass Carving （并查集或者 multiset）

C. Glass Carvingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLeonid wants to become a glass carver (the

2015-03-18 15:06:05 1203

原创 POJ 3744 Scout YYF I （概率dp+矩阵优化）

Language:DefaultScout YYF ITime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5504 Accepted: 1522DescriptionYYF is a couragous scout. Now he is on a

2015-03-17 23:07:42 460

原创 POJ 2096 Collecting Bugs（概率dp）

Language:DefaultCollecting BugsTime Limit: 10000MS Memory Limit: 64000KTotal Submissions: 2965 Accepted: 1462Case Time Limit: 2000MS Special JudgeDesc

2015-03-17 21:48:46 484

原创 POJ 2151 Check the difficulty of problems（概率dp）

Language:DefaultCheck the difficulty of problemsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5419 Accepted: 2384DescriptionOrganizing a program

2015-03-17 16:59:21 525

原创 HDU 5188 zhx and contest（带限制条件的 01背包）

Problem DescriptionAs one of the most powerful brushes in the world, zhx usually takes part in all kinds of contests.One day, zhx takes part in an contest. He found the contest very easy for him.

2015-03-17 15:47:29 1098

原创九度 OJ 1554：区间问题 (set +前缀 +map)

时间限制：1 秒内存限制：128 兆特殊判题：否提交：3468解决：291题目描述：给定一个数组，判断数组内是否存在一个连续区间，使其和恰好等于给定整数k。输入：输入包含多组测试用例，每组测试用例由一个整数n(1接下去一行为n个整数，描述这个数组，整数绝对值不大于100。最后一行为一个整数k(大小在int范

2015-03-17 15:12:49 732

原创 HDU 3853 LOOPS（概率dp）

Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the plot of the Boss Incubator, she is trapped

2015-03-16 21:10:06 458

原创 2015广东工业大学ACM校赛 I 游戏王（状压dp）

Problem I: 游戏王Description小学的时候，Stubird非常喜欢玩游戏王，有一天，他发现了一个绝佳的连锁组合，这个连锁组合需要6张卡，可是他一张都没有，但是他的那些朋友们有，不过当然，他们不会白给，不过也不排除有人和他交情好，送给他了。不过他们有成全别人的美德，当他们看到Stubird已经有某些他们喜欢的卡的时候，他们会给他优惠，或者更贵也说不定嘛

2015-03-16 12:52:05 1248

原创 HDU3681 Prison Break（状压dp）

Problem DescriptionRompire is a robot kingdom and a lot of robots live there peacefully. But one day, the king of Rompire was captured by human beings. His thinking circuit was changed by human and

2015-03-16 12:30:57 604

原创 HDU 5186 zhx's submissions (进制转换)

Problem DescriptionAs one of the most powerful brushes, zhx submits a lot of code on many oj and most of them got AC.One day, zhx wants to count how many submissions he made on n ojs. He knows

2015-03-14 23:35:00 1043

原创 HDU 5187 zhx's contest（防爆__int64 ）

Problem DescriptionAs one of the most powerful brushes, zhx is required to give his juniorsn problems.zhx thinks the ith problem's difficulty is i. He wants to arrange these problems in a

2015-03-14 23:14:38 1380

原创 ZOJ 3471 Most Powerful（状压dp）

Recently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties. When two of these atoms collide, one of them disappears and a lot of power

2015-03-14 10:15:18 653

原创 POJ 2288 Islands and Bridges（状压dp）

Language:DefaultIslands and BridgesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 9312 Accepted: 2424DescriptionGiven a map of islands and bridge

2015-03-14 09:22:59 655

原创 zoj 2921 Stock（贪心）

Optiver sponsored problem. After years of hard work Optiver has developed a mathematical model that allows them to predict wether or not a company will be succesful. This obviously gives them a grea

2015-03-13 11:13:04 700

原创 HDU 3001 Travelling（状压dp）

Problem DescriptionAfter coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he does not

2015-03-12 18:31:17 686

原创 POJ 3311 Hie with the Pie（状压dp or dfs）

Language:DefaultHie with the PieTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5057 Accepted: 2695DescriptionThe Pizazz Pizzeria prides itself in

2015-03-12 11:42:48 633

原创 POJ 1185 炮兵阵地（状压dp）

Language:Default炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20502 Accepted: 7944Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图

2015-03-10 21:11:13 556

原创 POJ 3254 Corn Fields （状压）

Language:DefaultCorn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8704 Accepted: 4641DescriptionFarmer John has purchased a lush new rect

2015-03-10 12:16:00 611

原创 POJ 2411 Mondriaan's Dream (状压+dfs)

Language:DefaultMondriaan's DreamTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 12405 Accepted: 7239DescriptionSquares and rectangles fascinated

2015-03-10 09:27:05 629

原创 HDU 1992 Tiling a Grid With Dominoes (状压 dp)

Problem DescriptionWe wish to tile a grid 4 units high and N units long with rectangles (dominoes) 2 units by one unit (in either orientation). For example, the figure shows the five different ways

2015-03-10 09:03:02 617

原创 POJ 2411 Mondriaan's Dream（状压 dp）

Language:DefaultMondriaan's DreamTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 12403 Accepted: 7237DescriptionSquares and rectangles fascinated

2015-03-09 21:36:18 445

空空如也

空空如也