Submission #1173356

#TimeUsernameProblemLanguageResultExecution timeMemory
1173356MuhammetDuathlon (APIO18_duathlon)C++20
0 / 100
1121 ms711952 KiB
#include "bits/stdc++.h" using namespace std; #define ll long long #define SZ(s) (int)s.size() const int N = 1e5 + 5; const int M = 1e9 + 7; int n, m, h[N], p[N], sp[N][25], vis[N]; ll ans; vector <int> v[N], v1; void dfs(int x, int y, int cnt) { ans += max(0, ((cnt - 2) * (cnt - 1)) / 2); for(auto i : v[x]) { if(i != y) dfs(i, x, cnt+1); } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> m; for(int i = 1; i <= m; i++) { int u1, u2; cin >> u1 >> u2; v[u1].push_back(u2); v[u2].push_back(u1); } int k; for(int i = 1; i <= n; i++) { if(SZ(v[i]) == 1) k = i; } dfs(k, 0, 1); cout << ans * 2; return 0; }
#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...