제출 #371604

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
371604		evn	새로운 문제 (POI13_luk)	C++14	0 / 100	285 ms	22440 KiB

luk

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
typedef long long ll;
typedef pair<int, int> pii;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int N;
vector<int> adj[300005];
int dp[300005];
void dfs(int u, int p){
	int child = 0;
	for(int v : adj[u]){
		if(v!=p){
			child++;
			dfs(v, u);
		}
	}
	dp[u] = child;
	for(int v : adj[u]){
		if(v != p){
			dp[u] = max(dp[u], dp[v]);
		}
	}
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> N;
	for(int i = 0; i < N-1;i ++){
		int a, b;
		cin >> a >> b;
		a--; b--;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	dfs(0, -1);
	cout << dp[0] << '\n';

}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10