Submission #912743

#	Time	Username	Problem	Language	Result	Execution time	Memory
912743		imarn	Duathlon (APIO18_duathlon)	C++14	23 / 100	1131 ms	1048576 KiB

count_triplets

#include<bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
using namespace std;
const int N=1e5+5;
vi g[N];stack<int>st;
vvi cmp,bst;
unsigned ll d[N]{0},lo[N]{0},t=0,ap[N]{0},id[N]{0},cur=0,isap[N]{0},sz[N],dp[N];
void dfs(int u,int p,int gr){
    lo[u]=gr;d[u]=1;
    for(auto v:g[u]){
        if(v==p)continue;
        dfs(v,u,gr);d[u]+=d[v];
    }
}
ll ans=0,n;
void solve(int u,int p){
    dp[u]=1;id[u]=1;
    ll tt=0;
    for(auto v:g[u]){
        if(v==p)continue;
        solve(v,u);
        if(isap[u])ans+=2*(dp[u]-1)*(dp[v]);
        dp[u]+=dp[v];
    }
    if(isap[u])ans+=2*(d[lo[u]]-dp[u])*(dp[u]-1);
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int m;cin>>n>>m;
    for(int i=1;i<=m;i++){
        int u,v;cin>>u>>v;
        g[u].pb(v);g[v].pb(u);
    }
    //dfs(1,1);build(n);
    for(int i=1;i<=n;i++)if(!d[i])dfs(i,i,i);
    for(int i=1;i<=n;i++)sz[i]=1,isap[i]=1;
    for(int i=1;i<=n;i++)if(!id[i])solve(i,i);cout<<ans;
}

Compilation message (stderr)

count_triplets.cpp: In function 'void solve(int, int)':
count_triplets.cpp:27:8: warning: unused variable 'tt' [-Wunused-variable]
   27 |     ll tt=0;
      |        ^~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:46:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   46 |     for(int i=1;i<=n;i++)if(!id[i])solve(i,i);cout<<ans;
      |     ^~~
count_triplets.cpp:46:47: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   46 |     for(int i=1;i<=n;i++)if(!id[i])solve(i,i);cout<<ans;
      |                                               ^~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 8
• Subtask 4: 10 / 10
• Subtask 5: 13 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 20
• Subtask 8: 0 / 8
• Subtask 9: 0 / 10