제출 #1143580

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143580		SonicML	Triumphal arch (POI13_luk)	C++20	100 / 100	637 ms	23928 KiB

luk

#include <iostream>
#include <vector>

using namespace std;

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

int DFS(int node, int parent, int crews) {
  int extraCrew = 0;
  for(int i = 0;i < g[node].size();i++) {
    int to = g[node][i]; 
    if(to != parent) {
      extraCrew += DFS(to, node, crews) + 1;
    }
  }
  return max(extraCrew - crews, 0);
}

int cautbin(int from, int to) {
  if(from >= to) {
    return from;
  }else {
    int mid = (from + to) / 2;
    if(DFS(1, 1, mid) == 0) { 
      return cautbin(from, mid);
    }else {
      return cautbin(mid+1, to);
    }
  }
}
int main() {

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

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