Submission #59299

#	Time	Username	Problem	Language	Result	Execution time	Memory
59299		MatheusLealV	Duathlon (APIO18_duathlon)	C++17	23 / 100	1130 ms	919288 KiB

count_triplets

#include <bits/stdc++.h>
#define N 100050
using namespace std;
typedef long long ll;

ll n, m, ok[N], ans, sz[N];

vector<int> grafo[N];

ll tot;

void fill(int x, int p)
{
	tot ++;

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

		fill(v, x);
	}
}

void dfs(int x, int p)
{	
	sz[x] = ok[x] = 1;

	ll quadrado = 0, soma = 0;

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

		dfs(v, x);

		quadrado += sz[v] * sz[v];

		soma += sz[v];

		sz[x] += sz[v];
	}

	soma += tot - sz[x];

	quadrado += (tot - sz[x]) * (tot - sz[x]);

	ll prod2 = (soma * soma - quadrado);

	ans += prod2;
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>n>>m;

	for(int 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 = 0;

		fill(i, i);

		dfs(i, i);
	}

	cout<<ans<<"\n";

	//cout<<brute()<<"\n";
}

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