제출 #1168157

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168157		Rafiullah	새로운 문제 (POI13_luk)	C++20	0 / 100	186 ms	21500 KiB

luk

#include <bits/stdc++.h>
#define fi first
#define se second
#define bupo __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define int long long
const int LOG = 16, MAXB = 1<<LOG, SQR = 1<<10;
const ll MOD = 1e9+7;
const int mod = 998244353;
const int N = 3e5 + 5;
vector<int> G[N];int dp[N];
void dfs(int node,int par = 0){
    int c = 0;
    for(int ch : G[node]){
        if(par == ch)continue;
        dfs(ch,node);
        c++, dp[node] = max(dp[node],dp[ch]);
    }
    dp[node] = max(dp[node], c);
}
void solve(){
    int n;cin >> n;
    for(int i = 1 ; i < n ; i ++){
        int u,v;cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(1);
    cout << dp[1] << '\n';
}
signed main(){
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
}

• 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