swust_fang

Sightseeing trip Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5698 Accepted: 2203 Special Judge DescriptionThere is a travel agency in Adelton town on Zanzibar island. It

D. Directed Roadstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon has explored Uday

D. Complete The Graphtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder has drawn an undirected

The Best PathTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 924    Accepted Submission(s): 383Problem DescriptionAlice is plann

题意：给一个有向图，求一个结点数最大的结点集，使得该结点集中任意两个结点u和v满足：要么u可以到达v，要么v可以到达u（u和v相互可达也可以）。解法：可以发现的是，在同一个强连通分量里面的点要么都选，要么都不选。把强连通分量缩点重新建图后得到一个有向无环图，每个点代表一个强连通分量，新图的每个点有点权，点权为缩点后这个点的强连通分量有几个点。           然后问题就转化成在一个有向

题意：有向无环图，给n个点，给一个起点，给许多条有向边（输入到0，0，每条边边权为1）。求从起点出发，最远能走到多远。记录起点到最远那个点的距离以及点坐标。我的做法：1.dfs+剪枝，记录一个深度，记录最大深度和对应坐标就行了。不过就这样dfs的话会TLE，需要记录从起点到每个点的最远距离，如果跑过来的距离小于之前到达这个点的距离，就不跑了。2.spfa，一直往大的更新就行了。

D. Hamiltonian Spanning Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA group of n cities is connect

C. Journeytime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Irina arrived to one of the most famous

Counting CliquesTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 622    Accepted Submission(s): 235Problem DescriptionA clique is

Sparse GraphTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1138    Accepted Submission(s): 408Problem DescriptionIn graph the

题意：一个最大为2000*2000的矩阵，有h个横着的单词，v个竖着单词，横着的可能与竖着的有交叉，交叉的字符只能选其一放在格子内，问怎样选择才能使矩阵内单词的数量最多，输出最多有多少个。（注意同一行的单词不会有交叉）解法：最大独立集，因为横着的与横着不会有交叉，竖着的没有，所以可以把横着的单词放在一边，竖着的放在另一边，横着的与竖着的交叉点是不同字母的进行连边。跑一遍二分匹配，每一个匹配

How far away ？Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10580    Accepted Submission(s): 3851Problem DescriptionThere are

2478: 最短路问题Time Limit:5000MS Memory Limit:65536KBTotal Submit:24 Accepted:4 Page View:387Submit Status DiscussDescription现在有n个城市，编号从1到n。现在已知从城市i到城市j需要走的时间为aij。M78要从城市1到城市n。M78有一个飞行

题意：然后给定这个矩阵，然后让你构造a序列。理解：每个符号表示的Bij = ai+.....+aj,那么可以写成前缀和相减的形式，前缀和用S表示，则B[ij] = S[j]-S[i-1]； 由那个矩阵可以得出   S[j]-S[i-1] > 0;    S[j]-S[i-1] 如果要满足 S[j]-S[i-1] > 0  ，则可以使 S[j]

E. Bear and Forgotten Tree 2time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tree is a connected undirect

Play on WordsTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7004    Accepted Submission(s): 2366Problem DescriptionSome of the

题意：给n个珠子，每个珠子有2种颜色，把所有珠子连成一个环，连接规则是2个珠子的连接处颜色必须相同，每种颜色用数字表示理解：直接联想哈密顿回路，不科学，写不来。联想之前做的单词那个题（点击打开链接，这个讲的比较详细），然后果断欧拉回路，只不过那个是有向图，这个是无向图，并且输出路径。方便看我还是贴出来吧首先是几个概念：欧拉回路　图中经过每

E. Connecting Universitiestime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTreeland is a country in which t

Machine ScheduleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8191    Accepted Submission(s): 4094Problem DescriptionAs we all

Coding ContestTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1035    Accepted Submission(s): 189Problem DescriptionA coding con