oj.uz

답안 #666283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
666283 2022-11-28T05:47:19 Z Chal1shkan Cijanobakterije (COCI21_cijanobakterije) C++14
70 / 70
 51 ms 12120 KB 
# include <bits/stdc++.h>

# define pb push_back
# define ff first
# define ss second
# define nl "\n"
# define pii pair <int, int>
# define pll pair <ll, ll>
  
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
  
const ll maxn = 1e5 + 125;
const ll maxl = 20 + 0;
const ll inf = 2e9 + 0;
const ll mod = 998244353;

using namespace std;

ll n, m, vv, uu, cur;
vector <ll> g[maxn];
bool used[maxn];

void dfs (ll v, ll pa, ll d, bool tp)
{
	if (d > cur)
	{
		cur = d;
		if (!tp)
			vv = v;
		else
			uu = v;
	}
	used[v] = 1;
	for (ll to : g[v])
	{
		if (to != pa)
		{
			dfs(to, v, d + 1, tp);
		}
	}
}



void ma1n ()
{
	cin >> n >> m;
	for (ll i = 1, u, v; i <= m; ++i)
	{
		cin >> u >> v;
		g[u].pb(v);
		g[v].pb(u);
	}
	ll ans = 0;
	for (ll i = 1; i <= n; ++i)
	{
		if (!used[i])
		{
			cur = 0;
			dfs(i, i, 1, 0);
			cur = 0;
			dfs(vv, vv, 1, 1);
			ans += cur;
		//	cout << vv << ' ' << uu << nl;
		}
	}
	cout << ans << nl;
}
    
int main ()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int ttt = 1;
//  cin >> ttt;
    for (int test = 1; test <= ttt; test++)
    {
//      cout << "Case " << test << ":" << nl;
        ma1n();
    }
    return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3284 KB Output is correct
2 Correct 13 ms 3860 KB Output is correct
3 Correct 22 ms 4600 KB Output is correct
4 Correct 26 ms 5140 KB Output is correct
5 Correct 41 ms 5816 KB Output is correct
6 Correct 51 ms 6504 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 12120 KB Output is correct
2 Correct 4 ms 3028 KB Output is correct
3 Correct 5 ms 3412 KB Output is correct
4 Correct 8 ms 3892 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 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 5 ms 3156 KB Output is correct
6 Correct 7 ms 3796 KB Output is correct
7 Correct 11 ms 4300 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 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 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3284 KB Output is correct
2 Correct 13 ms 3860 KB Output is correct
3 Correct 22 ms 4600 KB Output is correct
4 Correct 26 ms 5140 KB Output is correct
5 Correct 41 ms 5816 KB Output is correct
6 Correct 51 ms 6504 KB Output is correct
7 Correct 30 ms 12120 KB Output is correct
8 Correct 4 ms 3028 KB Output is correct
9 Correct 5 ms 3412 KB Output is correct
10 Correct 8 ms 3892 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 5 ms 3156 KB Output is correct
16 Correct 7 ms 3796 KB Output is correct
17 Correct 11 ms 4300 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 1 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 2644 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 3 ms 2644 KB Output is correct
29 Correct 39 ms 6452 KB Output is correct
30 Correct 8 ms 3548 KB Output is correct
31 Correct 24 ms 5844 KB Output is correct
32 Correct 13 ms 4308 KB Output is correct
33 Correct 30 ms 6236 KB Output is correct
34 Correct 22 ms 4860 KB Output is correct
35 Correct 27 ms 5892 KB Output is correct
36 Correct 26 ms 5324 KB Output is correct
37 Correct 28 ms 6284 KB Output is correct
38 Correct 35 ms 5852 KB Output is correct
39 Correct 25 ms 6024 KB Output is correct