제출 #610988

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
610988		GusterGoose27	Duathlon (APIO18_duathlon)	C++11	49 / 100	251 ms	60912 KiB

count_triplets

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll MAXN = 1e5;
vector<ll> edges[MAXN];
vector<ll> bcc_graph[2*MAXN];
ll n, m;
ll csize;
ll num_bcc = 0;
ll depth[MAXN];
ll lp[MAXN];
bool vis[MAXN];
vector<ll> stck;
ll sz[MAXN];
ll ans = 0;

void make_bcc(ll cur, ll p = -1) {
	lp[cur] = depth[cur];
	vis[cur] = 1;
	stck.push_back(cur);
	csize++;
	for (ll next: edges[cur]) {
		if (next == p) continue;
		if (vis[next]) {
			lp[cur] = min(lp[cur], depth[next]);
			continue;
		}
		depth[next] = 1+depth[cur];
		make_bcc(next, cur);
		lp[cur] = min(lp[cur], lp[next]);
		if (lp[next] >= depth[cur]) {
			ll cur_bcc = n+(num_bcc++);
			bcc_graph[cur].push_back(cur_bcc);
			bcc_graph[cur_bcc].push_back(cur);
			while (bcc_graph[cur_bcc].back() != next) {
				ll b = stck.back();
				stck.pop_back();
				bcc_graph[b].push_back(cur_bcc);
				bcc_graph[cur_bcc].push_back(b);
			}
		}
	}
}

void make_ans(ll cur, ll p = -1) {
	if (cur < n) sz[cur]++;
	for (ll next: bcc_graph[cur]) {
		if (next == p) continue;
		make_ans(next, cur);
		sz[cur] += sz[next];
		if (cur >= n) ans -= sz[next]*(sz[next]-1)*(bcc_graph[cur].size()-1); // can't include this articulation poll as a midpoll
	}
	ll out_sz = csize-sz[cur];
	if (cur >= n) ans -= out_sz*(out_sz-1)*(bcc_graph[cur].size()-1);
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n >> m;
	for (ll i = 0; i < m; i++) {
		ll x, y; cin >> x >> y; x--; y--;
		edges[x].push_back(y);
		edges[y].push_back(x);
	}
	for (ll i = 0; i < n; i++) {
		if (vis[i]) continue;
		csize = 0;
		make_bcc(i);
		ans += csize*(csize-1)*(csize-2);
		make_ans(i);
	}
	cout << ans << "\n";
}

• Subtask 1: 5 / 5
• Subtask 2: 11 / 11
• Subtask 3: 0 / 8
• Subtask 4: 10 / 10
• Subtask 5: 0 / 13
• Subtask 6: 15 / 15
• Subtask 7: 0 / 20
• Subtask 8: 8 / 8
• Subtask 9: 0 / 10