这道题知识点融合得比较多,还是有点烦的。自己一开始把num设置成了double,检查的时候cout没错,就是printf(“%d”)是一大串😂。改了半天,,,
// 7:26
#include <bits/stdc++.h>
using namespace std;
int fa[10010];
bool vis[10000];
struct DATA {
int id, num, area;
}data[10010];
struct node {
set<int> st;
int id, people, num;
double area;
};
vector<int> v;
vector<node> ans;
unordered_map<int, node> mp;
bool cmp (node a, node b) {
double aArea = (a.area * 1.0) / a.st.size();
double bArea = (b.area * 1.0) / b.st.size();
if (aArea != bArea) return aArea > bArea;
return *a.st.begin() < *b.st.begin();
}
int findFather(int a) {
int x = a;
while (a != fa[a]) {
a = fa[a];
}
while (x != fa[x]) {
int z = x;
x = fa[x];
fa[z] = a;
}
return a;
}
void Union (int a, int b) {
int faA = findFather(a);
int faB = findFather(b);
if (faA != faB) {
fa[faB] = faA;
}
}
void init() {
for (int i = 0; i < 10000; i++) {
fa[i] = i;
}
}
int main() {
int n, id, fa, ma, k, child, m, area;
init();
scanf ("%d", &n);
for (int i = 0; i < n; i++) {
scanf ("%d %d %d %d", &id, &fa, &ma, &k);
if (fa != -1) {
Union(id, fa);
v.push_back(fa);
}
if (ma != -1) {
Union(id, ma);
v.push_back(ma);
}
for (int j = 0; j < k; j++) {
scanf ("%d", &child);
Union(id, child);
v.push_back(child);
}
scanf ("%d %d", &m, &area);
data[id] = DATA({id, m, area});
v.push_back(id);
}
for (auto it : v) {
if (vis[it] == false) {
int root = findFather(it);
mp[root].st.insert(it);
mp[root].num += data[it].num;
mp[root].area += data[it].area;
vis[it] = true;
}
}
for (auto it : mp) {
ans.push_back(it.second);
}
sort (ans.begin(), ans.end(), cmp);
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
printf ("%04d %d %.3lf %.3lf\n", *ans[i].st.begin(), ans[i].st.size(), (1.0 * ans[i].num) / ans[i].st.size(), (1.0 * ans[i].area) / ans[i].st.size());
}
}
最后一行输出,懒得再声明变量了,所以就将就着看吧。要想简洁一点可以在外面算好了再输出。