#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int M = 3e5+5, K = 4e2+2, MOD = 1e9+7;
int d[M], noc[M], n, dp[M];
vector<int> node[M];
void dfs(int s, int p = 1) {
noc[s]++;
for (int i:node[s]) {
if (i != p) {
d[i] = d[s]+1;
dfs(i, s);
noc[s] += noc[i];
}
}
}
void dfs2(int s, int p = 1) {
for (int i:node[s]) {
if (i != p) {
dp[i] = dp[s] + n - 2*noc[i];
dfs2(i, s);
}
}
}
signed main() {
cin.tie(0)->sync_with_stdio(0);
int m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
node[a].push_back(b);
node[b].push_back(a);
} dfs(1);
for (int i = 1; i <= n; i++) dp[1] += d[i];
dfs2(1);
int ans = 0;
for (int i = 1; i <= n; i++) ans += dp[i] - n + 1;
// for (int i = 1; i <= n; i++) cout << dp[i] << ' '; cout << endl;
cout << ans << endl;
return 0;
}
/*
4 3
1 2 2 3 3 4
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
410 ms |
1048576 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
410 ms |
1048576 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1114 ms |
541968 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
7380 KB |
Output is correct |
2 |
Correct |
4 ms |
7380 KB |
Output is correct |
3 |
Correct |
4 ms |
7380 KB |
Output is correct |
4 |
Correct |
4 ms |
7488 KB |
Output is correct |
5 |
Correct |
4 ms |
7380 KB |
Output is correct |
6 |
Correct |
4 ms |
7380 KB |
Output is correct |
7 |
Correct |
4 ms |
7380 KB |
Output is correct |
8 |
Correct |
4 ms |
7380 KB |
Output is correct |
9 |
Correct |
4 ms |
7380 KB |
Output is correct |
10 |
Incorrect |
4 ms |
7380 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
53 ms |
13336 KB |
Output is correct |
2 |
Correct |
48 ms |
14620 KB |
Output is correct |
3 |
Correct |
51 ms |
14588 KB |
Output is correct |
4 |
Correct |
47 ms |
14672 KB |
Output is correct |
5 |
Correct |
49 ms |
14656 KB |
Output is correct |
6 |
Correct |
76 ms |
17596 KB |
Output is correct |
7 |
Correct |
61 ms |
16820 KB |
Output is correct |
8 |
Correct |
64 ms |
16356 KB |
Output is correct |
9 |
Correct |
59 ms |
15724 KB |
Output is correct |
10 |
Incorrect |
44 ms |
14700 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
7380 KB |
Output is correct |
2 |
Correct |
4 ms |
7380 KB |
Output is correct |
3 |
Runtime error |
537 ms |
1048576 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
47 ms |
13396 KB |
Output is correct |
2 |
Correct |
53 ms |
14480 KB |
Output is correct |
3 |
Runtime error |
616 ms |
1048576 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
410 ms |
1048576 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
410 ms |
1048576 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |