This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
#include<vector>
using namespace std;
vector<int>con[200010];
int n,m,x[100010],y[100010],group[100010],ranking[100010],cnt[100010],ch[100010];
long long dap;
int finding(int x)
{
if(x==group[x]) return x;
return finding(group[x]);
}
void union_find(int x,int y)
{
int p,q;
p=finding(x);
q=finding(y);
if(ranking[x]==ranking[y])
{
group[y]=x;
ranking[x]++;
}
else if(ranking[x]>ranking[y]) group[y]=x;
else group[x]=y;
}
int main()
{
int i,j,k;
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++) group[i]=i;
for(i=1;i<=m;i++)
{
scanf("%d %d",&x[i],&y[i]);
con[x[i]].push_back(y[i]);
}
for(i=1;i<=n;i++)
{
k=con[i].size();
for(j=0;j<k-1;j++)
{
union_find(con[i][j],con[i][j+1]);
ch[con[i][j]]=1;
}
if(j>0) ch[con[i][j]]=1;
}
for(i=1;i<=n;i++)
{
if(ch[i] && con[i].size())
{
union_find(i,con[i][0]);
}
}
for(i=1;i<=n;i++)
{
group[i]=finding(i);
cnt[group[i]]++;
}
for(i=1;i<=n;i++)
{
dap+=(long long)cnt[i]*(long long)(cnt[i]-1);
}
for(i=1;i<=m;i++)
{
if(group[x[i]]!=group[y[i]]) dap++;
}
printf("%lld",dap);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |