Submission #138770

#	Time	Username	Problem	Language	Result	Execution time	Memory
138770		FedericoS	Duathlon (APIO18_duathlon)	C++14	8 / 100	168 ms	14948 KiB

count_triplets

#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;

ll N,M;
ll x,y;
ll A,B,ans;
bool V[300005];
vector<ll> grafo[300005];

void DFS(int k){

	B++;
	if(V[k])
		return;
	A++;
	V[k]=true;

	for(int f:grafo[k])
		DFS(f);

}

int main(){

	cin>>N>>M;
	for(int i=0;i<M;i++){
		cin>>x>>y;
		grafo[x].push_back(y);
		grafo[y].push_back(x);
	}

	for(int i=1;i<N+1;i++)
		if(!V[i]){
			A=B=0;
			DFS(i);
			if(B-1==2*A)
				ans+=(A*(A-1)*(A-2));
			else	
				ans+=(A*(A-1)*(A-2))/3;
		}

	cout<<ans;

}

• 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