Submission #1114697

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114697		Onur_Ilgaz	Duathlon (APIO18_duathlon)	C++17	0 / 100	1097 ms	1048576 KiB

count_triplets

#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
using namespace std;
const int N = 100005;
vector <int> adj[N];
int dp[N][4];

void dfs(int node, int ata) {
	// dp[node][0] = 1;
	dp[node][1] = 1;
	for(auto it:adj[node]) {
		if(it == ata) continue;
		dfs(it, node);
		dp[node][3] += dp[it][3] + dp[it][2];
		dp[node][2] += dp[it][2] + dp[it][1];
		dp[node][1] += dp[it][1] + dp[it][0];
	}
	// cout << node << ": " << dp[node][1] << dp[node][2] << dp[node][3] << '\n';
}

int32_t main(){
	fast
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	dfs(1, 1);
	cout << dp[1][3] * 2;
}

• 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