# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64924 | gusfring | 철인 이종 경기 (APIO18_duathlon) | C++14 | 1193 ms | 865736 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
typedef long long ll;
int sz[MAXN], N, M, vis[MAXN], S;
ll res;
vector<int> adj[MAXN];
void dfs(int u, int p){
vis[u] = 1, sz[u] = 1;
for(int v : adj[u])
if(v != p){ dfs(v, u); sz[u] += sz[v]; }
}
void solve(int u, int p){
vector<int> vec;
if(p != -1) vec.push_back(S - sz[u]);
for(int v : adj[u])
if(v != p){
vec.push_back(sz[v]);
solve(v, u);
}
int sum = 0;
for(int x : vec){
res += 1LL * sum * x;
sum += x;
}
}
int main(){
scanf("%d %d", &N, &M);
while(M--){
int u, v;
scanf("%d %d", &u, &v);
adj[u].push_back(v);
adj[v].push_back(u);
}
for(int i=1; i<=N; ++i)
if(!vis[i]){
dfs(i, -1);
S = sz[i];
solve(i, -1);
}
printf("%lld\n", 2 * res);
return 0;
}
Compilation message (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... |