Submission #932480

#TimeUsernameProblemLanguageResultExecution timeMemory
932480WhisperCijanobakterije (COCI21_cijanobakterije)C++17
70 / 70
29 ms18772 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...