Submission #829783

#	Time	Username	Problem	Language	Result	Execution time	Memory
829783		caganyanmaz	Duathlon (APIO18_duathlon)	C++14	8 / 100	75 ms	12620 KiB

count_triplets

#include <bits/stdc++.h>
#define int int64_t
#define pb push_back
using namespace std;

constexpr static int MXN = 1e5;
int n, m;
vector<int> g[MXN];
bitset<MXN> visited;
int subtree_size[MXN];

int sum;
bool dfs(int node, int p)
{
	visited[node] = true;
	sum++;
	for (int c : g[node])
	{
		if (c == p)
			continue;
		if (visited[c])
			return true;
		if (dfs(c, node))
			return true;
	}
	return false;
}


int32_t main()
{
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int a, b;
		cin >> a >> b;
		a--,b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	int res = 0;
	for (int i = 0; i < n; i++)
	{
		if (!visited[i])
		{
			sum = 0;
			bool circular = dfs(i, i);
			if (circular)
				res += sum * (sum - 1) * (sum - 2);
			else
				res += sum * (sum - 1) * (sum - 2) / 3;
		}
	}
	cout << res << "\n";
}

• 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