Submission #739527

#	Time	Username	Problem	Language	Result	Execution time	Memory
739527		bachhoangxuan	Duathlon (APIO18_duathlon)	C++17	0 / 100	73 ms	37444 KiB

count_triplets

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=100005;
const int bl=650;
const int maxs=650;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000000;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
int n,m,sz,pos,num[maxn],low[maxn];
vector<int> edge[maxn],bcc[maxn],adj[maxn],st;
int cnt[maxn],sum[maxn],rr[maxn],ans=0;
void dfs(int u,int par){
    low[u]=num[u]=++pos;
    st.push_back(u);
    for(int v:edge[u]){
        if(v==par) continue;
        if(!num[v]){
            dfs(v,u);
            low[u]=min(low[u],low[v]);
            if(low[v]>=num[u]){
                sz++;
                while(st.back()!=u){
                    bcc[st.back()].push_back(sz);
                    st.pop_back();
                }
                bcc[u].push_back(sz);
            }
        }
        else low[u]=min(low[u],num[v]);
    }
}
void dfs2(int u,int par){
    sum[u]=cnt[u];
    ans+=cnt[u]*(cnt[u]-1)*(2*n+rr[u]-cnt[u]-2);
    int total=(n-cnt[u])*(n-cnt[u]);
    for(int v:adj[u]){
        if(v==par) continue;
        dfs2(v,u);sum[u]+=sum[v];
        total-=sum[v]*sum[v];
    }
    total-=(n-sum[u])*(n-sum[u]);
    ans+=total*cnt[u];
}
void solve(){
    cin >> n >> m;
    for(int i=1;i<=m;i++){
        int u,v;cin >> u >> v;
        edge[u].push_back(v);
        edge[v].push_back(u);
    }
    dfs(1,0);
    for(int i=1;i<=n;i++){
        if((int)bcc[i].size()>1){
            sz++;cnt[sz]=1;
            for(int v:bcc[i]){
                adj[v].push_back(sz);
                adj[sz].push_back(v);
                rr[v]++;
            }
        }
        else cnt[bcc[i][0]]++;
    }
    dfs2(1,0);
    cout << ans << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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