文章档案「2013年12月」 - HaibaraAi

Uva 10755 Garbage Heap

摘要：Garbage HeapTime limit: ? secondsMemory limit: 64 megabytesFarmer John has a heap of garbage formed in a rectangular parallelepiped.It consists of garbage pieces each of which has a value. The value of a piece may be 0, if the piece is neither profitable nor harmful, and may be negative which means. 阅读全文

posted @ 2013-12-30 22:01 HaibaraAi 阅读(139) 评论(0) 推荐(0)

ZOJ 3741 Eternal Reality

摘要：Eternal RealityTime Limit: 2 Seconds Memory Limit: 65536 KBIn Academy City, most students have special abilities. Such as Railgun, Teleport, Telekinesis, AIM Stalker and so on. Here, AIM (An Involuntary Movement) is a term used to refer to the phenomenon in which an esper involuntarily produces a... 阅读全文

posted @ 2013-12-30 01:56 HaibaraAi 阅读(169) 评论(0) 推荐(0)

HDU 1081 To The Max

摘要：To The MaxTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6981Accepted Submission(s): 3364 Problem DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater loc 阅读全文

posted @ 2013-12-29 04:56 HaibaraAi 阅读(101) 评论(0) 推荐(0)

LA 3695 Distant Galaxy

摘要：3695 - Distant GalaxyTime limit: 3.000 secondsYou are observing a distant galaxy using a telescope above the Astronomy Tower, and you think that a rectangle drawn in that galaxy whose edges are parallel to coordinate axes and contain maximum star systems on its edges has a great deal to do with the 阅读全文

posted @ 2013-12-28 19:10 HaibaraAi 阅读(136) 评论(0) 推荐(0)

LA 2678 Subsequence

