poj 1861 Networks
2012-09-27 19:12
274 查看
Special judge 搞了我查了N久。
CODE:
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int M = 5001;
const int INF = 0x3f3f3f3f;
int u[4*M], v[4*M], w[4*M];
int p[M], r[4*M];
int n, m, cnt;
int su[4*M], sv[4*M];
int find(int x)
{
return x == p[x]? x : p[x] = find(p[x]);
}
int cmp(const int i, const int j)
{
return w[i] < w[j];
}
int Kruskal()
{
int ans = -INF;
for(int i = 0; i < n; i++) p[i] = i;
for(int i = 0; i < m; i++) r[i] = i;
sort(r, r+m, cmp);
for(int i = 0; i < m; i++)
{
int e = r[i]; int x = find(u[e]); int y = find(v[e]);
if(x != y)
{
ans = max(ans, w[e]);
su[cnt] = u[e], sv[cnt++] = v[e];
p[x] = y;
}
}
return ans;
}
void init()
{
cnt = 0;
memset(su, 0, sizeof(su));
memset(sv, 0, sizeof(sv));
}
int main()
{
while(~scanf("%d%d", &n, &m))
{
init();
for(int i = 0; i < m; i++)
{
scanf("%d%d%d", &u[i], &v[i], &w[i]);
}
int ans = Kruskal();
printf("%d\n", ans);
printf("%d\n", cnt);
for(int i = 0; i < cnt; i++)
{
printf("%d %d\n", su[i], sv[i]);
}
}
return 0;
}
CODE:
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int M = 5001;
const int INF = 0x3f3f3f3f;
int u[4*M], v[4*M], w[4*M];
int p[M], r[4*M];
int n, m, cnt;
int su[4*M], sv[4*M];
int find(int x)
{
return x == p[x]? x : p[x] = find(p[x]);
}
int cmp(const int i, const int j)
{
return w[i] < w[j];
}
int Kruskal()
{
int ans = -INF;
for(int i = 0; i < n; i++) p[i] = i;
for(int i = 0; i < m; i++) r[i] = i;
sort(r, r+m, cmp);
for(int i = 0; i < m; i++)
{
int e = r[i]; int x = find(u[e]); int y = find(v[e]);
if(x != y)
{
ans = max(ans, w[e]);
su[cnt] = u[e], sv[cnt++] = v[e];
p[x] = y;
}
}
return ans;
}
void init()
{
cnt = 0;
memset(su, 0, sizeof(su));
memset(sv, 0, sizeof(sv));
}
int main()
{
while(~scanf("%d%d", &n, &m))
{
init();
for(int i = 0; i < m; i++)
{
scanf("%d%d%d", &u[i], &v[i], &w[i]);
}
int ans = Kruskal();
printf("%d\n", ans);
printf("%d\n", cnt);
for(int i = 0; i < cnt; i++)
{
printf("%d %d\n", su[i], sv[i]);
}
}
return 0;
}
相关文章推荐
- POJ 1861 Networks
- POJ 1861 Networks 最小生成树 Kruskal+并查集
- POJ 1861 Networks 最小生成树 Kruskal+并查集
- POJ 1861 Network (Kruskal算法+输出的最小生成树里最长的边==最后加入生成树的边权 *【模板】)
- POJ 1861 最小生成树最大的边及记录
- POJ1861 Network
- poj2799 IP Networks
- poj - 2799 UVA - 1590 IP Networks
- zoj 1542 || poj 1861 Network(MST = = Kruskal~)
- pojn 1861 Network(Kruskal)
- POJ1861-Network(Kruskal)
- POJ 1861 Network (模版kruskal算法)
- POJ 1861 ——Network——————【最小瓶颈生成树】
- network 最小生成树 Kruskal 算法 poj 1861 zoj 1542
- 最小瓶颈生成树(poj 1861)
- poj 1861 Network 解题报告
- poj 2799 IP Networks 模拟 位运算
- POJ 1861最小瓶颈树wa
- [poj] 1236 networks of schools
- ZOJ1542 POJ1861