제출 #405389

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
405389		saleh	Duathlon (APIO18_duathlon)	C++17	16 / 100	168 ms	452 KiB

count_triplets

#include <bits/stdc++.h>

#define ft first
#define sd second

using namespace std;

typedef pair<int, int> pii;

const int MAXN = 50 + 3;
















int n, m, ans;
vector<int> g[MAXN];
bitset<MAXN> mark;

void dfs(int v) {
	mark[v] = true;
	for (auto i : g[v]) if (!mark[i]) dfs(i);
}


int main() {
	cin >> n >> m;
	if (n >= MAXN || m >= (MAXN << 1)) return 0;
	ans = (n - 2) * (n - 1) * n;
	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		g[--u].push_back(--v), g[v].push_back(u);
	}
	for (int i = 0; i < n; i++) {
		set<pii> s;
		for (int j = 0; j < n; j++) if (i != j) {
			mark.reset();
			mark[j] = true;
			dfs(i);
			mark[j] = false;
			for (int a = 0; a < n; a++) if (!mark[a]) for (int b = a + 1; b < n; b++) if (!mark[b]) s.insert({a, b});
		}
		ans -= s.size() * 2;
	}
	cout << ans;
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 11 / 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