제출 #1203271

#제출 시각아이디문제언어결과실행 시간메모리
1203271saidponDuathlon (APIO18_duathlon)C++20
0 / 100
30 ms13636 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...