#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define INF 1000000021
#define MOD 1000000007
#define pb push_back
#define sqr(a) (a)*(a)
#define M(a, b) make_pair(a,b)
#define T(a, b, c) make_pair(a, make_pair(b, c))
#define F first
#define S second
#define all(x) (x.begin(), x.end())
#define deb(x) cerr << #x << " = " << x << '\n'
#define N 222222
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
const ld pi = 2 * acos(0.0);
template<class T> bool umin(T& a, T b){if(a>b){a=b;return 1;}return 0;}
template<class T> bool umax(T& a, T b){if(a<b){a=b;return 1;}return 0;}
template<class T, class TT> bool pal(T a, TT n){int k=0;for(int i=0;i<=n/2;i++){if(a[i]!=a[n-i-1]){k=1;break;}}return k?0:1;}
//int month[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
map<int, int> d;
vi v[N];
int dis[N];
int main()
{
int n;
cin >> n;
for(int i = 1; i <= n; i ++)
{
int x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
for(int i = 1; i <= n; i ++)
{
queue<int> q;
q.push(i);
for(int j = 1; j <= n; j ++)
dis[j] = INF;
dis[i] = 0;
while(!q.empty())
{
int u = q.front();
q.pop();
for(auto it : v[u])
if(dis[it] > dis[u] + 1)
{
q.push(it);
dis[it] = dis[u] + 1;
}
}
for(int i = 1; i <= n; i ++)
d[dis[i]] ++;
}
int ans = 0, id = 0;
for(auto it : d)
{
if(it.F > ans)
{
ans = it.F;
id = it.S;
}
}
cout << id;
getchar();
getchar();
return 0;
//ios::sync_with_stdio(false);
//cin.tie(0);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
5496 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
5624 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
39 ms |
5660 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1580 ms |
10348 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
