ACM Problems
limn2o4
这个作者很懒,什么都没留下…
展开
-
POJ 1010
Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He reali原创 2017-02-05 12:50:22 · 267 阅读 · 0 评论 -
UVA11624 Fire!
Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s location in the原创 2017-02-16 23:26:55 · 255 阅读 · 0 评论 -
HDU1728 逃离迷宫
the question is here http://acm.hdu.edu.cn/showproblem.php?pid=1728I work so hard to find a way to cut edges.I failed at last.So I learn that from other people.I realize that cuting-edges is not a easy转载 2017-02-16 23:37:35 · 205 阅读 · 0 评论 -
POJ 3278 Catch That Cow
POJ 3278 Catch That CowFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at原创 2017-01-21 23:59:35 · 271 阅读 · 0 评论 -
CodeForces616C The Labyrinth
The original problem is in this page https://vjudge.net/problem/306223/origin And let’s skip to the point. The is a DFS problem and considered that the number could be very large,this time I mark eve原创 2017-02-12 23:37:12 · 232 阅读 · 0 评论 -
CodeForces 59B
Marina loves Sasha. But she keeps wondering whether Sasha loves her. Of course, the best way to know it is fortune telling. There are many ways of telling fortune, but Marina has picked the easiest one原创 2017-01-22 21:45:27 · 499 阅读 · 0 评论 -
POJ 1526 Oil Deposits
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the原创 2017-01-22 22:29:34 · 321 阅读 · 0 评论 -
POJ 1163 The Triangle
Description7 3 8 8 1 0 2 7 4 4 4 5 2 6 5(Figure 1) Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at原创 2017-01-27 11:50:13 · 207 阅读 · 0 评论 -
校赛反思和题解
这次校赛只做出来三道题,而且自己没做出来一道。虽然拿了铜奖,这有什么意义呢?这个奖唯一的意义就是告诉我自己还很菜,同样在集训队的大一同学至少是银奖。我不愿意和别人这样去竞争。所以找找自己的原因吧。 首先是自己刚的J题没有做出来,原因不明。其次是全场最简单的签到题卡了读题。很简单的模拟没有搞出来,博弈论本来是可以做出来的。 我冷静下来想了一下,这只能说明我的代码能力在学习算法的时候没有得到锻炼,或原创 2017-03-18 17:29:25 · 319 阅读 · 0 评论 -
2017陕西省ACM省赛总结
这是我的第一场省赛,当然不是最后一场。这次打了铁,我只能说是实力不足或者说是判断失误。先说一下题目吧。 A题是一道数学题,只要推出规律或者枚举就行。 B题是一道暴力题,然而我们都没有想到暴力的做法。 除了J题是签到题之外,其他的题目大多是DP类的题目。 如果仅仅从题目的难度来看,我们至多可以做出来3道题,应该是能拿到铜牌的。 这次比赛的主要失利的原因在于我没有正确判断B题的做法,导致了我们原创 2017-05-27 17:22:01 · 1037 阅读 · 2 评论 -
HDOJ5627 Clarke and MST (并查集)
原题的链接 this question want us to find a maximum AND operation spanning tree. I use union set to check the connectivity of each edge ,and find answer bit by bit and check each method of how edges joi原创 2017-05-27 17:40:19 · 275 阅读 · 0 评论 -
HDOJ 2674 N!Again
this is the link to questionwell,this is a very good question witch needs some thinking,if the N that gives greater than 2009 ,no matter the N is ,the answer is always zero.we can use this info do down原创 2017-05-27 17:55:42 · 248 阅读 · 0 评论 -
POJ 3660 Cow Contest (全源最短路)
this is the original question this question tell us to check if one cow’s rank can be determined.It means we should think the relationship as a graph , each cow in the graph is nodes and their rel原创 2017-05-27 18:46:21 · 211 阅读 · 0 评论 -
POJ 3186 Treats for the Cows(区间DP)
the question is here this DP question want us to chose treats and find the maximum value . We can see this is a dp question , and the equation which I write below means the maximum value for i to j ca原创 2017-05-27 19:06:47 · 198 阅读 · 0 评论 -
POJ 3186 Treats for the Cows(贪心)
this is the question’s linkI believe this question is a greedy algorithm ,so I sort the data first and than update the maximum vale of right value of each member of struct node#include <iostream>#incl原创 2017-05-27 19:21:16 · 424 阅读 · 2 评论 -
POJ1248 寒冰王座(完全背包)
http://acm.hdu.edu.cn/showproblem.php?pid=1248 Here’s the original question .As the title say this a complete bag problem so I simply use a template which ac it onlt once. I put this to remind me to原创 2017-03-03 21:12:36 · 346 阅读 · 0 评论 -
HDOJ 1003Max Sum (dp)
This is original link to the problem this question is a typical dp problem .It’s need us to find the maximum sub region sum,and I tear apart the equation of dp to find the start point and terminate poi原创 2017-06-07 19:23:37 · 227 阅读 · 0 评论 -
第一届中兴捧月算法大赛迪杰斯特拉派解决方案
迪杰斯特拉派初赛赛题最强大脑中的收官蜂巢迷宫变态级挑战,相信大家都叹为观止!最强大脑收官战打响后,收视率节节攀升,就连蚁后也不时出题难为一下她的子民们。在动物世界中,称得上活地图的,除了蜜蜂,蚂蚁当仁不让。在复杂多变的蚁巢中, 蚂蚁总是能以最快、最高效的方式游历在各个储藏间(存储食物)。今天,她看完最新一期节目,又发布了一项新任务:小蚁同学,我需要玉米库的玉米,再要配点水果,去帮我找来吧。小蚁正准备原创 2017-06-04 14:06:33 · 3538 阅读 · 2 评论 -
HDOJ 3709 balanced number (digit dp)
link to the question I spend almost a whole afternoon to figure this question out and I did it! I made annotation right after the code to help understand. Although I use some else’s code for referenc原创 2017-06-21 19:02:33 · 249 阅读 · 0 评论 -
随便写的扫雷程序.cpp
上课玩扫雷被抓,然后自己写了一个出来。自动扫雷脚本还没实现……#include <bits/stdc++.h>#include <cstring>#define UNREVAL -1#define FLAGED 10using namespace std;const int N = 10;int g[N+1][N+1];int o[N+1][N+1];int surf[N+1][N+原创 2017-06-22 20:02:44 · 1083 阅读 · 0 评论 -
HDOJ 4745 (区间DP)
the problem is herethis is a very typical range dp question ,and I made some comment right after the code down here ,the main stream of the quiz is find the longest Palindrome sub-sequence in range of原创 2017-06-13 20:28:09 · 261 阅读 · 0 评论 -
HDOJ 1166 排兵布阵(线段树)
the question is [here],(http://acm.hdu.edu.cn/showproblem.php?pid=1166) I have nothing to say but one sentence : zkw NB!#include <bits/stdc++.h>#include <cstring>using namespace std;const int maxn原创 2017-07-15 21:07:08 · 360 阅读 · 0 评论 -
HDOJ 1890 Robotic Sort
the link to the problem so recently I spend significant time on data struct learning , this is a splay tree problem .I tried to write the code from the theory but I failed . maybe I can’t learning som原创 2017-07-20 23:33:05 · 229 阅读 · 0 评论 -
HDOJ 1698 Just a Hook (线段树)
here is the problem,I learned another type of range tree and it’s a recursion version and a little slow than zkw’s tree , I made some change to fit my habit from the initial code#include <bits/stdc++.h原创 2017-07-18 23:22:04 · 229 阅读 · 0 评论 -
HDOJ 2795 Billboard (线段树)
74/100 link is here according to the question , we should control the direction of update ,it really easy but still hard to think . this time I learn deeper in “the tree”.And I unconsciously become原创 2017-07-21 23:43:55 · 204 阅读 · 0 评论 -
HDOJ 3549 Flow Problem(network flow)
this is a very good question for beginning to learn network flow , very easy way to use ff algorithm . Need more work in graphic theory……#include <bits/stdc++.h>#include <cstring>using namespace std原创 2017-07-22 23:06:08 · 243 阅读 · 0 评论 -
POJ 2785 4 Values whose Sum is 0
you can find the problem here the question let us to find 4 number from each row which sum fo them is zero. what we should do is to take two rows of tem as one row,get 2∗N∗N2*N*N number, than us binar原创 2017-08-16 12:02:37 · 169 阅读 · 0 评论 -
POJ 3122 Pie(二分答案)
this is the question to solve this , we should use some method called binary search the solution , when we examine one possible answer , we see if the ans ( pie size) and be depart to all the friends.原创 2017-08-16 15:13:44 · 331 阅读 · 0 评论 -
hdoj 1515 Anagrams by Stack(dfs)
you can submit in here the problem give us a string A,and many strings B,find a stack push/pop operation sequence satisfy the A transform to B it’s a search problem and we should record the times of原创 2017-08-16 15:25:14 · 171 阅读 · 0 评论 -
POJ 3009 Curling 2.0 (dfs)
click me to submit IN this question , their is a little bit change.first we need to find a far enough location ,than we should go one step further to change the unreachable block reachable , and tha原创 2017-08-16 15:56:39 · 194 阅读 · 0 评论 -
HDOJ 4016 Magic Bitwise And Operation(Dfs剪枝)
if we do no cutting edge strategy in this dfs problem,we will get a TLE,so here is the cutting edge : if we find a solution that is bigger than ans we have after doing the AND operation to the end , w原创 2017-08-16 16:56:48 · 182 阅读 · 0 评论 -
HDOJ 5543 Pick The Sticks (简单DP)
you can find this problem in this link the dynamic programming equation is: dp[j][k]=max(dp[j][k],dp[j−len[i]][k]+val[i])dp[j][k] = max(dp[j][k],dp[j-len[i]][k]+val[i]) j means the length of current原创 2017-08-17 10:04:55 · 176 阅读 · 0 评论 -
HDOJ 1069 Monkey and Banana(DP)
this is a simple 01 bags problem which need a little change of the number of goods. in this problem (link) we should stack our cuboid to the height given by problem,but we can’t determine the way of pl原创 2017-08-17 10:23:02 · 223 阅读 · 0 评论 -
HDOJ 6047 Maximum Sequence(单调队列)
the description of the problem is really hard to understand . It’s means we should find a start point k in array B, than go back to array A, find the maximum of Aj−jA_j - j in range (K,i) .we can us pr原创 2017-08-17 10:34:56 · 197 阅读 · 0 评论 -
CF 812B Sagheer, the Hausmeister
The way I get this done is dynamic programming . Unlike the greedy method I do a little preliminary stuff to finished it. the equation is pretty easy , just three way of get next floor.but we have to原创 2017-08-17 10:59:14 · 326 阅读 · 0 评论 -
HDOJ 2883 kebab (网络流)
link to the problem is here this is a very hard problem or my skill in modelling network flow is to ‘naive’ .I spend a day to find a incorrect way and after I look up some data and finally I made this原创 2017-07-26 00:15:25 · 240 阅读 · 0 评论 -
POJ2699 The Maximum Number of Strong Kings (maxflow)
recently I’ve done a lot network flow problem and this is one of themfirst of all , there is only 10 potential player who can be the king so we can iter them form let’s talk about how to build the n原创 2017-09-03 22:57:52 · 238 阅读 · 0 评论 -
POJ1730 Perfect Pth Powers (math)
you can find the original description here This problem let us to find whether can be exactly a number ‘s k power,we can have the given number x to depart with prime factor,and we let answer be the gc原创 2017-09-02 21:52:53 · 296 阅读 · 0 评论 -
CodeForce 124B Permutations(水题)
一直在尝试用英文写题解,但是我发现我的英语水平还达不到能把问题说清楚的水平,所以还是改回中文吧…… 这是一道比较水的题,但是同样需要注意下。 这道题的题意是给一组一个N位数的多个不同的排列所构成的数,然后让我们每次对所有的数进行数位交换,找出所有交换中最大值和最小值的差最小的一次,并且将这个差输出。 提议很简短,我们首先想到如何对所有的数进行排列,其实根本不用,我们可以先生成一个次序数组,然后原创 2017-10-07 20:09:27 · 315 阅读 · 0 评论 -
UVAlive6620 Josephina and RPG
这是一道容易的概率DP题link 这道题的题意是:给出一个队伍的组合和对另一种组合获胜的概率,之后求出战胜给出敌人的概率。我们首先想到的是对于一个组合,我们要不要选他,那么这样状态就很容易想出来了:用dp[i][j] 表示对第前i个敌人,当前采用第j个队伍组合,在已知各个队伍组合之间的胜率之后,我们的决策就变成了dp[i][j] = p[j][k]*max(dp[i-1][j],dp[i-1][k原创 2017-10-07 20:25:40 · 200 阅读 · 0 评论