oj.uz

답안 #521474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521474 2022-02-02T08:18:41 Z errorgorn Cijanobakterije (COCI21_cijanobakterije) C++17
70 / 70
 41 ms 22648 KB 
// Super Idol的笑容
//    都没你的甜
//  八月正午的阳光
//    都没你耀眼
//  热爱105°C的你
// 滴滴清纯的蒸馏水

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,m;
vector<int> al[100005];
bool vis[100005];

ii dfs(int i,int p){
	vis[i]=true;
	
	ll mx=1;
	vector<ll> child={0,0};
	
	for (auto &it:al[i]){
		if (it==p) continue;
		auto temp=dfs(it,i);
		mx=max(mx,temp.fi);
		child.pub(temp.se);
	}
	
	sort(all(child));
	reverse(all(child));
	
	mx=max(mx,child[0]+child[1]+1);
	return {mx,child[0]+1};
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>m;
	
	int a,b;
	rep(x,0,m){
		cin>>a>>b;
		al[a].pub(b);
		al[b].pub(a);
	}
	
	int ans=0;
	rep(x,1,n+1) if (!vis[x]) ans+=dfs(x,-1).fi;
	
	cout<<ans<<endl;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3268 KB Output is correct
2 Correct 13 ms 4044 KB Output is correct
3 Correct 19 ms 4940 KB Output is correct
4 Correct 29 ms 5624 KB Output is correct
5 Correct 33 ms 6408 KB Output is correct
6 Correct 40 ms 7108 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 22648 KB Output is correct
2 Correct 4 ms 3148 KB Output is correct
3 Correct 8 ms 3660 KB Output is correct
4 Correct 10 ms 4068 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2672 KB Output is correct
2 Correct 2 ms 2676 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2680 KB Output is correct
5 Correct 5 ms 3320 KB Output is correct
6 Correct 8 ms 4076 KB Output is correct
7 Correct 11 ms 5024 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3268 KB Output is correct
2 Correct 13 ms 4044 KB Output is correct
3 Correct 19 ms 4940 KB Output is correct
4 Correct 29 ms 5624 KB Output is correct
5 Correct 33 ms 6408 KB Output is correct
6 Correct 40 ms 7108 KB Output is correct
7 Correct 38 ms 22648 KB Output is correct
8 Correct 4 ms 3148 KB Output is correct
9 Correct 8 ms 3660 KB Output is correct
10 Correct 10 ms 4068 KB Output is correct
11 Correct 2 ms 2672 KB Output is correct
12 Correct 2 ms 2676 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 1 ms 2680 KB Output is correct
15 Correct 5 ms 3320 KB Output is correct
16 Correct 8 ms 4076 KB Output is correct
17 Correct 11 ms 5024 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 2 ms 2636 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 2 ms 2636 KB Output is correct
24 Correct 2 ms 2636 KB Output is correct
25 Correct 2 ms 2636 KB Output is correct
26 Correct 2 ms 2684 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 2 ms 2636 KB Output is correct
29 Correct 41 ms 7068 KB Output is correct
30 Correct 11 ms 3844 KB Output is correct
31 Correct 27 ms 6652 KB Output is correct
32 Correct 16 ms 4672 KB Output is correct
33 Correct 35 ms 6900 KB Output is correct
34 Correct 23 ms 5316 KB Output is correct
35 Correct 30 ms 6724 KB Output is correct
36 Correct 30 ms 5808 KB Output is correct
37 Correct 33 ms 6904 KB Output is correct
38 Correct 40 ms 6416 KB Output is correct
39 Correct 31 ms 6724 KB Output is correct