제출 #1143286

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143286		SonicML	새로운 문제 (POI13_luk)	C++20	30 / 100	196 ms	21580 KiB

luk

#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;

int n;

int const NMAX = 3e5;
vector <ll> g[1 + NMAX];
ll depth[1 + NMAX];

ll ans = 0;

ll cautbin(ll from, ll to, ll target, ll mult) {
  if(from >= to) {
    return from;
  }else {
    ll mid = (from + to) / 2;
    if(1LL * mid * mult >= target) {
      return cautbin(from, mid, target, mult);
    }else {
      return cautbin(mid+1, to, target, mult);
    }
  }
}

void DFS(ll node, ll parent, ll arc, ll builder) {
  depth[node] = depth[parent]+1;
  for(ll i = 0;i < g[node].size();i++) {
    ll to = g[node][i];
    if(to != parent) {
      arc++;
    }
  }
  ll adder = cautbin(builder, n, arc, depth[node]);
  builder = max(builder, adder);
  ans = max(ans, builder);
  for(ll i = 0;i < g[node].size();i++) {
    ll to = g[node][i];
    if(to != parent) {
      DFS(to, node, arc, builder);
    }
  }
}

int main() {

  cin >> n;
  for(ll i = 1;i < n;i++) {
    ll a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  DFS(1, 1, 0, 0);
  cout << ans << '\n';
  return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 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