Submission #771794

#	Time	Username	Problem	Language	Result	Execution time	Memory
771794		gagik_2007	Duathlon (APIO18_duathlon)	C++17	8 / 100	105 ms	15360 KiB

count_triplets

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

ll ttt;
const ll INF=1e18;
const ll MOD=1e9+7;
const ll N=3e5+7;
ll n,m,k;
vector<int>g[N];
bool used[N];
bool cu[N];

bool is_cycle(int v, int par){
    if(used[v])return true;
    used[v]=true;
    for(int to:g[v]){
        if(to!=par){
            if(is_cycle(to, v))return true;
        }
    }
    return false;
}

int length(int v){
    cu[v]=true;
    int cnt=1;
    for(int to:g[v]){
        if(!cu[to]){
            cnt+=length(to);
        }
    }
    return cnt;
}

int main() {
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int x,y;
        cin>>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    ll ans=0;
    for(int v=0;v<n;v++){
        if(!used[v]){
            ll cnt=length(v);
            if(is_cycle(v, v)){
                ans+=cnt*(cnt-1)*(cnt-2);
            }
            else{
                ans+=cnt*(cnt-1)*(cnt-2)/3;
            }
        }
    }
    cout<<ans<<endl;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 8 / 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