제출 #1201697

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1201697		crispxx	Duathlon (APIO18_duathlon)	C++20	10 / 100	1096 ms	8204 KiB

count_triplets

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define ar array
#define nl '\n'

template <typename A, typename B>
bool chmin(A &a, const B &b) {
	if(a > b) {
		return a = b, true;
	}
	return false;
}

template <typename A, typename B>
bool chmax(A &a, const B &b) {
	if(a < b) {
		return a = b, true;
	}
	return false;
}

void solve() {
	int n, m; cin >> n >> m;
	
	vector<vector<int>> adj(n);
	
	for(int i = 0; i < m; i++) {
		int u, v; cin >> u >> v;
		adj[--u].pb(--v);
		adj[v].pb(u);
	}
	
	int ans = 0;
	
	for(int u = 0; u < n; u++) {
		queue<int> q;
		vector<int> d(n, -1), sum(n);
		q.emplace(u);
		d[u] = 0;
		while(!q.empty()) {
			int v = q.front();
			q.pop();
			ans += sum[v];
			for(auto to : adj[v]) {
				if(d[to] == -1) {
					d[to] = d[v] + 1;
					sum[to] += d[v];
					q.emplace(to);
				}
			}
		}
	}
	
	cout << ans << nl;
}

/**
4 3
1 2
2 3
3 4

4 4
1 2
2 3
3 4
4 2


**/

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	solve();
}

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