oj.uz

Submission #10938

# Submission time Handle Problem Language Result Execution time Memory
10938 2014-11-12T11:13:43 Z dohyun0324 우호 조약 체결 (JOI14_friends) C++
0 / 100
 1000 ms 8760 KB 
#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;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8236 KB Output is correct
2 Correct 0 ms 8236 KB Output is correct
3 Correct 0 ms 8236 KB Output is correct
4 Incorrect 0 ms 8236 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 8236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 8760 KB Program timed out
2 Halted 0 ms 0 KB -