Submission #1168167

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168167		KaleemRazaSyed	새로운 문제 (POI13_luk)	C++20	90 / 100	373 ms	22520 KiB

luk

#include<bits/stdc++.h>

using namespace std;

const int N = 3e5 + 10;
vector<int> G[N];
int x;

int dfs(int v, int p = -1)
{
  int c = 0;
  vector<int> vec;
  int sm = 0;
  for(int u : G[v])
    if(u != p)
      {
	c++;
	sm += max(0, dfs(u, v));
      }
  return c + sm - x;  
}

int main()
{
  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);
    }

  int l = 0, r = n;
  while(r - l > 1)
    {
      int mid = (l + r) / 2;
      x = mid;
      if(max(0, dfs(1)) == 0)
	r = mid;
      else
	l = mid;
    }
  cout << r << endl;
  return 0;
}

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