제출 #983001

#제출 시각아이디문제언어결과실행 시간메모리
983001vjudge1Duathlon (APIO18_duathlon)C++17
0 / 100
36 ms16412 KiB
#include <bits/stdc++.h> #define int long long using namespace std; int n, m, i, j, x, y, ans, sz[200001]; bool u[200001]; vector<int> g[200001]; void dfs(int x) { sz[x] = 1; u[x] = 1; for (auto y : g[x]) { if (u[y]) continue; dfs(y); 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); for (i = 1; i <= n; i++) { ans += (sz[i] - 1) * (sz[1] - sz[i]); } cout << n * (n - 1) - ans; }
#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...