Bad Cowtractors
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 18255 | Accepted: 7385 |
Description
Bessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already done some surveying, and found M (1 <= M <= 20,000) possible connection routes between pairs of barns. Each possible connection route has an associated cost C (1 <= C <= 100,000). Farmer John wants to spend the least amount on connecting the network; he doesn't even want to pay Bessie.
Realizing Farmer John will not pay her, Bessie decides to do the worst job possible. She must decide on a set of connections to install so that (i) the total cost of these connections is as large as possible, (ii) all the barns are connected together (so that it is possible to reach any barn from any other barn via a path of installed connections), and (iii) so that there are no cycles among the connections (which Farmer John would easily be able to detect). Conditions (ii) and (iii) ensure that the final set of connections will look like a "tree".
Input
* Line 1: Two space-separated integers: N and M
* Lines 2..M+1: Each line contains three space-separated integers A, B, and C that describe a connection route between barns A and B of cost C.
Output
* Line 1: A single integer, containing the price of the most expensive tree connecting all the barns. If it is not possible to connect all the barns, output -1.
Sample Input
5 8
1 2 3
1 3 7
2 3 10
2 4 4
2 5 8
3 4 6
3 5 2
4 5 17
Sample Output
42
Hint
OUTPUT DETAILS:
The most expensive tree has cost 17 + 8 + 10 + 7 = 42. It uses the following connections: 4 to 5, 2 to 5, 2 to 3, and 1 to 3.
Source
思路:
这个题让求最大生成树,把dist和cost数组都设为0,加点时加与上个点距离最大的点,然后更新其他点到这个点的距离,若加的这个点dist是0,且这个点不是第一个点,那就说明这个点到上个点没路,输出-1
要注意的是,输入的时候可能重复给某个边的值,我们保留最大值,因为这个wa两次qwq
方法二:
可以把边转为负值,然后求最小生成树~
代码如下:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<cmath>
using namespace std;
const int INF=0x3f3f3f3f,maxn=1005;
int n,cost[maxn][maxn],vis[maxn],dist[maxn];
int prim(){
memset(vis,0,sizeof(vis));
memset(dist,0,sizeof(dist));
int res=0;
int flag=0;
for(int k=1;k<=n;k++){
int v=-1;
for(int i=1;i<=n;i++){
if(!vis[i]&&(v==-1||dist[i]>dist[v])){
v=i;
}
}
vis[v]=1;
res+=dist[v];
if(v!=1&&dist[v]==0){flag=1;break;}
for(int i=1;i<=n;i++){
dist[i]=max(dist[i],cost[v][i]);
}
}
if(flag)res=-1;
return res;
}
int main(){
int m;
while(scanf("%d%d",&n,&m)!=EOF){
memset(cost,0,sizeof(cost));
int a,b,c;
while(m--){
scanf("%d%d%d",&a,&b,&c);
if(c>cost[a][b]){
cost[a][b]=c;
cost[b][a]=c;
}
}
int res=prim();
printf("%d\n",res);
}
}
方法二代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<cmath>
using namespace std;
const int INF=0x3f3f3f3f,maxn=1005;
int n,cost[maxn][maxn],vis[maxn],dist[maxn];
int prim(){
memset(vis,0,sizeof(vis));
memset(dist,INF,sizeof(dist));
int res=0;
dist[1]=0;
for(int k=1;k<=n;k++){
int v=-1;
for(int i=1;i<=n;i++){
if(!vis[i]&&(v==-1||dist[i]<dist[v])){
v=i;
}
}
vis[v]=1;
res+=dist[v];
for(int i=1;i<=n;i++){
dist[i]=min(dist[i],cost[v][i]);
}
}
res=-res;
if(res<=0)res=-1;
return res;
}
int main(){
int m;
while(scanf("%d%d",&n,&m)!=EOF){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==j)cost[i][j]=0;
else cost[i][j]=INF;
}
}
int a,b,c;
while(m--){
scanf("%d%d%d",&a,&b,&c);
if(c>-cost[a][b]){
cost[a][b]=-c;
cost[b][a]=-c;
}
}
int res=prim();
printf("%d\n",res);
}
}