Submission #19539448


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)
{
    if(sz(e[u])==1)
        return 1;
    map<lli,lli> bb;
    lli cnt=0;
    for(auto x:e[u])
    {
        if(x==p)
            continue;
        bb[dfs(x,u)]++;
        cnt++;
    }

    dbg(bb,cnt,B);
    while(cnt>1)
    {
        auto mx=bb.rbegin()->X;
        del(bb,mx);
        cnt--;
        A++;
        auto it=bb.upper_bound(B-mx);
        dbg(mx,B-mx,bb,cnt);
        if(it==bb.begin())
            continue;
        dbg(mx,it->X,"Hello");
        --it;
        del(bb,it->X);
        cnt--;
    }

    if(p==-1&&cnt)
        A++;
    if(cnt==0)
        return 1;
    if(cnt&&bb.begin()->X==B)
    {
        A++;
        return 1;
    }
    return bb.begin()->X+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;
    dfs(rt,-1);
    dbg(A,B);
    const lli noA=A;
    lli l=0,r=INF;
    while(r-l>1)
    {
        B=(l+r)/2;
        A=0;
        dfs(rt,-1);
        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 3845 Byte
Status WA
Exec Time 707 ms
Memory 21904 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 3
AC × 52
WA × 23
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 525 ms 9096 KB
02.txt AC 522 ms 9204 KB
03.txt AC 523 ms 9176 KB
04.txt AC 537 ms 9252 KB
05.txt AC 704 ms 19824 KB
06.txt AC 707 ms 21904 KB
07.txt AC 695 ms 16596 KB
08.txt AC 694 ms 14484 KB
09.txt AC 684 ms 14684 KB
10.txt AC 677 ms 14720 KB
11.txt AC 124 ms 9628 KB
12.txt AC 119 ms 9504 KB
13.txt AC 122 ms 9608 KB
14.txt AC 121 ms 9728 KB
15.txt WA 521 ms 9264 KB
16.txt AC 506 ms 9144 KB
17.txt WA 565 ms 9004 KB
18.txt WA 549 ms 8972 KB
19.txt WA 522 ms 9004 KB
20.txt WA 520 ms 8876 KB
21.txt WA 517 ms 9156 KB
22.txt WA 531 ms 10284 KB
23.txt AC 657 ms 19732 KB
24.txt AC 651 ms 18976 KB
25.txt AC 509 ms 9252 KB
26.txt AC 494 ms 9228 KB
27.txt AC 559 ms 8988 KB
28.txt WA 547 ms 8848 KB
29.txt WA 545 ms 8620 KB
30.txt WA 536 ms 8892 KB
31.txt WA 528 ms 9148 KB
32.txt WA 541 ms 10464 KB
33.txt AC 694 ms 19500 KB
34.txt AC 701 ms 17624 KB
35.txt AC 520 ms 9264 KB
36.txt AC 356 ms 9704 KB
37.txt WA 515 ms 9236 KB
38.txt WA 570 ms 8912 KB
39.txt WA 558 ms 8876 KB
40.txt WA 539 ms 8940 KB
41.txt WA 539 ms 9160 KB
42.txt AC 544 ms 10852 KB
43.txt AC 688 ms 14984 KB
44.txt AC 630 ms 14548 KB
45.txt AC 511 ms 9232 KB
46.txt AC 538 ms 9200 KB
47.txt WA 525 ms 9236 KB
48.txt WA 556 ms 8916 KB
49.txt WA 553 ms 8968 KB
50.txt WA 527 ms 8944 KB
51.txt WA 538 ms 9228 KB
52.txt WA 546 ms 9672 KB
53.txt AC 593 ms 13332 KB
54.txt AC 681 ms 16860 KB
55.txt AC 121 ms 9436 KB
56.txt AC 119 ms 9580 KB
57.txt AC 120 ms 9508 KB
58.txt AC 121 ms 9564 KB
59.txt AC 382 ms 13740 KB
60.txt AC 376 ms 12656 KB
61.txt AC 381 ms 13116 KB
62.txt AC 384 ms 12608 KB
63.txt AC 382 ms 13104 KB
64.txt AC 365 ms 15440 KB
65.txt AC 265 ms 12620 KB
66.txt AC 466 ms 14268 KB
67.txt AC 4 ms 3520 KB
68.txt AC 2 ms 3608 KB
69.txt AC 2 ms 3520 KB
70.txt AC 2 ms 3592 KB
71.txt AC 2 ms 3448 KB
72.txt AC 2 ms 3400 KB
s1.txt AC 4 ms 3528 KB
s2.txt AC 3 ms 3628 KB
s3.txt AC 5 ms 3592 KB