Submission #59302

#	Time	Username	Problem	Language	Result	Execution time	Memory
59302		thiago4532	Duathlon (APIO18_duathlon)	C++17	0 / 100	1144 ms	1049600 KiB

count_triplets

#include <bits/stdc++.h>

using namespace std;
const int maxn = 1e5 + 10, inf = 0x3f3f3f3f;
vector<int> grafo[maxn];
int sz[maxn];
int mark[maxn], root[maxn];

void dfs(int u, int p=0){
	sz[u] = 1;
	for(auto v : grafo[u]){
		if(v == p) continue;

		mark[v] = mark[u];	
		dfs(v, u);
		sz[u] += sz[v];
	}
}

int ans;
void solve(int u, int p=0, int acc=0){
	ans += (2 * acc * (sz[u] - 1));

	for(auto v : grafo[u]){
		if(v == p) continue;
		ans += (sz[u] - sz[v] - 1) * sz[v];
		solve(v, u, sz[u] - sz[v] + acc);
	}
}

int main(){
	int n, m;
	cin >> n >> m;
	for(int i=1;i<=m;i++){
		int a, b;
		cin >> a >> b;
		grafo[a].push_back(b);
		grafo[b].push_back(a);
	}

	int cnt=0;
	for(int i=1;i<=n;i++)
		if(!mark[i]) mark[i] = ++cnt, root[cnt] = i, dfs(i);

	for(int i=1;i<=cnt;i++)
		solve(root[i]);

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

• 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