제출 #297208

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297208		srvlt	철인 이종 경기 (APIO18_duathlon)	C++14	0 / 100	18 ms	512 KiB

count_triplets

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) begin(x), end(x)
#define SZ(x) (int)(x).size()
#define cps(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define cps2(x, y) sort(all(x), y), (x).erase(unique(all(x)), end(x))
#define mem(x, y) memset(& x, y, sizeof(x))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int n0 = 1003;
int n, m, root, used[n0], good[n0], sz[n0];
vector <int> g[n0];

ll cur;

void dfs(int v, int p) {
	used[v] = 1, sz[v] = 1;
	ll bad = (v != root);
	for (int to : g[v]) {
		if (to == p) continue;
		if (used[to] == 1 && root == to) {
			good[v] = 1;
		}
		if (!used[to]) {
			dfs(to, v);
			good[v] |= good[to];
			if (!good[to]) {
				cur += bad * sz[to];
				bad += sz[to];
			}
			sz[v] += sz[to];
		}
	}
	used[v] = 2;
}

ll comp;

void go(int v) {
	used[v] = 1, comp++;
	for (int to : g[v])
		if (!used[to]) go(to);
}

int main() {
	ios_base::sync_with_stdio(false), cin.tie(NULL);
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int x, y;
		cin >> x >> y;
		g[x].pb(y), g[y].pb(x);
	}
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		if (!used[i]) {
			comp = 0;
			go(i);
			ans += comp * (comp - 1) * (comp - 2);
		}
	}
	for (int i = 1; i <= n; i++) {
		root = i;
		mem(used, 0), mem(good, 0), mem(sz, 0);
		cur = 0;
		dfs(i, i);
		cur *= 2;
		ans -= cur;
	}
	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