yasolx的博客

Fire NetTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12126    Accepted Submission(s): 7315Problem DescriptionSuppose that we

Desert King Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 26364 Accepted: 7307 Description David the Great has just become the king of a desert country. To win the respect of his peo

DivisibilityTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2043    Accepted Submission(s): 823Problem DescriptionAs we know,the

Marriage is StableTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1266    Accepted Submission(s): 667Special JudgeProblem Descriptio

4337: BJOI2015 树的同构Time Limit: 10 Sec  Memory Limit: 256 MBSubmit: 684  Solved: 282[Submit][Status][Discuss]Description树是一种很常见的数据结构。我们把N个点，N-1条边的连通无向图称为树。若将某个点作为根，从根开始遍历，则其它的点都有一个前驱，

Logical ChainTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 71    Accepted Submission(s): 28Problem DescriptionEvery time yo

Senior PanTime Limit: 12000/6000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 166    Accepted Submission(s): 39Problem DescriptionSenior Pan fail

The Chinese Postman Problem Source : bin3 Time limit : 1 sec Memory limit : 64 M Submitted : 530, Accepted : 177 A Chinese postman is assigned to a small town in China to deliver letters. In t

Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 30907 Accepted: 8438Description"Good man never makes girls wait or breaks an appointme

Hard Life Time Limit: 8000MS Memory Limit: 65536K Total Submissions: 9111 Accepted: 2648 Case Time Limit: 2000MS Special Judge DescriptionJohn is a Chief Executive Officer at a private

Lazy RunningTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 287    Accepted Submission(s): 126Problem DescriptionIn HDU, you h

I Curse MyselfTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 475    Accepted Submission(s): 76Problem DescriptionThere is a c

In TouchTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2302    Accepted Submission(s): 617Problem DescriptionThere are n soda

Peach Blossom SpringTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2808    Accepted Submission(s): 1087Problem Description

RXD and numbersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 40 Accepted Submission(s): 16Problem Description RXD has a sequence A1,A2,

Air RaidTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8127 Accepted: 4865DescriptionConsider a town where all the streets are one-way and each street

find the mincost routeTime Limit: 1000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5648    Accepted Submission(s): 2269Problem Description杭州有

EscapeTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 10116    Accepted Submission(s): 2424Problem Description2012 If this is th

Colorful TreeTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 443    Accepted Submission(s): 155Problem DescriptionThere is a t

I am your Father!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 173    Accepted Submission(s): 37Problem Description> Darth Vad

Destroy WallsTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others) Total Submission(s): 236 Accepted Submission(s): 96Problem Description Long times ago, there are

Degree Sequence of Graph GTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2717 Accepted Submission(s): 1168Problem Description Wang Haiyang

SightseeingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9444 Accepted: 3319DescriptionTour operator Your Personal Holiday organises guided bus trip

Input file: standard inputOutput file: standard output Time limit: 1 secondMemory limit: 512 mebibytesGenerally, ACMers play Werewolf game anywhere when they go out for any programming conte

KindergartenTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6313 Accepted: 3104DescriptionIn a kindergarten, there are a lot of kids. All girls of the

find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6173    Accepted Submission(s): 2644Problem Description

F. Cities Excursions time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output There are n cities in Berland. Some pairs of them are connected with

F. Card Game time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Digital collectible card games have become very popular recently. So Vova dec

1499 图 基准时间限制：2 秒 空间限制：262144 KB 分值: 80 难度：5级算法题 给一个无向图，你要将这些点分成A、B两个集合，使得满足A的导出子图是一个完全图，而B的导出子图是一个没有边的图。 但是事实上你不一定能够做到，所以你允许有错误。我们定义一个完美值为： 1.如果A中两点有边相连，则增加|i-j|的完美值。 2.如果B中两点无边相连，则增加|i-j|的完美值。

D. Lovely Matrix time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Lenny had an n × m matrix of positive integers. He loved the matrix so mu

Counting StarsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 459 Accepted Submission(s): 115Problem Description Little A is an astronomy l

Land of FarmsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 526 Accepted Submission(s): 174 Problem Description Farmer John and his broth

Nowadays a lot of Kejin games (the games which are free to get and play, but some items or characters are unavailable unless you pay for it) appeared. For example, Love Live, Kankore, Puzzle & Dragon,

F. Expected diameter of a tree time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output Pasha is a good student and one of MoJaK’s best friends. He

题目描述Tom最近在研究一个有趣的排序问题。如图所示，通过2个栈S1和S2，Tom希望借助以下4种操作实现将输入序列升序排序。操作a如果输入序列不为空，将第一个元素压入栈S1操作b如果栈S1不为空，将S1栈顶元素弹出至输出序列操作c如果输入序列不为空，将第一个元素压入栈S2操作d如果栈S2不为空，将S2栈顶元素弹出至输出序列如果一个1~n的排列P可以通过一系列操作使得输出序列为1，2，…，(n-1)

Intervals Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 8549 Accepted: 3641 DescriptionYou are given N weighted open intervals. The ith interval covers (ai, bi) and weighs wi.

2597: [Wc2007]剪刀石头布Time Limit: 20 Sec Memory Limit: 128 MBSec Special Judge Submit: 1464 Solved: 663 [Submit][Status][Discuss] Description在一些一对一游戏的比赛（如下棋、乒乓球和羽毛球的单打）中，我们经常会遇到A胜过B，B胜过C而C又胜过A的有趣情况，

G. Shortest Path Problem?time limit per test3 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou are given an undirected graph

I: Colored Graph time limit 1000ms memory limit 131072KB In graph theory, graph colouring is a special case of graph labelling. It is an assignment of labels traditionally called colours to edges

E. Mother of Dragonstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n castles in the Lannister's