oj.uz

Submission #14709

# Submission time Handle Problem Language Result Execution time Memory
14709 2015-06-11T08:54:59 Z gs14004 우호 조약 체결 (JOI14_friends) C++14
0 / 100
 111 ms 9556 KB 
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;

struct disj{
    int pa[100005], sz[100005];
    void init(int n){
        for(int i=1; i<=n; i++) pa[i] = i, sz[i] = 1;
    }
    int find(int x){
        if(pa[x] == x) return x;
        return pa[x] = find(pa[x]);
    }
    int size(int x){
        return sz[find(x)];
    }
    int uni(int p, int q){
        p = find(p);
        q = find(q);
        if(p == q) return 0;
        pa[q] = p;
        sz[p] += sz[q];
        return 1;
    }
}disj;

bool vis[100005];
int n,m;
vector<int> g[100005], ng[100005];
queue<int> q;

int main(){
    scanf("%d %d",&n,&m);
    disj.init(n);
    for (int i=0; i<m; i++) {
        int x,y;
        scanf("%d %d",&x,&y);
        g[x].push_back(y);
    }
    for (int i=1; i<=n; i++) {
        for (int j=0; j+1<g[i].size(); j++) {
            disj.uni(g[i][j],g[i][j+1]);
        }
    }
    for (int i=1; i<=n; i++) {
        int pos = i;
        if(disj.size(i) == 1) continue;
        while (!vis[pos]) {
            vis[pos] = 1;
            if(!g[pos].empty() && disj.size(pos) != 1 && !vis[g[pos][0]]){
                disj.uni(g[pos][0],pos);
                pos = g[pos][0];
            }
        }
    }
    long long ret = 0;
    memset(vis,0,sizeof(vis));
    for (int i=1; i<=n; i++) {
        if(!vis[disj.find(i)]){
            vis[disj.find(i)] = 1;
            ret += 1ll * disj.size(i) * (disj.size(i) - 1);
        }
    }
    for (int i=1; i<=n; i++) {
        for (int &j : g[i]){
            if(disj.find(i) != disj.find(j)) ret++;
        }
    }
    printf("%lld",ret);
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6784 KB Output is correct
2 Correct 0 ms 6784 KB Output is correct
3 Correct 2 ms 6784 KB Output is correct
4 Correct 0 ms 6784 KB Output is correct
5 Correct 0 ms 6784 KB Output is correct
6 Correct 2 ms 6784 KB Output is correct
7 Correct 0 ms 6784 KB Output is correct
8 Correct 0 ms 6784 KB Output is correct
9 Correct 2 ms 6784 KB Output is correct
10 Correct 0 ms 6784 KB Output is correct
11 Incorrect 2 ms 6784 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0.0 / 30.0

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

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 7840 KB Output is correct
2 Incorrect 111 ms 9556 KB Output isn't correct
3 Halted 0 ms 0 KB -