oj.uz

답안 #1087867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1087867 2024-09-13T10:38:21 Z alexander707070 철인 이종 경기 (APIO18_duathlon) C++14
71 / 100
 81 ms 28076 KB 
#include<bits/stdc++.h>
#define MAXN 200007
using namespace std;

long long n,m,a[MAXN],b[MAXN],k;

vector< pair<int,int> > v[MAXN];
vector<int> tree[MAXN];

long long sz[MAXN],sum[MAXN],szcomp[MAXN],ans;

bool li[MAXN],bridge[MAXN];
int dp[MAXN],low[MAXN];

long long comp[MAXN],where[MAXN];

void bcc(int x,int p,int dep,int edge){
    li[x]=true; dp[x]=low[x]=dep;

    for(int i=0;i<v[x].size();i++){
        if(!li[v[x][i].first]){
            bcc(v[x][i].first,x,dep+1,v[x][i].second);
            low[x]=min(low[x],low[v[x][i].first]);
        }else if(v[x][i].first!=p){
            low[x]=min(low[x],dp[v[x][i].first]);
        }
    }

    if(p!=0 and low[x]==dp[x]){
        bridge[edge]=true;
    }
}

void mark(int x){
    comp[k]++;
    where[x]=k;
    li[x]=true;

    for(int i=0;i<v[x].size();i++){
        if(li[v[x][i].first] or bridge[v[x][i].second])continue;
        mark(v[x][i].first);
    }
}

void dfs(int x,int p){
    sz[x]=comp[x];

    for(int i=0;i<tree[x].size();i++){
        if(tree[x][i]==p or sz[tree[x][i]]!=0)continue;
        dfs(tree[x][i],x);

        sum[x]+=sz[tree[x][i]]*(sz[tree[x][i]]-1);
        sz[x]+=sz[tree[x][i]];
    }
}

void dfs2(int x,int p,int s){
    szcomp[x]=s;

    for(int i=0;i<tree[x].size();i++){
        if(tree[x][i]==p or szcomp[tree[x][i]]!=0)continue;
        dfs2(tree[x][i],x,s);
    }

    sum[x]+=(s-sz[x])*(s-sz[x]-1);
}

queue<int> q;
bool vis[MAXN];
int par[MAXN];

void dobfs(int x){
    for(int i=1;i<=n;i++)li[i]=false;

    q.push(x); par[x]=0;
    li[x]=true;

    while(!q.empty()){
        int curr=q.front();
        q.pop();

        for(int i=0;i<v[curr].size();i++){
            if(li[v[curr][i].first] or vis[v[curr][i].first])continue;

            q.push(v[curr][i].first);
            li[v[curr][i].first]=true;
            par[v[curr][i].first]=curr;
        }
    }    
}

bool check(int x,int y,int z){
    for(int i=1;i<=n;i++)vis[i]=false;

    dobfs(x);

    if(!li[y])return false;

    int w=y;
    while(y!=x){
        y=par[y];
        vis[y]=true;
    }

    if(vis[z])return false;

    dobfs(z);

    return li[w];
}

void brute(){
    int res=0;

    for(int i=1;i<=n;i++){
        for(int f=1;f<=n;f++){
            for(int t=1;t<=n;t++){
                if(i==f or f==t or i==t)continue;

                if(check(i,f,t) or check(t,f,i))res++;
            }
        }
    }

    cout<<res<<"\n";
}

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>a[i]>>b[i];
        v[a[i]].push_back({b[i],i});
        v[b[i]].push_back({a[i],i});
    }

    if(n<=50){
        brute();
        return 0;
    }

    for(int i=1;i<=n;i++){
        if(!li[i])bcc(i,0,0,0);
    }

    for(int i=1;i<=n;i++)li[i]=false;

    for(int i=1;i<=n;i++){
        if(!li[i]){
            k++; mark(i);
        }
    }

    for(int i=1;i<=m;i++){
        if(where[a[i]]==where[b[i]])continue;

        tree[where[a[i]]].push_back(where[b[i]]);
        tree[where[b[i]]].push_back(where[a[i]]);
    }

    for(int i=1;i<=k;i++){
        if(sz[i]==0){
            dfs(i,0);
            dfs2(i,0,sz[i]);
        }
    }

    for(int i=1;i<=k;i++){
        ans+=(long long) comp[i]*((szcomp[i]-1)*(szcomp[i]-2)-sum[i]);
        ans-=(long long) 2*(comp[i]-1)*(szcomp[i]-comp[i]);
    }

    for(int i=1;i<=n;i++){
        long long res=0,sq=0;

        for(int f=0;f<v[i].size();f++){
            if(where[i]==where[v[i][f].first])continue;
            
            if(sz[where[i]]>sz[where[v[i][f].first]]){
                res+=sz[where[v[i][f].first]];
                sq+=(sz[where[v[i][f].first]]-1)*sz[where[v[i][f].first]];
            }else{
                res+=(szcomp[where[i]]-sz[where[i]]);
                sq+=(szcomp[where[i]]-sz[where[i]])*(szcomp[where[i]]-sz[where[i]]-1);
            }
        }

        res=res*(res-1);
        res-=sq;

        ans-=(long long) (comp[where[i]]-1)*res;
    }

    cout<<ans<<"\n";

    return 0;
}

