Submission #19541302


Source Code Expand

Copy
/* 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

Submission Time
Task F - Christmas Tree
User aryanc403
Language C++ (GCC 9.2.1)
Score 0
Code Size 4001 Byte
Status WA
Exec Time 997 ms
Memory 21148 KB

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

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 3
AC × 70
WA × 5
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, 65.txt, 66.txt, 67.txt, 68.txt, 69.txt, 70.txt, 71.txt, 72.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 817 ms 9160 KB
02.txt AC 805 ms 9184 KB
03.txt AC 800 ms 9196 KB
04.txt AC 805 ms 9200 KB
05.txt AC 750 ms 21068 KB
06.txt AC 750 ms 21148 KB
07.txt AC 876 ms 12608 KB
08.txt AC 923 ms 14720 KB
09.txt AC 907 ms 14480 KB
10.txt AC 886 ms 15572 KB
11.txt AC 926 ms 10100 KB
12.txt AC 921 ms 10112 KB
13.txt AC 929 ms 10220 KB
14.txt AC 950 ms 10208 KB
15.txt AC 791 ms 9240 KB
16.txt AC 806 ms 9172 KB
17.txt AC 754 ms 8928 KB
18.txt AC 701 ms 8972 KB
19.txt AC 662 ms 9024 KB
20.txt AC 638 ms 8932 KB
21.txt AC 654 ms 8908 KB
22.txt AC 651 ms 10292 KB
23.txt AC 704 ms 14188 KB
24.txt AC 748 ms 16828 KB
25.txt AC 813 ms 9244 KB
26.txt AC 808 ms 9196 KB
27.txt AC 749 ms 8944 KB
28.txt AC 699 ms 8972 KB
29.txt AC 692 ms 8968 KB
30.txt AC 664 ms 8908 KB
31.txt AC 681 ms 9196 KB
32.txt WA 652 ms 10552 KB
33.txt AC 749 ms 19824 KB
34.txt AC 754 ms 19004 KB
35.txt AC 800 ms 9160 KB
36.txt AC 813 ms 9768 KB
37.txt AC 817 ms 9240 KB
38.txt AC 741 ms 8924 KB
39.txt AC 711 ms 8976 KB
40.txt AC 648 ms 8916 KB
41.txt AC 640 ms 8896 KB
42.txt AC 650 ms 9992 KB
43.txt AC 745 ms 16132 KB
44.txt AC 717 ms 15544 KB
45.txt AC 797 ms 9232 KB
46.txt AC 787 ms 9192 KB
47.txt AC 814 ms 9172 KB
48.txt AC 729 ms 9000 KB
49.txt AC 683 ms 8944 KB
50.txt AC 643 ms 8972 KB
51.txt AC 646 ms 8920 KB
52.txt AC 644 ms 10080 KB
53.txt AC 719 ms 14728 KB
54.txt AC 708 ms 14480 KB
55.txt WA 997 ms 11240 KB
56.txt WA 963 ms 11220 KB
57.txt AC 993 ms 11256 KB
58.txt AC 966 ms 11240 KB
59.txt AC 817 ms 12608 KB
60.txt WA 822 ms 11572 KB
61.txt AC 831 ms 14040 KB
62.txt AC 831 ms 12708 KB
63.txt AC 817 ms 13136 KB
64.txt AC 867 ms 16108 KB
65.txt AC 918 ms 14876 KB
66.txt AC 836 ms 18056 KB
67.txt AC 2 ms 3584 KB
68.txt AC 2 ms 3612 KB
69.txt AC 2 ms 3580 KB
70.txt AC 2 ms 3532 KB
71.txt WA 3 ms 3460 KB
72.txt AC 2 ms 3576 KB
s1.txt AC 3 ms 3484 KB
s2.txt AC 4 ms 3584 KB
s3.txt AC 2 ms 3576 KB