C++能过,G++会爆栈,+了扩栈头文件也是这样
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <cstdio>
#include <cmath>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=110000;
struct Edge
{
int v,next;
}edge[maxn*2];
int head[maxn];
int sum[maxn];
int num;
int n;
long long ans;
void addedge(int u,int v)
{
edge[num].v=v;
edge[num].next=head[u];
head[u]=num++;
edge[num].v=u;
edge[num].next=head[v];
head[v]=num++;
}
void dfs(int root,int father)
{
sum[root]=1;
int temp=0;
for(int i=head[root];i!=-1;i=edge[i].next)
{
int v=edge[i].v;
if(v==father)
{
continue;
}
dfs(v,root);
ans+=(long long)temp*sum[v];
sum[root]+=sum[v];
temp+=sum[v];
}
ans+=(long long)temp*(n-sum[root]);
}
int main()
{
int u,v;
while(scanf("%d",&n)!=EOF)
{
num=0;
ans=0;
memset(head,-1,sizeof(head));
for(int i=1;i<n;i++)
{
scanf("%d%d",&u,&v);
addedge(u,v);
}
dfs(1,-1);
long long s=(long long)n*(n-1)*(n-2)/6;//N个选3个
printf("%I64d\n",s-ans);
}
return 0;
}