/**
 19 24
1 2
2 3
3 4
4 1
5 6
6 7
7 5
8 9
9 10
10 8
11 12
12 13
13 11
14 15
15 16
16 14
17 18
18 19
17 19
7 8
4 5
7 11
13 17
12 14
 */

Compilation message

count_triplets.cpp: In function 'void bcc(int, int, int, int)':
count_triplets.cpp:20:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
count_triplets.cpp: In function 'void mark(int)':
count_triplets.cpp:39:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
count_triplets.cpp: In function 'void dfs(int, int)':
count_triplets.cpp:48:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int i=0;i<tree[x].size();i++){
      |                 ~^~~~~~~~~~~~~~~
count_triplets.cpp: In function 'void dfs2(int, int, int)':
count_triplets.cpp:60:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for(int i=0;i<tree[x].size();i++){
      |                 ~^~~~~~~~~~~~~~~
count_triplets.cpp: In function 'void dobfs(int)':
count_triplets.cpp:82:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |         for(int i=0;i<v[curr].size();i++){
      |                     ~^~~~~~~~~~~~~~~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:180:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  180 |         for(int f=0;f<v[i].size();f++){
      |                     ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9816 KB Output is correct
2 Correct 7 ms 9692 KB Output is correct
3 Correct 7 ms 9820 KB Output is correct
4 Correct 5 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9816 KB Output is correct
7 Correct 5 ms 9820 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 5 ms 9820 KB Output is correct
10 Correct 7 ms 9816 KB Output is correct
11 Correct 4 ms 9820 KB Output is correct
12 Correct 5 ms 9864 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 4 ms 9816 KB Output is correct
15 Correct 5 ms 9820 KB Output is correct
16 Correct 5 ms 9728 KB Output is correct
17 Correct 4 ms 9796 KB Output is correct
18 Correct 5 ms 9820 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 4 ms 9820 KB Output is correct
21 Correct 5 ms 9868 KB Output is correct
22 Correct 4 ms 9816 KB Output is correct
23 Correct 4 ms 9816 KB Output is correct
24 Correct 4 ms 9816 KB Output is correct
25 Correct 4 ms 9816 KB Output is correct
26 Correct 4 ms 9856 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 4 ms 9820 KB Output is correct
29 Correct 4 ms 9820 KB Output is correct
30 Correct 4 ms 9820 KB Output is correct
31 Correct 5 ms 9820 KB Output is correct
32 Correct 4 ms 9820 KB Output is correct
33 Correct 6 ms 9840 KB Output is correct
34 Correct 6 ms 9820 KB Output is correct
35 Correct 4 ms 9820 KB Output is correct

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9816 KB Output is correct
2 Correct 7 ms 9692 KB Output is correct
3 Correct 7 ms 9820 KB Output is correct
4 Correct 5 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9816 KB Output is correct
7 Correct 5 ms 9820 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 5 ms 9820 KB Output is correct
10 Correct 7 ms 9816 KB Output is correct
11 Correct 4 ms 9820 KB Output is correct
12 Correct 5 ms 9864 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 4 ms 9816 KB Output is correct
15 Correct 5 ms 9820 KB Output is correct
16 Correct 5 ms 9728 KB Output is correct
17 Correct 4 ms 9796 KB Output is correct
18 Correct 5 ms 9820 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 4 ms 9820 KB Output is correct
21 Correct 5 ms 9868 KB Output is correct
22 Correct 4 ms 9816 KB Output is correct
23 Correct 4 ms 9816 KB Output is correct
24 Correct 4 ms 9816 KB Output is correct
25 Correct 4 ms 9816 KB Output is correct
26 Correct 4 ms 9856 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 4 ms 9820 KB Output is correct
29 Correct 4 ms 9820 KB Output is correct
30 Correct 4 ms 9820 KB Output is correct
31 Correct 5 ms 9820 KB Output is correct
32 Correct 4 ms 9820 KB Output is correct
33 Correct 6 ms 9840 KB Output is correct
34 Correct 6 ms 9820 KB Output is correct
35 Correct 4 ms 9820 KB Output is correct
36 Correct 7 ms 9816 KB Output is correct
37 Correct 10 ms 9820 KB Output is correct
38 Incorrect 81 ms 9864 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 25316 KB Output is correct
2 Correct 46 ms 25172 KB Output is correct
3 Correct 55 ms 24600 KB Output is correct
4 Correct 52 ms 24912 KB Output is correct
5 Correct 51 ms 22100 KB Output is correct
6 Correct 55 ms 23552 KB Output is correct
7 Correct 55 ms 22868 KB Output is correct
8 Correct 55 ms 23376 KB Output is correct
9 Correct 54 ms 22100 KB Output is correct
10 Correct 53 ms 22100 KB Output is correct
11 Correct 43 ms 20560 KB Output is correct
12 Correct 43 ms 20480 KB Output is correct
13 Correct 38 ms 20564 KB Output is correct
14 Correct 41 ms 20316 KB Output is correct
15 Correct 40 ms 20048 KB Output is correct
16 Correct 35 ms 19796 KB Output is correct
17 Correct 11 ms 14684 KB Output is correct
18 Correct 8 ms 14684 KB Output is correct
19 Correct 8 ms 14684 KB Output is correct
20 Correct 8 ms 14684 KB Output is correct
21 Correct 9 ms 14624 KB Output is correct
22 Correct 8 ms 14560 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 10076 KB Output is correct
2 Correct 6 ms 10068 KB Output is correct
3 Correct 5 ms 10052 KB Output is correct
4 Correct 5 ms 10072 KB Output is correct
5 Correct 5 ms 9876 KB Output is correct
6 Correct 5 ms 10076 KB Output is correct
7 Correct 5 ms 9992 KB Output is correct
8 Correct 5 ms 10076 KB Output is correct
9 Correct 5 ms 10076 KB Output is correct
10 Correct 5 ms 9928 KB Output is correct
11 Correct 5 ms 9820 KB Output is correct
12 Correct 4 ms 9820 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 4 ms 9820 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 5 ms 9820 KB Output is correct
17 Correct 5 ms 9944 KB Output is correct
18 Correct 6 ms 10076 KB Output is correct
19 Correct 4 ms 10076 KB Output is correct
20 Correct 4 ms 10076 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 24512 KB Output is correct
2 Correct 63 ms 24492 KB Output is correct
3 Correct 59 ms 24508 KB Output is correct
4 Correct 58 ms 24444 KB Output is correct
5 Correct 62 ms 24400 KB Output is correct
6 Correct 66 ms 28076 KB Output is correct
7 Correct 64 ms 26964 KB Output is correct
8 Correct 73 ms 26192 KB Output is correct
9 Correct 67 ms 25684 KB Output is correct
10 Correct 67 ms 24428 KB Output is correct
11 Correct 59 ms 24404 KB Output is correct
12 Correct 60 ms 24400 KB Output is correct
13 Correct 59 ms 24404 KB Output is correct
14 Correct 57 ms 23972 KB Output is correct
15 Correct 47 ms 23120 KB Output is correct
16 Correct 35 ms 20820 KB Output is correct
17 Correct 40 ms 25032 KB Output is correct
18 Correct 42 ms 24908 KB Output is correct
19 Correct 45 ms 25276 KB Output is correct
20 Correct 42 ms 24896 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9820 KB Output is correct
2 Correct 5 ms 9816 KB Output is correct
3 Correct 4 ms 9820 KB Output is correct
4 Correct 4 ms 9872 KB Output is correct
5 Correct 6 ms 9820 KB Output is correct
6 Correct 7 ms 9820 KB Output is correct
7 Correct 6 ms 9820 KB Output is correct
8 Correct 4 ms 9876 KB Output is correct
9 Correct 4 ms 9820 KB Output is correct
10 Correct 5 ms 9820 KB Output is correct
11 Correct 5 ms 9820 KB Output is correct
12 Correct 5 ms 10076 KB Output is correct
13 Correct 5 ms 10076 KB Output is correct
14 Correct 4 ms 9820 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 4 ms 9820 KB Output is correct
18 Correct 4 ms 9820 KB Output is correct
19 Correct 4 ms 9820 KB Output is correct
20 Correct 4 ms 9820 KB Output is correct
21 Correct 4 ms 9820 KB Output is correct
22 Correct 5 ms 9820 KB Output is correct
23 Correct 4 ms 9816 KB Output is correct
24 Correct 4 ms 9892 KB Output is correct
25 Correct 4 ms 9820 KB Output is correct
26 Correct 4 ms 9820 KB Output is correct
27 Correct 5 ms 9820 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 24576 KB Output is correct
2 Correct 66 ms 24400 KB Output is correct
3 Correct 59 ms 22864 KB Output is correct
4 Correct 53 ms 21332 KB Output is correct
5 Correct 48 ms 19544 KB Output is correct
6 Correct 43 ms 19024 KB Output is correct
7 Correct 45 ms 18748 KB Output is correct
8 Correct 47 ms 18348 KB Output is correct
9 Correct 44 ms 18008 KB Output is correct
10 Correct 41 ms 18004 KB Output is correct
11 Correct 38 ms 17744 KB Output is correct
12 Correct 44 ms 17748 KB Output is correct
13 Correct 42 ms 17748 KB Output is correct
14 Correct 40 ms 19636 KB Output is correct
15 Correct 65 ms 25876 KB Output is correct
16 Correct 70 ms 24912 KB Output is correct
17 Correct 67 ms 24916 KB Output is correct
18 Correct 64 ms 23892 KB Output is correct
19 Correct 54 ms 21256 KB Output is correct
20 Correct 57 ms 21332 KB Output is correct
21 Correct 54 ms 21328 KB Output is correct
22 Correct 47 ms 20564 KB Output is correct
23 Correct 46 ms 19796 KB Output is correct
24 Correct 64 ms 23116 KB Output is correct
25 Correct 52 ms 23236 KB Output is correct
26 Correct 48 ms 21960 KB Output is correct
27 Correct 58 ms 22076 KB Output is correct

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9816 KB Output is correct
2 Correct 7 ms 9692 KB Output is correct
3 Correct 7 ms 9820 KB Output is correct
4 Correct 5 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9816 KB Output is correct
7 Correct 5 ms 9820 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 5 ms 9820 KB Output is correct
10 Correct 7 ms 9816 KB Output is correct
11 Correct 4 ms 9820 KB Output is correct
12 Correct 5 ms 9864 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 4 ms 9816 KB Output is correct
15 Correct 5 ms 9820 KB Output is correct
16 Correct 5 ms 9728 KB Output is correct
17 Correct 4 ms 9796 KB Output is correct
18 Correct 5 ms 9820 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 4 ms 9820 KB Output is correct
21 Correct 5 ms 9868 KB Output is correct
22 Correct 4 ms 9816 KB Output is correct
23 Correct 4 ms 9816 KB Output is correct
24 Correct 4 ms 9816 KB Output is correct
25 Correct 4 ms 9816 KB Output is correct
26 Correct 4 ms 9856 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 4 ms 9820 KB Output is correct
29 Correct 4 ms 9820 KB Output is correct
30 Correct 4 ms 9820 KB Output is correct
31 Correct 5 ms 9820 KB Output is correct
32 Correct 4 ms 9820 KB Output is correct
33 Correct 6 ms 9840 KB Output is correct
34 Correct 6 ms 9820 KB Output is correct
35 Correct 4 ms 9820 KB Output is correct
36 Correct 7 ms 9816 KB Output is correct
37 Correct 10 ms 9820 KB Output is correct
38 Incorrect 81 ms 9864 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9816 KB Output is correct
2 Correct 7 ms 9692 KB Output is correct
3 Correct 7 ms 9820 KB Output is correct
4 Correct 5 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9816 KB Output is correct
7 Correct 5 ms 9820 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 5 ms 9820 KB Output is correct
10 Correct 7 ms 9816 KB Output is correct
11 Correct 4 ms 9820 KB Output is correct
12 Correct 5 ms 9864 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 4 ms 9816 KB Output is correct
15 Correct 5 ms 9820 KB Output is correct
16 Correct 5 ms 9728 KB Output is correct
17 Correct 4 ms 9796 KB Output is correct
18 Correct 5 ms 9820 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 4 ms 9820 KB Output is correct
21 Correct 5 ms 9868 KB Output is correct
22 Correct 4 ms 9816 KB Output is correct
23 Correct 4 ms 9816 KB Output is correct
24 Correct 4 ms 9816 KB Output is correct
25 Correct 4 ms 9816 KB Output is correct
26 Correct 4 ms 9856 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 4 ms 9820 KB Output is correct
29 Correct 4 ms 9820 KB Output is correct
30 Correct 4 ms 9820 KB Output is correct
31 Correct 5 ms 9820 KB Output is correct
32 Correct 4 ms 9820 KB Output is correct
33 Correct 6 ms 9840 KB Output is correct
34 Correct 6 ms 9820 KB Output is correct
35 Correct 4 ms 9820 KB Output is correct
36 Correct 7 ms 9816 KB Output is correct
37 Correct 10 ms 9820 KB Output is correct
38 Incorrect 81 ms 9864 KB Output isn't correct
39 Halted 0 ms 0 KB -