oj.uz

Submission #666281

# Submission time Handle Problem Language Result Execution time Memory
666281 2022-11-28T05:45:50 Z Chal1shkan Cijanobakterije (COCI21_cijanobakterije) C++14
70 / 70
 46 ms 12112 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, 0, 0);
			cur = 0;
			dfs(vv, vv, 0, 1);
			ans += cur + 1;
		//	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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3284 KB Output is correct
2 Correct 11 ms 3924 KB Output is correct
3 Correct 16 ms 4564 KB Output is correct
4 Correct 33 ms 5224 KB Output is correct
5 Correct 29 ms 5772 KB Output is correct
6 Correct 37 ms 6428 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 12112 KB Output is correct
2 Correct 4 ms 3068 KB Output is correct
3 Correct 7 ms 3668 KB Output is correct
4 Correct 9 ms 4096 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 2644 KB Output is correct
5 Correct 4 ms 3156 KB Output is correct
6 Correct 7 ms 3980 KB Output is correct
7 Correct 10 ms 4732 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 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 2644 KB Output is correct
7 Correct 2 ms 2684 KB Output is correct
8 Correct 2 ms 2596 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3284 KB Output is correct
2 Correct 11 ms 3924 KB Output is correct
3 Correct 16 ms 4564 KB Output is correct
4 Correct 33 ms 5224 KB Output is correct
5 Correct 29 ms 5772 KB Output is correct
6 Correct 37 ms 6428 KB Output is correct
7 Correct 28 ms 12112 KB Output is correct
8 Correct 4 ms 3068 KB Output is correct
9 Correct 7 ms 3668 KB Output is correct
10 Correct 9 ms 4096 KB Output is correct
11 Correct 1 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 1 ms 2644 KB Output is correct
15 Correct 4 ms 3156 KB Output is correct
16 Correct 7 ms 3980 KB Output is correct
17 Correct 10 ms 4732 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 1 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 2644 KB Output is correct
24 Correct 2 ms 2684 KB Output is correct
25 Correct 2 ms 2596 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 46 ms 7656 KB Output is correct
30 Correct 8 ms 3796 KB Output is correct
31 Correct 25 ms 6672 KB Output is correct
32 Correct 15 ms 4724 KB Output is correct
33 Correct 38 ms 7268 KB Output is correct
34 Correct 21 ms 5392 KB Output is correct
35 Correct 28 ms 6860 KB Output is correct
36 Correct 29 ms 6100 KB Output is correct
37 Correct 32 ms 7236 KB Output is correct
38 Correct 35 ms 6732 KB Output is correct
39 Correct 26 ms 6876 KB Output is correct