oj.uz

Submission #14704

# Submission time Handle Problem Language Result Execution time Memory
14704 2015-06-11T08:18:13 Z gs14004 우호 조약 체결 (JOI14_friends) C++14
35 / 100
 1000 ms 9548 KB 
#include <cstdio>
#include <vector>
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 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];

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]); // now it's a permutation graph
        }
    }
    for (int t=0; t<=n; t++) {
    for (int i=1; i<=n; i++) {
        if(disj.sz[disj.find(i)] != 1 && !g[i].empty()){
            disj.uni(i,g[i][0]);
        }
    }
    }
    long long ret = 0;
    for (int i=1; i<=n; i++) {
        if(!vis[disj.find(i)]){
            vis[disj.find(i)] = 1;
            ret += 1ll * disj.sz[disj.find(i)] * (disj.sz[disj.find(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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6780 KB Output is correct
2 Correct 0 ms 6780 KB Output is correct
3 Correct 0 ms 6780 KB Output is correct
4 Correct 0 ms 6780 KB Output is correct
5 Correct 2 ms 6780 KB Output is correct
6 Correct 0 ms 6780 KB Output is correct
7 Correct 2 ms 6780 KB Output is correct
8 Correct 0 ms 6780 KB Output is correct
9 Correct 2 ms 6780 KB Output is correct
10 Correct 0 ms 6780 KB Output is correct
11 Correct 0 ms 6780 KB Output is correct
12 Correct 2 ms 6780 KB Output is correct
13 Correct 2 ms 6780 KB Output is correct
14 Correct 2 ms 6780 KB Output is correct
15 Correct 0 ms 6780 KB Output is correct
16 Correct 0 ms 6780 KB Output is correct
17 Correct 0 ms 6780 KB Output is correct
18 Correct 0 ms 6780 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 6780 KB Output is correct
2 Correct 116 ms 6780 KB Output is correct
3 Correct 224 ms 6912 KB Output is correct
4 Correct 301 ms 7704 KB Output is correct
5 Correct 294 ms 7440 KB Output is correct
6 Correct 332 ms 8100 KB Output is correct
7 Correct 6 ms 6780 KB Output is correct
8 Correct 14 ms 6780 KB Output is correct
9 Correct 19 ms 6912 KB Output is correct
10 Correct 268 ms 7044 KB Output is correct
11 Correct 327 ms 8100 KB Output is correct
12 Correct 212 ms 6912 KB Output is correct
13 Correct 246 ms 6780 KB Output is correct
14 Correct 258 ms 6780 KB Output is correct
15 Correct 249 ms 6780 KB Output is correct
16 Correct 254 ms 7044 KB Output is correct
17 Correct 347 ms 7968 KB Output is correct
18 Correct 42 ms 6912 KB Output is correct
19 Correct 203 ms 6912 KB Output is correct
20 Correct 374 ms 8100 KB Output is correct
21 Correct 272 ms 6780 KB Output is correct
22 Correct 270 ms 6780 KB Output is correct
23 Correct 245 ms 6912 KB Output is correct
24 Correct 209 ms 6780 KB Output is correct
25 Correct 40 ms 6912 KB Output is correct
26 Correct 223 ms 6780 KB Output is correct
27 Correct 42 ms 6912 KB Output is correct
28 Correct 273 ms 6780 KB Output is correct

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 7836 KB Output is correct
2 Execution timed out 1000 ms 9548 KB Program timed out
3 Halted 0 ms 0 KB -