mowayao的专栏

Problem B: The Largest Clique Given a directed graph G, consider the following transformation. First, create a new graph T(G) to have the same vertex set as G. Create a directed edge between two ve

Road Construction Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 8652   Accepted: 4323 Description It's almost summer time, and that means that it's almost

Get Luffy Out Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 7456   Accepted: 2835 Description Ratish is a young man who always dreams of being a hero. One

Ikki's Story IV - Panda's Trick Time Limit: 1000MS   Memory Limit: 131072K Total Submissions: 7841   Accepted: 2900 Description liympanda, one of Ikki’s friend, likes p

Going from u to v or from v to u? Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 14474   Accepted: 3804 Description In order to make their sons brave, Jiaji

题意：n个城市(n 思路：首先边的费用可以通过Tarjan求桥之后求得(利用桥的性质)，然后就是二分答案了！对于每个点，如果有个儿子不能维护，那么不可行，否则，试着让儿子去维护边权，如果不可行，只能让父亲承担。 #include #include #include #include #include #include #include #include #include u