Submission #927758

#	Time	Username	Problem	Language	Result	Execution time	Memory
927758		TAhmed33	Duathlon (APIO18_duathlon)	C++98	0 / 100	871 ms	1048576 KiB

count_triplets

#include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
vector <int> adj[300001];
int sze[300001];
bool vis[300001];
void calc (int pos, int par) {
  	vis[pos] = 1;
	for (auto j : adj[pos]) {
		if (j == par) continue;
		calc(j, pos);
		sze[pos] += sze[j];
	}
	sze[pos]++;
}
int dfs (int pos, int par, int cnt = 0) {
  	vis[pos] = 1;
	int sum = (sze[pos] - 1) * cnt;
	int sum2 = sze[pos] - 1;
	for (auto j : adj[pos]) {
		if (j == par) continue;
		sum += dfs(j, pos, cnt + sze[pos] - sze[j]);
		sum2 -= sze[j];
		sum += sze[j] * (sum2);
	}
	return sum;
}
signed main () {
    cin >> n; int m; cin >> m;
    for (int i = 1; i < n; i++) {
	    int a, b;
	    cin >> a >> b;
	    adj[a].push_back(b);
	    adj[b].push_back(a);
    }
    for (int i = 1; i <= n; i++) if (!vis[i]) calc(i, -1);
    memset(vis, 0, sizeof(vis));
  	int ans = 0;
  	for (int i = 1; i <= n; i++) if (!vis[i]) ans += dfs(i, -1);
  	cout << 2 * 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