Simone_chou
- 浏览: 192573 次
- 性别:
- 来自: 广州
-
最新评论
-
yomean：
怎么全是背包的。。？
Cash Machine（多重背包） -
Simone_chou：
yomean 写道http://www.notonlysucc ...
Sliding Window（线段树） -
yomean：
http://www.notonlysuccess.com/i ...
Sliding Window（线段树） -
Simone_chou：
yomean 写道你的博客好多图，好赞！图用QQ表情那个涂鸦随 ...
Find them, Catch them（带权并查集） -
yomean：
你的博客好多图，好赞！
Find them, Catch them（带权并查集）
文章列表
How far away ？
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5810 Accepted Submission(s): 2182
Problem Description
There are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like t ...
Nearest Common Ancestors
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 18912
Accepted: 10007
Description
A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is labeled with an in ...
C. 24 Game
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Little X used to play a card game called "24 Game", but recently he has found it too easy. So he invented a new game.
Initially you have a sequenc ...
Explosion
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 259 Accepted Submission(s): 67
Problem Description
Everyone knows Matt enjoys playing games very much. Now, he is playing such a game. There are N rooms, each with one door. Ther ...
Saving Tang Monk（BFS）
- 博客分类：
- HDOJ
Saving Tang Monk
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 579 Accepted Submission(s): 217
Problem Description
《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by W ...
Information Graph（并查集）
- 博客分类：
- CF
E. Information Graph
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output
There are n employees working in company "X" (let's number them from 1 to n for convenience). Initially the employees didn't have any rel ...
233 Matrix（矩阵快速幂）
- 博客分类：
- HDOJ
233 Matrix
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 553 Accepted Submission(s): 345
Problem Description
In our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 ... in the same meanin ...
Number Sequence（二进制）
- 博客分类：
- HDOJ
Number Sequence
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1886 Accepted Submission(s): 561Special Judge
Problem Description
There is a special number sequence which has n+1 integers. For each number in sequence, we have two rules: ...
Dice
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1109 Accepted Submission(s): 584
Problem Description
There are 2 special dices on the table. On each face of the dice, a distinct number was written. Consider a1.a2,a3,a4,a5,a6 to be ...
Walk（概率DP）
- 博客分类：
- HDOJ
Walk
Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 291 Accepted Submission(s): 200Special Judge
Problem Description
I used to think I could be anything, but now I know that I couldn't do anything. So I started traveling.The nation loo ...
Untrusted Patrol（DFS）
- 博客分类：
- ZOJ
Untrusted Patrol
Time Limit: 3 Seconds Memory Limit: 65536 KB
Edward is a rich man. He owns a large factory for health drink production. As a matter of course, there is a large warehouse in the factory.
To ensure the safety of drinks, Edward hired a security man to patrol the warehouse. The ...
LITTLE SHOP OF FLOWERS
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 18300
Accepted: 8435
Description
You want to arrange the window of your flower shop in a most pleasant way. You have F bunches of flowers, each being of a different kind, and at least as many ...
月老的难题（二分图最大匹配）
- 博客分类：
- NYOJ
月老的难题
时间限制：1000 ms | 内存限制：65535 KB
难度：4
描述
月老准备给n个女孩与n个男孩牵红线，成就一对对美好的姻缘。
现在，由于一些原因，部分男孩与女孩可能结成幸福的一家，部分可能不会结成幸福的家庭。
现在已知哪些男孩与哪些女孩如果结婚的话，可以结成幸福的家庭，月老准备促成尽可能多的幸福家庭，请你帮他找出最多可能促成的幸福家庭数量吧。
假设男孩们分别编号为1~n,女孩们也分别编号为1~n。
Battle City
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 6880
Accepted: 2326
Description
Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now.
What we are discussing is a simple ...
Jungle Roads
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 19454
Accepted: 8919
Description
The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle ...