Submission #2540898

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

int N;
vvi nxt, d;
vi rad;
vi nchild;

llll sub(int root){
#ifdef DEBUG
    //fprintf(stderr, "sub(root=%d)\n", root);
#endif
    queue<pair<ii,vi>> q;
    q.push(make_pair(llll(1,nchild[root]), vi(1, root))); // (color,dup), vi
    vi visited(N, 0);

    int maxcolor = 0;
    ll maxdup = 0;
    while (!q.empty()) {
        int color = q.front().first.first;
        ll dup = q.front().first.second;
        maxcolor = max(maxcolor, color);
        vi layer = q.front().second;
        int maxch = 1;
        for(int u:layer){
            visited[u] = 1;
            maxch = max(maxch, nchild[root]-1);
        }
        q.pop();
        //cerr << "L" << color << " x " << dup << " : " << layer << endl;
        vi sublayer;
//        int maxch = 1;
        for(int u:layer){
            for(int v:nxt[u]){
                if (visited[v]) continue;
                sublayer.pb(v);
//                maxch = max(maxch, nchild[v]);
            }
        }
        maxdup = max(maxdup, dup*maxch);
        if (sublayer.size() > 0) {
            q.push(make_pair(llll(color+1,dup*maxch), sublayer));
        }
    }
    return llll(maxcolor,maxdup);
}
llll sub2(int u, int v){
#ifdef DEBUG
    fprintf(stderr, "sub2(%d,%d)\n", u,v);
#endif
    queue<pair<ii,vi>> q;
    vi v0 { u, v};
    int x= 2;//nchild[u] + nchild[v];
    q.push(make_pair(llll(1,x), v0)); // (color,dup), vi
    vi visited(N, 0);

    int maxcolor = 0;
    ll maxdup = 0;
    while (!q.empty()) {
        int color = q.front().first.first;
        ll dup = q.front().first.second;
        maxcolor = max(maxcolor, color);
        vi layer = q.front().second;
        int maxch = 1;
        for(int u:layer){
            visited[u] = 1;
            maxch = max(maxch, nchild[u]-1);
        }
        q.pop();
#ifdef DEBUG
        cerr << "L" << color << " x " << dup << " : " << layer << endl;
#endif
        vi sublayer;

        for(int u:layer){
            for(int v:nxt[u]){
                if (visited[v]) continue;
                sublayer.pb(v);
            //    maxch = max(maxch, nchild[v]);
            }
        }
        maxdup = max(maxdup, dup*maxch);
        if (sublayer.size() > 0) {
            q.push(make_pair(llll(color+1,dup*maxch), sublayer));
        }
    }
    return llll(maxcolor,maxdup);
}

void solve(){
    d.assign(N, vi(N, N*2));
    rep(i,N) d[i][i] = 0;
    rep(u,N){
        for (int v:nxt[u]) d[u][v] = d[v][u] = 1;
    }
    rep(k,N) rep(i,N) rep(j,N) d[i][j] = min(d[i][j], d[i][k]+d[k][j]);

    rad.assign(N, 0);
    nchild.assign(N, 0);
    rep(i,N) {
        rep(j,N) rad[i] = max(rad[i], d[i][j]);
        nchild[i] = nxt[i].size();
    }

#ifdef DEBUG
    rep(i,N) {
        rep(j,N) {
            fprintf(stderr, " %2d", d[i][j]);
        }
        cerr << endl;
    }
    cerr << "rad: " << rad << endl;
#endif

    llll ans(0x7fffffffffffffffLL, 0x7fffffffffffffffLL);
    set<ii> visited_edges;
    rep(root, N){
        llll score = sub(root);
        ans = min(ans, score);
        for(int v: nxt[root]){
            ii e(min(root,v), max(root,v));
            if (!found(visited_edges, e)){
                visited_edges.insert(e);
                llll score2 = sub2(root, v);
                ans = min(ans, score2);
            }
        }
    }
    printf("%lld %lld\n", ans.first, ans.second);
}

int main() {
    cin >>N;
    nxt.assign(N, vi());
    rep(i,N-1){
        int a,b; cin>>a>>b; --a;--b;
        nxt[a].pb(b);
        nxt[b].pb(a);
    }
    solve();
    return 0;
}

Submission Info

Judge Result