oj.uz

Submission #1087769

# Submission time Handle Problem Language Result Execution time Memory
1087769 2024-09-13T08:14:02 Z alexander707070 Duathlon (APIO18_duathlon) C++14
31 / 100
 68 ms 26452 KB 
#include<bits/stdc++.h>
#define MAXN 200007
using namespace std;

int 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];

int 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)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)continue;
        dfs2(tree[x][i],x,s);
    }

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

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});
    }

    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]);
    }


    cout<<ans<<"\n";

    return 0;
}

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++){
      |                 ~^~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 23892 KB Output is correct
2 Correct 51 ms 23976 KB Output is correct
3 Correct 49 ms 23124 KB Output is correct
4 Correct 48 ms 23560 KB Output is correct
5 Correct 44 ms 20904 KB Output is correct
6 Correct 50 ms 22096 KB Output is correct
7 Correct 52 ms 21332 KB Output is correct
8 Correct 50 ms 22100 KB Output is correct
9 Correct 48 ms 20728 KB Output is correct
10 Correct 52 ms 20824 KB Output is correct
11 Correct 39 ms 19280 KB Output is correct
12 Correct 37 ms 19288 KB Output is correct
13 Correct 35 ms 19292 KB Output is correct
14 Correct 34 ms 19028 KB Output is correct
15 Correct 31 ms 19024 KB Output is correct
16 Correct 30 ms 18520 KB Output is correct
17 Correct 7 ms 13864 KB Output is correct
18 Correct 7 ms 13900 KB Output is correct
19 Correct 7 ms 13916 KB Output is correct
20 Correct 7 ms 13916 KB Output is correct
21 Correct 7 ms 13916 KB Output is correct
22 Correct 7 ms 13916 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9820 KB Output is correct
2 Correct 4 ms 9948 KB Output is correct
3 Correct 4 ms 9820 KB Output is correct
4 Correct 4 ms 10076 KB Output is correct
5 Correct 4 ms 10076 KB Output is correct
6 Correct 4 ms 10076 KB Output is correct
7 Correct 5 ms 9852 KB Output is correct
8 Correct 5 ms 9816 KB Output is correct
9 Correct 5 ms 9820 KB Output is correct
10 Correct 6 ms 9800 KB Output is correct
11 Correct 5 ms 9820 KB Output is correct
12 Correct 4 ms 10000 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 5 ms 9820 KB Output is correct
15 Correct 5 ms 9968 KB Output is correct
16 Correct 5 ms 9816 KB Output is correct
17 Correct 5 ms 9816 KB Output is correct
18 Correct 4 ms 9820 KB Output is correct
19 Correct 4 ms 9828 KB Output is correct
20 Correct 5 ms 10012 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 23120 KB Output is correct
2 Correct 60 ms 22868 KB Output is correct
3 Correct 55 ms 22872 KB Output is correct
4 Correct 60 ms 22868 KB Output is correct
5 Correct 52 ms 22864 KB Output is correct
6 Correct 60 ms 26452 KB Output is correct
7 Correct 64 ms 25364 KB Output is correct
8 Correct 60 ms 24740 KB Output is correct
9 Correct 62 ms 23992 KB Output is correct
10 Correct 60 ms 22872 KB Output is correct
11 Correct 59 ms 22864 KB Output is correct
12 Correct 54 ms 22864 KB Output is correct
13 Correct 57 ms 22868 KB Output is correct
14 Correct 52 ms 22288 KB Output is correct
15 Correct 55 ms 21840 KB Output is correct
16 Correct 32 ms 19548 KB Output is correct
17 Correct 40 ms 23240 KB Output is correct
18 Correct 39 ms 23500 KB Output is correct
19 Correct 47 ms 23712 KB Output is correct
20 Correct 42 ms 23364 KB Output is correct

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 22872 KB Output is correct
2 Correct 68 ms 22804 KB Output is correct
3 Incorrect 59 ms 21424 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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