제출 #1013889

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

luk

#include <bits/stdc++.h>
 
using namespace std;
 
#define int long long
 
const int maxn = 300005;
 
int mx = 0;
vector<int>adj[maxn];
 
void dfs(int v, int p, int dpth){
  // cout << v << ' ' << mx << ' ' << adj[v].size() - 1 << ' ' << mx - dpth << '\n';
  mx += max(0ll, (int)(adj[v].size() - (p != -1 ? 1 : 0) - max(mx - dpth, 0ll) - dpth));
  for(int i : adj[v]){
    if(i == p) continue;
    dfs(i, v, dpth + 1);
  }
}
 
signed main()
{
  cin.tie(0) -> sync_with_stdio(0);
  int n;
  cin >> n;
 
  for(int i = 0; i < n - 1; i++){
    int u, v;
    cin >> u >> v;
 
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  // cout << '\n';
 
  dfs(1, -1, 0);
 
  cout << mx;
}

• 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