#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
// freopen(name".inp", "r", stdin);
// freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int numNode, numEdge;
vector<int> adj[MAX];
int vis[MAX];
pair<int, int> dfs(int u, int p, int maxLength){
vis[u] = 1;
pair<int, int> ans = {maxLength, u};
for (int v : adj[u]) if(v ^ p){
ans = max(ans, dfs(v, u, maxLength + 1));
}
return ans;
}
void Whisper(){
cin >> numNode >> numEdge;
for (int i = 1; i <= numEdge; ++i){
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
int ans = 0;
for (int i = 1; i <= numNode; ++i) if(!vis[i]){
int v = dfs(i, 0, 1).second;
ans += dfs(v, 0, 1).first;
}
cout << ans;
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
7260 KB |
Output is correct |
2 |
Correct |
10 ms |
8284 KB |
Output is correct |
3 |
Correct |
15 ms |
9120 KB |
Output is correct |
4 |
Correct |
19 ms |
9820 KB |
Output is correct |
5 |
Correct |
26 ms |
10584 KB |
Output is correct |
6 |
Correct |
28 ms |
11608 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
28 ms |
18772 KB |
Output is correct |
2 |
Correct |
4 ms |
7000 KB |
Output is correct |
3 |
Correct |
6 ms |
7516 KB |
Output is correct |
4 |
Correct |
8 ms |
8180 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
6492 KB |
Output is correct |
2 |
Correct |
2 ms |
6492 KB |
Output is correct |
3 |
Correct |
2 ms |
6492 KB |
Output is correct |
4 |
Correct |
2 ms |
6548 KB |
Output is correct |
5 |
Correct |
4 ms |
7260 KB |
Output is correct |
6 |
Correct |
6 ms |
7816 KB |
Output is correct |
7 |
Correct |
8 ms |
8528 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
6488 KB |
Output is correct |
2 |
Correct |
2 ms |
6548 KB |
Output is correct |
3 |
Correct |
2 ms |
6444 KB |
Output is correct |
4 |
Correct |
2 ms |
6492 KB |
Output is correct |
5 |
Correct |
2 ms |
6492 KB |
Output is correct |
6 |
Correct |
2 ms |
6492 KB |
Output is correct |
7 |
Correct |
2 ms |
6488 KB |
Output is correct |
8 |
Correct |
2 ms |
6488 KB |
Output is correct |
9 |
Correct |
2 ms |
6492 KB |
Output is correct |
10 |
Correct |
2 ms |
6492 KB |
Output is correct |
11 |
Correct |
2 ms |
6488 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
7260 KB |
Output is correct |
2 |
Correct |
10 ms |
8284 KB |
Output is correct |
3 |
Correct |
15 ms |
9120 KB |
Output is correct |
4 |
Correct |
19 ms |
9820 KB |
Output is correct |
5 |
Correct |
26 ms |
10584 KB |
Output is correct |
6 |
Correct |
28 ms |
11608 KB |
Output is correct |
7 |
Correct |
28 ms |
18772 KB |
Output is correct |
8 |
Correct |
4 ms |
7000 KB |
Output is correct |
9 |
Correct |
6 ms |
7516 KB |
Output is correct |
10 |
Correct |
8 ms |
8180 KB |
Output is correct |
11 |
Correct |
2 ms |
6492 KB |
Output is correct |
12 |
Correct |
2 ms |
6492 KB |
Output is correct |
13 |
Correct |
2 ms |
6492 KB |
Output is correct |
14 |
Correct |
2 ms |
6548 KB |
Output is correct |
15 |
Correct |
4 ms |
7260 KB |
Output is correct |
16 |
Correct |
6 ms |
7816 KB |
Output is correct |
17 |
Correct |
8 ms |
8528 KB |
Output is correct |
18 |
Correct |
2 ms |
6488 KB |
Output is correct |
19 |
Correct |
2 ms |
6548 KB |
Output is correct |
20 |
Correct |
2 ms |
6444 KB |
Output is correct |
21 |
Correct |
2 ms |
6492 KB |
Output is correct |
22 |
Correct |
2 ms |
6492 KB |
Output is correct |
23 |
Correct |
2 ms |
6492 KB |
Output is correct |
24 |
Correct |
2 ms |
6488 KB |
Output is correct |
25 |
Correct |
2 ms |
6488 KB |
Output is correct |
26 |
Correct |
2 ms |
6492 KB |
Output is correct |
27 |
Correct |
2 ms |
6492 KB |
Output is correct |
28 |
Correct |
2 ms |
6488 KB |
Output is correct |
29 |
Correct |
29 ms |
11400 KB |
Output is correct |
30 |
Correct |
8 ms |
7584 KB |
Output is correct |
31 |
Correct |
18 ms |
10588 KB |
Output is correct |
32 |
Correct |
12 ms |
8536 KB |
Output is correct |
33 |
Correct |
25 ms |
11056 KB |
Output is correct |
34 |
Correct |
16 ms |
9308 KB |
Output is correct |
35 |
Correct |
24 ms |
10604 KB |
Output is correct |
36 |
Correct |
22 ms |
10076 KB |
Output is correct |
37 |
Correct |
24 ms |
11100 KB |
Output is correct |
38 |
Correct |
27 ms |
10584 KB |
Output is correct |
39 |
Correct |
23 ms |
10884 KB |
Output is correct |