#include <bits/stdc++.h>
#define nemeshay ios_base::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);
#define int long long
#define sigma signed
#define pb push_back
#define ar array
using namespace std;
const int N = 2e5 + 2, inf = 1e9 + 7, mod = 998244353;
int used[N], ans;
vector <int> pon[N];
void dfs(int u, int cnt){
used[u] = 1;
for (auto v: pon[u]) if (!used[v]) ans += cnt * (cnt - 1), dfs(v, cnt + 1);
}
void test_case(){
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++){
int u, v;
cin >> u >> v;
pon[u].pb(v);
pon[v].pb(u);
}
for (int i = 1; i <= n; i++) if (!used[i]) dfs(i, 1);
cout << ans << '\n';
}
sigma main() {
nemeshay
int t = 1;
while (t--) test_case();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |