Submission #983007

# Submission time Handle Problem Language Result Execution time Memory
983007 2024-05-15T06:51:46 Z vjudge1 Duathlon (APIO18_duathlon) C++17
0 / 100
34 ms 15956 KB
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, i, j, x, y, ans, sz[200001], rt[200001];
bool u[200001];
vector<int> g[200001], v;

void dfs(int x, int r) {
	sz[x] = 1;
	u[x] = 1;
	rt[x] = r;
	for (auto y : g[x]) {
		if (u[y]) continue;
		dfs(y, r);
		sz[x] += sz[y];
	}
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	#endif
	cin >> n >> m;
	while (m--) {
		cin >> x >> y;
		g[x].push_back(y);
		g[y].push_back(x);
	}
	dfs(1, 1);
	for (i = 1; i <= n; i++) {
		if (!u[i]) {
			v.push_back(i);
			dfs(i, i);
		}
	}
	for (int i : v) ans -= (sz[i]) * (sz[i] - 1);
	for (i = 1; i <= n; i++) {
		ans += 2 * (sz[i] - 1) * (sz[rt[i]] - sz[i]);
	}
	cout << ans;
}
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4952 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4952 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 15956 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 6748 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 10484 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 5212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 10328 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4952 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4952 KB Output isn't correct
2 Halted 0 ms 0 KB -