Submission #628604

#	Time	Username	Problem	Language	Result	Execution time	Memory
628604		vovamr	Cijanobakterije (COCI21_cijanobakterije)	C++17	70 / 70	43 ms	10904 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

const int N = 1e5 + 5;
ve<int> gr[N];
int used[N], d[N];
inline void dfs(int v, int p, int &mx) {
	if (d[mx] < d[v]) mx = v;
	used[v] = 1;
	for (auto &to : gr[v]) if (to != p) {
		d[to] = d[v] + 1;
		dfs(to, v, mx);
	}
}

inline void solve() {
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; ++i) {
		int v, u;
		cin >> v >> u, --v, --u;
		gr[v].pb(u), gr[u].pb(v);
	}
	int ans = 0;
	for (int i = 0; i < n; ++i) {
		if (used[i]) continue;
		int mx = i;
		d[mx] = 0; dfs(i, i, mx);
		d[mx] = 0; dfs(mx, mx, mx);
		ans += d[mx] + 1;
	}
	cout << ans;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

• Subtask 1: 15 / 15
• Subtask 2: 6 / 6
• Subtask 3: 6 / 6
• Subtask 4: 15 / 15
• Subtask 5: 28 / 28