# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
563710 | racsosabe | Shymbulak (IZhO14_shymbulak) | C++14 | 510 ms | 676 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 N = 5000 + 5;
int n;
int D[N];
int cnt[N];
vector<int> G[N];
pair<int, int> BFS(int src){
memset(D, -1, sizeof D);
memset(cnt, 0, sizeof cnt);
D[src] = 0;
queue<int> Q;
Q.emplace(src);
cnt[src] = 1;
while(!Q.empty()){
int u = Q.front(); Q.pop();
for(int v : G[u]){
if(~D[v]){
if(D[v] == D[u] + 1) cnt[v] += cnt[u];
continue;
}
D[v] = D[u] + 1;
cnt[v] = cnt[u];
Q.emplace(v);
}
}
int maxi = *max_element(D + 1, D + n + 1);
int r = 0;
for(int i = 1; i <= n; i++) if(maxi == D[i]) r += cnt[i];
return {maxi, r};
}
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++){
int u, v;
scanf("%d %d", &u, &v);
G[u].emplace_back(v);
G[v].emplace_back(u);
}
int ans = 0;
int best = -1;
for(int i = 1; i <= n; i++){
pair<int, int> cur = BFS(i);
if(best == cur.first) ans += cur.second;
else if(best < cur.first){
best = cur.first;
ans = cur.second;
}
}
cout << ans / 2 << endl;
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... |