之前天梯赛选拔的时候做过这题,中文,当时对于并查集掌握的很差,看了题解才写出来。这次由于很久没接触并查集,很多东西都忘了,靠记忆拼出了一部分代码,果然只过了一个点,找了一晚上的错误,原来是计数计漏了。。。。。
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string.h>
using namespace std;
typedef struct Node{
int id, m_estate, area;
}Node;
typedef struct SNode{
int id, cnt = 1, flag = 0, m;
double area,avearea;
}SNode;
const int maxn = 1e5+8;
Node node[maxn];
SNode snode[maxn];
int father[maxn], vis[maxn];
bool cmp(SNode a, SNode b){
return a.flag != b.flag ? a.flag>b.flag : a.avearea != b.avearea ? a.avearea > b.avearea : a.id < b.id;
}
void init(){
for(int i = 0; i<10000; i++)
father[i] = i;
}
int findF(int x){
if(father[x] != x) father[x] = findF(father[x]);
return father[x];
}
void join(int a, int b){
int fa = findF(a);
int fb = findF(b);
if(fa > fb) father[fa] = fb; //注意是fa而不是a
else father[fb] = fa; //注意是fb而不是b
}
int main(){
//freopen("in.txt", "r", stdin);
init();
int n, i, j, id, childid, childnum, fa, ma, cnt = 0;
scanf("%d", &n);
for(i = 0; i<n; i++){
scanf("%d %d %d %d", &node[i].id, fa, ma, childnum);
if(fa != -1) join(node[i].id, fa);
if(ma != -1) join(node[i].id, ma);
for(j = 0; j<childnum; j++){
scanf("%d", &childid);
join(node[i].id, childid);
}
scanf("%d%d", &node[i].m_estate, &node[i].area);
}
for(i = 0; i<n; i++){
int f = findF(node[i].id);
snode[f].id = f;
snode[f].flag = 1;
if(!vis[f]) cnt++;
snode[f].m += node[i].m_estate;
snode[f].area += node[i].area;
snode[f].avearea = snode[f].area/snode[f].cnt;
if(vis[f]) continue; //保证只计算一次人数
int total = 0;
for(int j = 0; j<10000; j++)
if(findF(j) == f) total++;
snode[f].cnt = total;
snode[f].avearea = snode[f].area/snode[f].cnt;
vis[f] = 1;
}
sort(snode, snode+maxn, cmp);
printf("%d\n", cnt);
for(i = 0; i<cnt; i++)
printf("%04d %d %.3lf %.3lf\n", snode[i].id, snode[i].cnt, snode[i].m*1.0/snode[i].cnt, snode[i].area*1.0/snode[i].cnt);
return 0;
}
原来版本:
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string.h>
using namespace std;
typedef struct Node{
int id, fa, ma, childnum, m_estate, area;
vector<int> child;
}Node;
typedef struct SNode{
int id, cnt, flag = 0;
int m;
double area,avearea;
}SNode;
const int maxn = 1e5+8;
Node node[maxn];
SNode snode[maxn];
int father[maxn], vis[maxn];
bool cmp(SNode a, SNode b){
return a.flag != b.flag ? a.flag>b.flag : a.avearea != b.avearea ? a.avearea > b.avearea : a.id < b.id;
}
void init(){
for(int i = 0; i<10000; i++)
father[i] = i;
}
int findF(int x){
if(father[x] != x) father[x] = findF(father[x]);
return father[x];
}
void join(int a, int b){
int fa = findF(a);
int fb = findF(b);
if(fa > fb) father[fa] = fb; //注意是fa而不是a
else if(fa < fb) father[fb] = fa; //注意是fb而不是b
}
int main(){
//freopen("in.txt", "r", stdin);
init();
int n, i, j, id, childid, cnt = 0;
scanf("%d", &n);
for(i = 0; i<n; i++){
scanf("%d %d %d %d", &node[i].id, &node[i].fa, &node[i].ma, &node[i].childnum);
if(node[i].fa != -1) join(node[i].id, node[i].fa);
if(node[i].ma != -1) join(node[i].id, node[i].ma);
for(j = 0; j<node[i].childnum; j++){
scanf("%d", &childid);
join(node[i].id, childid);
node[i].child.push_back(childid);
}
scanf("%d%d", &node[i].m_estate, &node[i].area);
}
memset(vis, 0, sizeof vis);
for(i = 0; i<n; i++){
int f = findF(node[i].id);
if(!vis[f]){
snode[f].id = f;
snode[f].flag = 1;
snode[f].cnt++;
cnt++;
vis[f] = 1;
}
if(!vis[node[i].id]){
vis[node[i].id] = 1;
snode[f].cnt++;
}//不要忘了自身!!!!顺序应该vis[f]之后
if(node[i].fa != -1 && !vis[node[i].fa]) {
snode[f].cnt++;
vis[node[i].fa] = 1;
}
if(node[i].ma != -1 && !vis[node[i].ma]) {
snode[f].cnt++;
vis[node[i].ma] = 1;
}
for(j = 0; j<node[i].childnum; j++){
if(!vis[node[i].child[j]]) {
snode[f].cnt++;
vis[node[i].child[j]] = 1;
}
}
snode[f].m += node[i].m_estate;
snode[f].area += node[i].area;
snode[f].avearea = snode[f].area/snode[f].cnt;
}
sort(snode, snode+maxn, cmp);
printf("%d\n", cnt);
for(i = 0; i<cnt; i++)
printf("%04d %d %.3lf %.3lf\n", snode[i].id, snode[i].cnt, snode[i].m*1.0/snode[i].cnt, snode[i].area*1.0/snode[i].cnt);
return 0;
}