oj.uz

답안 #628604

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
628604 2022-08-13T14:27:10 Z vovamr Cijanobakterije (COCI21_cijanobakterije) C++17
70 / 70
 43 ms 10904 KB 
#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.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3412 KB Output is correct
2 Correct 13 ms 4308 KB Output is correct
3 Correct 20 ms 5248 KB Output is correct
4 Correct 31 ms 6012 KB Output is correct
5 Correct 35 ms 6920 KB Output is correct
6 Correct 43 ms 7756 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 10904 KB Output is correct
2 Correct 5 ms 3196 KB Output is correct
3 Correct 7 ms 3924 KB Output is correct
4 Correct 9 ms 4500 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2592 KB Output is correct
4 Correct 2 ms 2680 KB Output is correct
5 Correct 6 ms 3336 KB Output is correct
6 Correct 9 ms 4100 KB Output is correct
7 Correct 13 ms 4820 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2680 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2680 KB Output is correct
7 Correct 3 ms 2684 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 2 ms 2684 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3412 KB Output is correct
2 Correct 13 ms 4308 KB Output is correct
3 Correct 20 ms 5248 KB Output is correct
4 Correct 31 ms 6012 KB Output is correct
5 Correct 35 ms 6920 KB Output is correct
6 Correct 43 ms 7756 KB Output is correct
7 Correct 35 ms 10904 KB Output is correct
8 Correct 5 ms 3196 KB Output is correct
9 Correct 7 ms 3924 KB Output is correct
10 Correct 9 ms 4500 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2592 KB Output is correct
14 Correct 2 ms 2680 KB Output is correct
15 Correct 6 ms 3336 KB Output is correct
16 Correct 9 ms 4100 KB Output is correct
17 Correct 13 ms 4820 KB Output is correct
18 Correct 3 ms 2680 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2680 KB Output is correct
24 Correct 3 ms 2684 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 3 ms 2644 KB Output is correct
27 Correct 2 ms 2684 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 42 ms 7828 KB Output is correct
30 Correct 13 ms 4436 KB Output is correct
31 Correct 28 ms 7300 KB Output is correct
32 Correct 18 ms 5332 KB Output is correct
33 Correct 36 ms 7628 KB Output is correct
34 Correct 20 ms 5964 KB Output is correct
35 Correct 31 ms 7416 KB Output is correct
36 Correct 31 ms 6532 KB Output is correct
37 Correct 33 ms 7608 KB Output is correct
38 Correct 43 ms 7012 KB Output is correct
39 Correct 31 ms 7472 KB Output is correct