제출 #216356

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
216356		theStaticMind	Duathlon (APIO18_duathlon)	C++14	0 / 100	1099 ms	1048580 KiB

count_triplets

#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;

vector<int> adj[300005];
vector<int> sub(300005, 1);
int ans = 0;

void dfs(int x, int pre){
	sub[x] = 1;
	for(auto y : adj[x]){
		if(y == pre) continue;
		dfs(y, x);
		sub[x] += sub[y];
	}
}

void calc(int x, int pre){
	ans += 2ll * (sub[x] - 1) * (sub[1] - sub[x]);

	int w = 0;

	for(auto y : adj[x]){
		if(y == pre) continue;
		ans += 2ll * sub[y] * w;
		w += sub[y];
	}

	for(auto y : adj[x]){
		if(y == pre) continue;
		calc(y, x);
	}
}

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n, m;
	cin >> n >> m;

	for(int i = 0; i < m; i++){
		int x, y;
		cin >> x >> y;
		adj[x].pb(y);
		adj[y].pb(x);
	}

	dfs(1, -1);

	calc(1, -1);

	cout << ans;
}

• 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