摘要：A sequence of N positive integers (10 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 #define INF 0x7fffffff11 #define mod 100000000712 #define ll long long13 #define maxn 10000514 #define pi acos(-1.0)15 //const int maxk = 10 + 1, inf = ~0U >> 2;16.. 阅读全文

posted @ 2013-12-27 19:36 HaibaraAi 阅读(115) 评论(0) 推荐(0)

Uva 11078 Open Credit System

摘要：Problem E Open CreditIn an open credit system, the students can choose any course they like, but there is a problem. Some of the students are more senior than other students. The professor of such a course has found quite a number of such students who came from senior classes (as if they came to att 阅读全文

posted @ 2013-12-27 16:52 HaibaraAi 阅读(86) 评论(0) 推荐(0)

LA 5422 Gone Fishing

摘要：Gone Fishing妈蛋，这题左改又改，输出格式是这么个玩意- -！，还有就是，取最大个数优先的没弄好！John is going on a fishing trip. He has h hours available ( ), and there are n lakes in the area ( ) all reachable along a single, one-way road. John starts at lake 1, but he can finish at any lake he wants. He can only travel from one lake to... 阅读全文

posted @ 2013-12-26 12:19 HaibaraAi 阅读(110) 评论(0) 推荐(0)

LA 2427 Balloons in a Box

摘要：Balloons in a BoxWA了一版真的找不到错误！妈蛋，找到了，(a.y - b.y)*(a.y - b.y)+(a.z - b.z)*(a.z - b.z)中间一直用的是*号，妈蛋，这样为什么样例能对，fu*k！You must write a program that simulates placing spherical balloons into a rectangular box.The simulation scenario is as follows. Imagine that you are given a rectangular box and a set of p 阅读全文

posted @ 2013-12-26 03:43 HaibaraAi 阅读(165) 评论(0) 推荐(0)

Codeforce Round #221 Div2 C

摘要：C. Divisible by Seventime limit per test 1 secondmemory limit per test 256 megabytesYou have number a, whose decimal representation quite luckily contains digits 1, 6, 8, 9. Rearrange the digits in its decimal representation so that the resulting number will be divisible by 7.Number a doesn't co 阅读全文

posted @ 2013-12-26 00:22 HaibaraAi 阅读(113) 评论(0) 推荐(0)

Codeforce Round #221 Div2 B

摘要：B. I.O.U.time limit per test 1 secondmemory limit per test 256 megabytesImagine that there is a group of three friends: A, B and С. A owes B 20 rubles and B owes C 20 rubles. The total sum of the debts is 40 rubles. You can see that the debts are not organized in a very optimal manner. Let's rea 阅读全文

posted @ 2013-12-25 12:35 HaibaraAi 阅读(168) 评论(0) 推荐(0)

Codeforce Round #221 Div2 A

摘要：A. Levertime limit per test 1 secondmemory limit per test 256 megabytesYou have a description of a lever as string s. We'll represent the string length as record |s|, then the lever looks as a horizontal bar with weights of length |s| - 1 with exactly one pivot. We will assume that the bar is a 阅读全文

posted @ 2013-12-25 12:34 HaibaraAi 阅读(150) 评论(0) 推荐(0)

LA 3029 City Game

摘要：City GameBob is a strategy game programming specialist. In his new city building game the gaming environment is as follows: a city is built up by areas, in which there are streets, trees, factories and buildings. There is still some space in the area that is unoccupied. The strategic task of his gam 阅读全文

posted @ 2013-12-24 19:28 HaibaraAi 阅读(110) 评论(0) 推荐(0)

FOJ Problem 2144 Shooting Game

摘要：Problem 2144 Shooting GameAccept: 6Submit: 40 Time Limit: 1000 mSecMemory Limit : 32768 KBProblem Description擦，精度有问题！Fat brother and Maze are playing a kind of special (hentai) game in the playground. (Maybe it’s the OOXX game which decrypted in the last problem, who knows.) But as they don’t like u 阅读全文

posted @ 2013-12-23 17:28 HaibaraAi 阅读(224) 评论(0) 推荐(0)

FOJ Problem 2148 Moon Game

摘要：Problem 2148 Moon GameAccept: 19Submit: 53 Time Limit: 1000 mSecMemory Limit : 32768 KBProblem Description加了个第一个判断对角线的我也不知道，这个是怎么对的，自己写就有问题，不小心敲错了，就过了！Fat brother and Maze are playing a kind of special (hentai) game in the clearly blue sky which we can just consider as a kind of two-dimensional plan 阅读全文

posted @ 2013-12-23 06:52 HaibaraAi 阅读(163) 评论(0) 推荐(0)

FOJ Problem 2150 Fire Game

摘要：Problem 2150 Fire GameAccept: 22Submit: 46 Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionFat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then they 阅读全文

posted @ 2013-12-23 06:49 HaibaraAi 阅读(252) 评论(0) 推荐(0)

2013 Asia Nanjing Regional Contest C

摘要：Campus DesignTime Limit: 15000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 184Accepted Submission(s): 92 （1）可以放1*2的块、1*1的块，分别根据其特点转移即可（2）1*1的块有个数要求；增加一维表示用的1* 1块个数即可（3）有些格子不能放，有些格子能放；分两种情况进行转移即可dp[i][s][k]表示：i阶段s状态使用有k个1*1块时的覆盖方案总数（共n*m各阶段，每个阶段（1 3 #include .. 阅读全文

posted @ 2013-12-22 05:59 HaibaraAi 阅读(180) 评论(0) 推荐(0)

2013 Asia Nanjing Regional Contest B

摘要：Poor Warehouse KeeperTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 404Accepted Submission(s): 117 Problem DescriptionJenny is a warehouse keeper. He writes down the entry records everyday. The record is shown on a screen, as follow:There are onl 阅读全文

posted @ 2013-12-22 01:05 HaibaraAi 阅读(117) 评论(0) 推荐(0)

2013 Asia Nanjing Regional Contest I

摘要：Wall PaintingTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 411Accepted Submission(s): 121 Problem DescriptionMs.Fang loves painting very much. She paints GFW(Great Funny Wall) every day. Every day before painting, she produces a wonderful color 阅读全文

posted @ 2013-12-21 12:15 HaibaraAi 阅读(105) 评论(0) 推荐(0)

2013 Asia Nanjing Regional Contest J

摘要：BallTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 254Accepted Submission(s): 110 Problem DescriptionJenny likes balls. He has some balls and he wants to arrange them in a row on the table. Each of those balls can be one of three possible colors: 阅读全文

posted @ 2013-12-20 18:24 HaibaraAi 阅读(115) 评论(0) 推荐(0)

Codeforce Round #220 Div2 A

摘要：A. Inna and Pink Ponytime limit per test 1 secondmemory limit per test 256 megabytesDima and Inna are doing so great! At the moment, Inna is sitting on the magic lawn playing with a pink pony. Dima wanted to play too. He brought an n × m chessboard, a very tasty candy and two numbers a and b.Di 阅读全文

posted @ 2013-12-20 17:22 HaibaraAi 阅读(118) 评论(0) 推荐(0)

Codeforce Round #220 Div2 C

摘要：C. Inna and Dimatime limit per test1 secondmemory limit per test256 megabytesInna and Dima bought a table of size n × m in the shop. Each cell of the table contains a single letter: "D", "I", "M", "A".Inna loves Dima, so she wants to go through his name a 阅读全文

posted @ 2013-12-20 12:13 HaibaraAi 阅读(143) 评论(0) 推荐(0)

Codeforce Round #220 Div2 B

摘要：B. Inna and Ninetime limit per test 1 secondmemory limit per test 256 megabytesInna loves digit 9 very much. That's why she asked Dima to write a small number consisting of nines. But Dima must have misunderstood her and he wrote a very large number a, consisting of digits from 1 to 9.Inna wants 阅读全文

posted @ 2013-12-20 08:14 HaibaraAi 阅读(76) 评论(0) 推荐(0)

2013 Asia Nanjing Regional Contest A

摘要：GPATime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 276Accepted Submission(s): 159 Problem DescriptionIn college, a student may take several courses. for each course i, he earns a certain credit (ci), and a mark ranging from A to F, which is compar 阅读全文

posted @ 2013-12-20 00:24 HaibaraAi 阅读(144) 评论(0) 推荐(0)

2013 Asia Changsha Regional Contest I

摘要：LIKE vs CANDLETime Limit: 2 Seconds Memory Limit: 65536 KBA microblog caused a war recently - There's the war between LIKE and CANDLE.As you see, there are N accounts are trying to show their support of LIKE or CANDLE. The way they show the support is forwarding a microblog, which means you choo 阅读全文

posted @ 2013-12-18 14:21 HaibaraAi 阅读(117) 评论(0) 推荐(0)

HNUST 反转地球

摘要：1589: 反转地球，颠覆世界时间限制: 1 Sec内存限制: 128 MB 提交: 14解决: 10 [提交][状态][讨论版]题目描述北欧巨人沉睡了几万年后苏醒过来了，他们想做的第一件事就是让整个世界回到属于他们的那个“神话”时代。万能的上帝知道此事后和巨人们产生如下对话：上帝：你们知道怎么返回“神话”时代吗？巨人：...（巨人不知道）上帝：反转地球便可颠覆世界呀！巨人: ...（此时巨人顿时醒悟）上帝：我是公平的，如果你们能在我的游戏中胜出，我便助你们返回“神话”时代。上帝的游戏是这样的：游戏基于N张纸牌，上面分别标着1、2、3、4.....N-1、N 这N个数字。游戏有一个操作叫“反转阅读全文

posted @ 2013-12-18 02:43 HaibaraAi 阅读(173) 评论(0) 推荐(0)

HDU 1495 非常可乐

摘要：非常可乐Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3914Accepted Submission(s): 1617 Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升可乐的体积为S （S 2 阅读全文

posted @ 2013-12-18 02:11 HaibaraAi 阅读(97) 评论(0) 推荐(0)

2012 Asia Changsha Regional Contest Problem G

摘要：Graph ReconstructionTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeLet there be a simple graph with N vertices but we just know the degree of each vertex. Is it possible to reconstruct the graph only by these information?A simple graph is an undirected graph that has no loops (edges c... 阅读全文

posted @ 2013-12-17 05:57 HaibaraAi 阅读(109) 评论(0) 推荐(0)

2012 Asia Changsha Regional Contest Problem H

摘要：SkycityTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeThe world's new tallest building is going to be built in Changsha, which will be called as "Skycity". The Skycity is going to be built as a circular truncated cone, radius of its bottom is marked as R, and radius of its t 阅读全文

posted @ 2013-12-16 14:05 HaibaraAi 阅读(139) 评论(0) 推荐(0)

2013 Asia Changsha Regional Contest Problem C

摘要：CollisionTime Limit: 2 Seconds Memory Limit: 65536 KB Special Judge一不小心公式化错，改半天！There's a round medal fixed on an ideal smooth table, Fancy is trying to throw some coins and make them slip towards the medal to collide. There's also a round range which shares exact the same center as the roun 阅读全文

posted @ 2013-12-16 04:49 HaibaraAi 阅读(98) 评论(0) 推荐(0)

Codeforce Round #219 Div2 C

摘要：C. Counting Kangaroos is Funtime limit per test 1 secondmemory limit per test256 megabytes这么简单的贪心都没想到！，难道就只知道首尾和相邻？这个是由于最多就n/2的数量，也尽量消耗n/2以内的大的，因为消耗了n/2以内的大的，即使用了最大的也没关系，如果这样了，n/2小的也有可能消耗，如果不这样，也就顶多用最大的消耗一个n/2稍微小的！There are n kangaroos with pockets. Each kangaroo has a size (integer number). A kanga 阅读全文

posted @ 2013-12-14 04:29 HaibaraAi 阅读(210) 评论(0) 推荐(0)

Codeforce Round #219 Div2 B

摘要：B. Making Sequences is Funtime limit per test 2 secondsmemory limit per test 256 megabytesWe'll define S(n) for positive integer n as follows: the number of the n's digits in the decimal base. For example, S(893) = 3, S(114514) = 6.You want to make a consecutive integer sequence starting fro 阅读全文

posted @ 2013-12-14 00:06 HaibaraAi 阅读(152) 评论(0) 推荐(0)

Codeforce Round #219 Div2 A

摘要：A. Collecting Beats is Funtime limit per test 1 secondmemory limit per test 256 megabytesCucumber boy is fan of Kyubeat, a famous music game.Kyubeat has 16 panels for playing arranged in 4 × 4 table. When a panel lights up, he has to press that panel.Each panel has a timing to press (the preffe 阅读全文

posted @ 2013-12-14 00:04 HaibaraAi 阅读(154) 评论(0) 推荐(0)

ACM_单调队列

摘要：单调队列spoiler posted @ 2011年4月09日 17:10 in 未分类 , 2702 阅读一直弄不明白单调队列是什么，在网上也找不到易懂的介绍。最后结合别人博客上的介绍和程序看才理解是怎么回事。我们从最简单的问题开始：给定一个长度为N的整数数列a(i),i=0,1,...,N-1和窗长度k.要求： f(i) = max{a(i-k+1),a(i-k+2),..., a(i)},i = 0,1,...,N-1问题的另一种描述就是用一个长度为k的窗在整数数列上移动，求窗里面所包含的数的最大值。解法一：很直观的一种解法，那就是从数列的开头，将窗放上去，然后找到这最开始的k个数的最大阅读全文

posted @ 2013-12-11 05:59 HaibaraAi 阅读(123) 评论(0) 推荐(0)

Warm up 13 [G] Game of Tiles

摘要：GameofTilesTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KBTotal submit users: 3, Accepted users: 2Problem 12754 : No special judgementProblem description染色啊，什么的- -，对每个连通块进行黑白染色，构二分图，如果有一个连通分量不是完美匹配就输出1否则输出2！The Game of Tiles is a game for two players played over a rectangular bo. 阅读全文

posted @ 2013-12-11 04:05 HaibaraAi 阅读(119) 评论(0) 推荐(0)

ACM_二分图匹配

摘要：二分图的最大匹配、完美匹配和匈牙利算法2013-08-01Algorithms二分图匹配, 图论, 算法Renfei Song这篇文章讲无权二分图（unweighted bipartite graph）的最大匹配（maximum matching）和完美匹配（perfect matching），以及用于求解匹配的匈牙利算法（Hungarian Algorithm）；不讲带权二分图的最佳匹配。二分图：简单来说，如果图中点可以被分为两组，并且使得所有边都跨越组的边界，则这就是一个二分图。准确地说：把一个图的顶点划分为两个不相交集U和V ，使得每一条边都分别连接U、V中的顶点。如果存在这样的划分，则阅读全文

posted @ 2013-12-10 18:24 HaibaraAi 阅读(186) 评论(0) 推荐(0)

Codechef August Challenge 2013 Save The Princess

摘要：Save The PrincessProblem code: SHIROMy SubmissionsAll Submissionsdp[j]表示前i个A旗子数量大于等于j的概率！当j-a[i] 2 #include 3 #include 4 #include 5 #include 6 #include 7 using namespace std; 8 #define maxn 10005 9 #define INF 0x7fffffff10 int n, m, k, x, y, d, t,ans;11 int a[maxn];12 double b[maxn], dp[maxn];1... 阅读全文

posted @ 2013-12-10 04:20 HaibaraAi 阅读(93) 评论(0) 推荐(0)

Codeforce Round #217 Div2 C

摘要：C. Mittenstime limit per test 1 secondmemory limit per test 256 megabytesA Christmas party in city S. had n children. All children came in mittens. The mittens can be of different colors, but each child had the left and the right mitten of the same color. Let's say that the colors of the mittens 阅读全文

posted @ 2013-12-09 16:54 HaibaraAi 阅读(151) 评论(0) 推荐(0)

Codeforce Round #218 Div2 C

摘要：C. Hamburgerstime limit per test 1 secondmemory limit per test256 megabytesPolycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers from: a bread, sausage and cheese. He w 阅读全文

posted @ 2013-12-09 12:55 HaibaraAi 阅读(204) 评论(0) 推荐(0)

Codeforce Round #218 Div2 A

摘要：A. K-Periodic Arraytime limit per test 1 secondmemory limit per test 256 megabytesThis task will exclusively concentrate only on the arrays where all elements equal 1 and/or 2.Array a is k-period if its length is divisible by k and there is such array b of length k, that a is represented by array b 阅读全文

posted @ 2013-12-09 12:53 HaibaraAi 阅读(171) 评论(0) 推荐(0)

Codeforce Round #218 Div2 B

摘要：B. Fox Dividing Cheesetime limit per test 1 secondmemory limit per test256 megabytesTwo little greedy bears have found two pieces of cheese in the forest of weight a and b grams, correspondingly. The bears are so greedy that they are ready to fight for the larger piece. That's where the fox come 阅读全文

posted @ 2013-12-09 12:52 HaibaraAi 阅读(137) 评论(0) 推荐(0)

Codeforce Round #217 Div2 A

摘要：A. Rook, Bishop and Kingtime limit per test1 secondmemory limit per test256 megabytesLittle Petya is learning to play chess. He has already learned how to move a king, a rook and a bishop. Let us remind you the rules of moving chess pieces. A chessboard is 64 square fields organized into an 8 × 阅读全文

posted @ 2013-12-08 13:19 HaibaraAi 阅读(154) 评论(0) 推荐(0)

Codeforce Round #217 Div2 B

摘要：B. Berland Bingotime limit per test1 secondmemory limit per test256 megabytesLately, a national version of a bingo game has become very popular in Berland. There are n players playing the game, each player has a card with numbers. The numbers on each card are distinct, but distinct cards can have eq 阅读全文

posted @ 2013-12-07 21:21 HaibaraAi 阅读(116) 评论(0) 推荐(0)

2013 Asia Changsha Regional Contest J

摘要：Josephina and RPGTime Limit: 2 Seconds Memory Limit: 65536 KB Special Judge一开是这题看成可以交换顺序的的，就木有思路了，后面发现要按他的顺序打- -#，然后又因为它序号是从0开始的- -#然后就是dp，枚举每个队与要求的第i支队打，分两种一种交换，一种不换，不换按不换前的比较max，交换按交换前的比较max因为反正要保存那种状态的最大值dp[i][j]表示第打了前i场，当前是第j支队，全胜的概率！A role-playing game (RPG and sometimes roleplaying game) is .. 阅读全文

posted @ 2013-12-07 13:26 HaibaraAi 阅读(122) 评论(0) 推荐(0)

2012 Asia Changsha Regional Contest Problem K

摘要：Pocket CubeTime Limit: 2 Seconds Memory Limit: 65536 KB这题写的真的*痛- -#，全局数组变了全局传过去的tmp数组也变了不知道，见识太少- -#~因为2阶魔方本来有12中转每个面有2中方向，但是右边顺时针和左边逆时针是相同的所以其实只有6种转法！预处理下转动后的情况就行了！如果考虑翻转的话可以只有4种，但是不好判重，翻转又不算次数，所以还是直接6种爆搜好，标记啊，判重啊什么的，一个是为了减少次数，另一方面可以避免死循环(-｡-;)！不过这题直接爆就行了！Pocket Cube is a 3-D combination puzzle. I. 阅读全文

posted @ 2013-12-07 01:04 HaibaraAi 阅读(89) 评论(0) 推荐(0)

2013 Asia Hangzhou Regional Contest H

摘要：Rabbit KingdomTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 561Accepted Submission(s): 167 又是一道看解题报告很久，没点反应的题！就是这么做吧，预处理因子，对这些区间按l排序，然后预处理每个点的左右互质范围lf[i],ri[i];然后，预处理求第i个点左边界也就是lf[x]对应的x存进vectorv[maxn];然后从1 to n一个一个的添加判断是不是到了要求的范围区间求和;然后对每一个i对应的阅读全文

posted @ 2013-12-04 22:32 HaibaraAi 阅读(125) 评论(0) 推荐(0)

Topcoder SRM 598 div2 A

摘要：Problem Statement Fox Ciel received a string as a birthday present. However, the string was too long for her, so she decided to make it shorter by erasing some characters.The erasing process will look as follows: Find... 阅读全文

posted @ 2013-12-01 22:54 HaibaraAi 阅读(169) 评论(0) 推荐(0)

POJ 2533 Longest Ordered Subsequence

摘要：Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 29540Accepted: 12864DescriptionA numeric sequence of ai is ordered if a1 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 #include 12 #include 13 14 using... 阅读全文

posted @ 2013-12-01 18:44 HaibaraAi 阅读(139) 评论(0) 推荐(0)