Family Property (25)解题报告

使用我们的老朋友并查集。

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <set>
#include <algorithm>

using namespace std;

struct family {
	set<int> member;
	int M_estate;
	double area, AveArea, AveSets;
	int parent;
};

void Union(family arr[], int n1, int n2);
bool merge(family arr[], int n1, int n2);
bool comp(family f1, family f2);

int main(void)
{
	int n, i, k, id, father, mother, child, j, cnt;
	family *farr;
	scanf("%d", &n);
	farr = new family[n];
	for (i = 0; i < n; i++) {
		scanf("%d %d %d %d", &id, &father, &mother, &k);
		farr[i].member.insert(id);
		if (father != -1) {
			farr[i].member.insert(father);
		}
		if (mother != -1) {
			farr[i].member.insert(mother);
		}
		for (j = 0; j < k; j++) {
			scanf("%d", &child);
			farr[i].member.insert(child);
		}
		scanf("%d %lf", &farr[i].M_estate, &farr[i].area);
		farr[i].parent = -1;
	}
	cnt = 0;
	for (i = 0; i < n - 1; i++) {
		for (j = i + 1; j < n; j++) {
			if (merge(farr, i, j)) {
				cnt--;
				break;
			}
		}
	}
	cnt += n;
	family *finalarr = new family[cnt];
	for (i = 0, j = 0; i < n; i++) {
		if (farr[i].parent < 0) {
			finalarr[j].member = farr[i].member;
			finalarr[j].area = farr[i].area;
			finalarr[j].M_estate = farr[i].M_estate;
			finalarr[j].AveArea = finalarr[j].area / finalarr[j].member.size();
			finalarr[j].AveSets = (double)finalarr[j].M_estate / finalarr[j].member.size();
			j++;
		}
	}
	sort(finalarr, finalarr + cnt, comp);
	printf("%d\n", cnt);
	for (i = 0; i < cnt; i++) {
		printf("%04d %d %.3lf %.3lf\n", *(finalarr[i].member.begin()), finalarr[i].member.size(), finalarr[i].AveSets, finalarr[i].AveArea);
	}
	return 0;
}

void Union(family arr[], int n1, int n2) {
	arr[n2].member.insert(arr[n1].member.begin(), arr[n1].member.end());
	arr[n2].M_estate += arr[n1].M_estate;
	arr[n2].area += arr[n1].area;
	arr[n1].parent = 1;
	return;
}
bool merge(family arr[], int n1, int n2) {
	set<int>::iterator sit1, sit2;
	sit1 = arr[n1].member.begin();
	sit2 = arr[n2].member.begin();
	while (sit1 != arr[n1].member.end() && sit2 != arr[n2].member.end()) {
		if (*sit1 > *sit2) {
			sit2++;
		}
		else if (*sit1 < *sit2) {
			sit1++;
		}
		else {
			Union(arr, n1, n2);
			return true;
		}
	}
	return false;
}
bool comp(family f1, family f2) {
	if (f1.AveArea > f2.AveArea) {
		return true;
	}
	else if (f1.AveArea < f2.AveArea) {
		return false;
	}
	else {
		if (*f1.member.begin() < *f2.member.begin()) {
			return true;
		}
		else {
			return false;
		}
	}
}