제출 #790333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
790333		Dan4Life	철인 이종 경기 (APIO18_duathlon)	C++17	23 / 100	1120 ms	1048576 KiB

count_triplets

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using ar = array<int,2>;
const int mxN = (int)1e5+10;
int n, m, ans, tot,VV[mxN],vis[mxN];
vector<int> adj[mxN];
int sub[mxN], totsq[mxN], xd=0;

void dfs(int s, int p){
	VV[s]=1; sub[s]=1; totsq[s]=0;
	for(auto u : adj[s]){
		if(u==p) continue;
		dfs(u,s); sub[s]+=sub[u];
		totsq[s]+=sub[u]*sub[u];
	}
}

void reroot(int s, int u){
	totsq[s]-=sub[u]*sub[u];
	totsq[u]+=(tot-sub[u])*(tot-sub[u]);
	sub[s]-=sub[u]; sub[u]+=sub[s];
	if(!vis[u]) ans+=(tot-1)*(tot-1)-totsq[u],vis[u]=1;
}

void dfs2(int s, int p){
	for(auto u : adj[s]){
		if(u==p) continue;
		reroot(s,u); dfs2(u,s); reroot(u,s);
	}
}

int32_t main() {
	cin >> n >> m;
	for(int i = 0; i < m; i++){
		int a, b; cin >> a >> b;
		adj[a].pb(b), adj[b].pb(a);
	}
	for(int i = 1; i <= n; i++)
		if(!VV[i]) dfs(i,-1), tot = sub[i], dfs2(i,-1); 
	cout << ans << "\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