oj.uz

답안 #666278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
666278 2022-11-28T05:42:17 Z Chal1shkan Cijanobakterije (COCI21_cijanobakterije) C++14
15 / 70
 176 ms 12280 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 = 1;
			dfs(i, i, 1, 0);
			cur = 1;
			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 3412 KB Output is correct
2 Correct 11 ms 3976 KB Output is correct
3 Correct 16 ms 4692 KB Output is correct
4 Correct 24 ms 5356 KB Output is correct
5 Correct 33 ms 5988 KB Output is correct
6 Correct 38 ms 6628 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 142 ms 12280 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 176 ms 3360 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Incorrect 2 ms 2644 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3412 KB Output is correct
2 Correct 11 ms 3976 KB Output is correct
3 Correct 16 ms 4692 KB Output is correct
4 Correct 24 ms 5356 KB Output is correct
5 Correct 33 ms 5988 KB Output is correct
6 Correct 38 ms 6628 KB Output is correct
7 Incorrect 142 ms 12280 KB Output isn't correct
8 Halted 0 ms 0 KB -