# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1234320 | Jer | 철인 이종 경기 (APIO18_duathlon) | C++20 | 1122 ms | 1114112 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100005;
vector<int> con[MAXN];
int n, m;
ll res = 0;
int dfs(int curr, int par)
{
int sub = 0;
for (auto i : con[curr])
{
if (i == par)
continue;
int s = dfs(i, curr);
sub += s;
}
res += (ll)(n - sub - 1) * (ll)(sub);
return sub + 1;
}
int main()
{
scanf("%d%d", &n, &m);
int a, b;
for (int i = 0; i < m; ++i)
scanf("%d%d", &a, &b), con[a].push_back(b), con[b].push_back(a);
dfs(1, -1);
printf("%lld\n", 2LL * res);
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | 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... |