Submission #59313

#	Time	Username	Problem	Language	Result	Execution time	Memory
59313		MatheusLealV	Duathlon (APIO18_duathlon)	C++17	0 / 100	157 ms	9940 KiB

count_triplets

#include <bits/stdc++.h>
#define N 100050
using namespace std;
typedef long long ll;
ll n, m, c, ans, ok[N];
   
vector<ll> grafo[N];
 
ll sz[N], tot = 0;

ll ultimo;
  
void dfs(ll x)
{
    ultimo = x;

	tot ++;

	ok[x] = 1;

	for(auto v: grafo[x])
	{
		if(ok[v]) continue;

		dfs(v);
	}
}
  
int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
  
    cin>>n>>m;    
  
    for(ll i = 1, a, b; i <= m; i++)
    {
        cin>>a>>b;
   
        grafo[a].push_back(b);
  
        grafo[b].push_back(a);
    }

    for(int i = 1; i <= n; i++)
    {
    	if(ok[i]) continue;

    	tot = 0LL;

        ultimo = 0;

    	dfs(i);

        ll ciclo = 0;

        for(auto v: grafo[ultimo])
        {
            if(v == i) ciclo = 1;
        }

       // cout<<i<<" "<<tot<<" "<<ciclo<<" "<<ans<<"\n";

    	if(tot > 2 and ciclo) ans += (tot * (tot - 1) * (tot - 2));

        else if(tot > 2 and !ciclo) ans += (tot * (tot - 1) * (tot - 2))/3;
    }

    cout<<ans<<"\n";
}

• 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