Codeforces Round #300 E. Demiurges Play Again CF538E

首先考虑二分答案
假设是求max 那么把>=mid 的数字都变成1 另外的都变为0

假设是A操作的时候那么肯定选一个需要放1尽量少的儿子下去
（因为二分的是mid）
假设是B操作那么要让他底下能选的地方都是1才能让他选到>=mid

那么其实这样算出来的其实就是答案了

当求min的时候就反过来

A操作的时候要让底下能选的都是0
B操作的时候选一个最少的0的下去

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ans() printf("%d",ans)
#define ansn() printf("%d\n",ans)
#define anss() printf("%d ",ans)
#define lans() printf("%lld",ans)
#define lanss() printf("%lld ",ans)
#define lansn() printf("%lld\n",ans)
#define fansn() printf("%.10f\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define rsz(i,v) for(int i=0;i<(int)v.size();++i)
#define szz(x) ((int)x.size())
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pli pair<ll,int>
#define pll pair<ll,ll>
#define mp make_pair
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
#define sqr(a) ((a)*(a))
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1000000000+7;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
const ll infl = 10000000000000000;
const int maxn=  200000+10;
const int maxm = 40000+10;
//Pretests passed
int in(int &ret)
{
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}


vector<int>g[maxn];
int leave;
bool bot[maxn];
void dfs(int u,int f)
{
    int cnt = 0;
    rsz(i,g[u])
    {
        int v = g[u][i];
        if(v==f)continue;
        cnt++;
        dfs(v,u);
    }
    if(!cnt)++leave,bot[u]=1;
}
int dfs1(int u,int lev,int f)
{
    int sz = g[u].size();
    if(bot[u])return 1;
    if(lev&1)
    {
        int mn = inf;
        r0(i,sz)
        {
            int v = g[u][i];
            if(v==f)continue;
            mn = min(mn,dfs1(v,lev+1,u));
        }
//        if(mn==inf)mn = 1;
        return mn;
    }
    else
    {
        int res = 0;
        r0(i,sz)
        {
            int v = g[u][i];
            if(v==f)continue;
            res += dfs1(v,lev+1,u);
        }
//        if(!res)res = 1;
        return  res;
    }
}
int main()
{
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL

    int n;
    sd(n);
    r1(i,n-1)
    {
        int u,v;
        sdd(u,v);
        g[u].pb(v);
        g[v].pb(u);
    }
    dfs(1,0);
    int mx = dfs1(1,1,0);
    mx = leave +1 - mx;
    int mn = dfs1(1,0,0);
//    mn = leave +1 - mn;
    printf("%d %d",mx,mn);
    return 0;
}