Submission #19541302

---

Source Code Expand

/* in the name of Anton */

/*
  Compete against Yourself.
  Author - Aryan Choudhary (@aryanc403)
*/

#ifdef ARYANC403
    #include "/home/aryan/codes/PastCodes/template/header.h"
#else
    #pragma GCC optimize ("Ofast")
    #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
    #pragma GCC optimize ("-ffloat-store")
    #include<iostream>
    #include<bits/stdc++.h>
    #define dbg(args...)
#endif

using namespace std;
#define fo(i,n)   for(i=0;i<(n);++i)
#define repA(i,j,n)   for(i=(j);i<=(n);++i)
#define repD(i,j,n)   for(i=(j);i>=(n);--i)
#define all(x) begin(x), end(x)
#define sz(x) ((lli)(x).size())
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define endl "\n"

typedef long long int lli;
typedef long double mytype;
typedef pair<lli,lli> ii;
typedef vector<ii> vii;
typedef vector<lli> vi;


const auto start_time = std::chrono::high_resolution_clock::now();
void aryanc403()
{
#ifdef ARYANC403
auto end_time = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> diff = end_time-start_time;
    cerr<<"Time Taken : "<<diff.count()<<"\n";
#endif
}

const lli INF = 0xFFFFFFFFFFFFFFFL;

lli seed;
mt19937 rng(seed=chrono::steady_clock::now().time_since_epoch().count());
inline lli rnd(lli l=0,lli r=INF)
{return uniform_int_distribution<lli>(l,r)(rng);}

class CMP
{public:
bool operator()(ii a , ii b) //For min priority_queue .
{    return ! ( a.X < b.X || ( a.X==b.X && a.Y <= b.Y ));   }};

void add( map<lli,lli> &m, lli x,lli cnt=1)
{
    auto jt=m.find(x);
    if(jt==m.end())         m.insert({x,cnt});
    else                    jt->Y+=cnt;
}

void del( map<lli,lli> &m, lli x,lli cnt=1)
{
    auto jt=m.find(x);
    if(jt->Y<=cnt)            m.erase(jt);
    else                      jt->Y-=cnt;
}

bool cmp(const ii &a,const ii &b)
{
    return a.X<b.X||(a.X==b.X&&a.Y<b.Y);
}

const lli mod = 1000000007L;
// const lli maxN = 1000000007L;

    lli T,n,i,j,k,in,cnt,l,r,u,v,x,y;
    lli m;
    string s;
    vector<vi> e;
    lli A,B;
    //priority_queue < ii , vector < ii > , CMP > pq;// min priority_queue .

lli dfs(lli u,lli p)
{
    vi b;
    lli cnt=0;
    for(auto x:e[u])
    {
        if(x==p)
            continue;
        b.pb(dfs(x,u));
        cnt++;
    }
    dbg(u,p,e[u],b);
    A+=cnt/2;
    if(sz(b)%2==0)
        b.pb(0);
    sort(all(b));

    if(b.back()>B)
        A=INF;
    auto chk=[b,B](const lli m)-> bool {
        lli i=0,j=sz(b)-1;
        if(i==m)
            i++;
        if(j==m)
            j--;
        while(i<j)
        {
            if(b[i]+b[j]>B)
                return false;
            i++;j--;
            if(i==m)
                i++;
            if(j==m)
                j--;
        }
        return true;
    };
    lli l=-1,r=sz(b);
    while(r-l>1)
    {
        const lli m=(r+l)/2;
        if(chk(m))
            r=m;
        else
            l=m;
    }

    return b[r]+1;
}

int main(void) {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    // freopen("txt.in", "r", stdin);
    // freopen("txt.out", "w", stdout);
// cout<<std::fixed<<std::setprecision(35);
// cin>>T;while(T--)
{

    cin>>n;
    e.resize(n);
    fo(i,n-1)
    {
        cin>>u>>v;
        u--;v--;
        e[u].pb(v);
        e[v].pb(u);
    }

    if(n==2)
    {
        cout<<"1 1"<<endl;
        return 0;
    }

    lli rt=0;
    fo(rt,n)
    {
        if(sz(e[rt])!=1)
            continue;
        break;
    }

    B=INF;
    A=1;
    dfs(rt,-1);
    dbg(A,B);
    const lli noA=A;
    lli l=0,r=INF;
    while(r-l>1)
    {
        B=(l+r)/2;
        A=1;
        if(dfs(rt,-1)-1>B)
            A=INF;
        dbg(B,A,noA);
        if(A<=noA)
            r=B;
        else
            l=B;
    }
    cout<<noA<<" "<<r<<endl;
}   aryanc403();
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘lli dfs(lli, lli)’:
./Main.cpp:108:17: warning: capture of variable ‘B’ with non-automatic storage duration
  108 |     auto chk=[b,B](const lli m)-> bool {
      |                 ^
./Main.cpp:86:11: note: ‘lli B’ declared here
   86 |     lli A,B;
      |           ^

Judge Result