ACM之路

#include <iostream>#include <cstring>#include <stdio.h>#include <stack>#include <vector>#include <string>#include <algorithm>#include <vector>#i...

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++)#define per(i

CoursesTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5083    Accepted Submission(s): 2444Problem DescriptionConsider a group

1. 最小路径覆盖等于 = 图的点数 - 最大匹配.一个点是一条路径。 开始有图的点数个路径，增加一个匹配（也就是一条边）  路径数-1。匹配： 从X出发最多一条边,从Y进入最多一条边。路径覆盖： 一个点出发最多一条边，一个点进入最多一条边。 所以这个点即在X也在Y。  自己X到自己Y不建立边。

1. 最小生成树是找和树 最近的， 而单源最短路是找和树根 最近的。2. 最小生成树的起点是任意的, 而单源最短路的起点是给定的。

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++)#define per(i

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //hdu4378 #define rep(i,a,n) for (int i=a;i<n;i++)#

void tarjan (int u, int x) { DFN[u] = low[u] = ++ord; instack[u] = 1; st[top++] = u; for (int i = head[u]; ~i; i = edge[i].next) { int v = edge[i].to;

Redundant PathsTime Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)Submit StatusIn order to get from one of the F(1≤F≤5,000) grazing fields (whic

Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13509 Accepted: 5392DescriptionA number of schools are connected to a computer netwo

Warm upTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 4971    Accepted Submission(s): 1105Problem Description　　N planets are c

Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 22990 Accepted: 8299DescriptionSeveral currency exchange points are working in our ci

WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 36771 Accepted: 13465DescriptionWhile exploring his many farms, Farmer John has discovered a

MPI MaelstromTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6623 Accepted: 4102DescriptionBIT has recently taken delivery of their new supercomputer,

bool dfs(int u){ for(int i=1;i<=n;i++) { if(!used[i] && g[u][i]) { used[i] = true; if(Left[i] == -1 || dfs(Left[i])) { Left[i] = u; return true; } } } return false;}in

FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30627 Accepted: 9880DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Sudde

Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 35962 Accepted: 12222DescriptionBessie is out in the field and wants to get back

e

Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 24503 Accepted: 6505DescriptionBackground Hugo Heavy is happy. After the breakdo

Transfer waterTime Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 4420    Accepted Submission(s): 1567Problem DescriptionXiaoA lives

Language:DefaultConstructing RoadsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20991 Accepted: 8869DescriptionThere are N villages, which are n

NetworkingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7413 Accepted: 4038DescriptionYou are assigned to design network connections between certain

昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 41108 Accepted: 11977Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿

ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18012 Accepted: 7616DescriptionArbitrage is the use of discrepancies in currency exchange rat

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++)#define per(i

PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBDhaka city is getting crowded and noisy day by day. Certain roads always remain blocked in con

SubwayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7252 Accepted: 2362DescriptionYou have just moved from a quiet Waterloo neighbourhood to a big,

Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8371 Accepted: 4719DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are partici

LayoutTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8651 Accepted: 4165DescriptionLike everyone else, cows like to stand close to their friends when

TramTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 12064 Accepted: 4399DescriptionTram network in Zagreb consists of a number of intersections and ra

The Shortest Path in Nya GraphTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3874    Accepted Submission(s): 911Problem Description

CandiesTime Limit: 1500MS Memory Limit: 131072KTotal Submissions: 25849 Accepted: 7059DescriptionDuring the kindergarten days, flymouse was the monitor of his

Jungle RoadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21628 Accepted: 10000DescriptionThe Head Elder of the tropical island of Lagrishan has

Language:DefaultTruck HistoryTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 21992 Accepted: 8534DescriptionAdvanced Cargo Movement, Ltd. uses tru

畅通工程再续Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20452    Accepted Submission(s): 6442Problem Description相信大家都听说一个“百岛湖”的地方吧

HighwaysTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11244 Accepted: 3206 Special JudgeDescriptionThe island nation of Flatopia is perfectly flat

QS NetworkTime Limit: 2 Seconds      Memory Limit: 65536 KBSunny Cup 2003 - Preliminary RoundApril 20th, 12:00 - 17:00Problem E: QS NetworkIn the planet w-503 of galaxy cgb, there

Language:DefaultAgri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 45583 Accepted: 18748DescriptionFarmer John has been elected mayor of his

还是畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33080 Accepted Submission(s): 14922Problem Description某省调查乡村交通状况，得到的统计表中列出了任意两村庄

Language:DefaultBuilding a Space StationTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5916 Accepted: 2938DescriptionYou are a member of the spac