답안 #412103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
412103	2021-05-26T14:04:23 Z	b00n0rp	Meetings 2 (JOI21_meetings2)	C++17	0 / 100	17 ms	23880 KB

meetings2

// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/ 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <bits/stdc++.h>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, 
// tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 200005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
/*
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
*/
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES)
    // cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM)
        // printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n;
vi adj[MAXN];
int dep[MAXN];
int sz[MAXN];
int par[MAXN][21];
bitset<MAXN> vis;
int centroid;

int cenpar[MAXN];
vi ceng[MAXN];

int tot;

vi gg[MAXN];
int ans[MAXN];
int mxd[MAXN];
multiset<int> bruh[MAXN];
int res = 1;

void dfs(int u,int p,int d){
    tot++;
    dep[u] = d;
    par[u][0] = p;
    sz[u] = 1;
    for(auto v:adj[u]){
        if(v == p or vis[v]) continue;
        dfs(v,u,d+1);
        sz[u]+=sz[v];
    }
}

int fc(int u,int p){
    for(auto v:adj[u]){
        if(v == p or vis[v]) continue;
        if(sz[v]*2 > tot) return fc(v,u);
    }
    return u;
}

void centroid_decomposition(int u,int p){
    tot = 0;
    dfs(u,u,0);
    int c = fc(u,u);
    vis[c] = 1;
    cenpar[c] = p;
    if(p != -1){
        ceng[p].pb(c);
    }
    else centroid = c;
    for(auto v:adj[c]){
        if(!vis[v]) centroid_decomposition(v,c);
    }
}

int dist(int u,int v){
    int d = 0;
    if(dep[u] > dep[v]) swap(u,v);
    FORD(j,20,0){
        if(dep[v]-(1<<j) >= dep[u]){
            d += (1<<j);
            v = par[v][j];
        }
    }
    if(u == v) return d;
    FORD(j,20,0){
        if(par[u][j] != par[v][j]){
            d += 2*(1<<j);
            u = par[u][j];
            v = par[v][j];
        }
    }
    return d+2;
}

void update(int u){
    int cur = u;
    while(cur != centroid){
        if(mxd[cur] != 0) bruh[cenpar[cur]].erase(bruh[cenpar[cur]].find(mxd[cur]));
        remax(mxd[cur],dist(u,cenpar[cur])+1);
        bruh[cenpar[cur]].insert(mxd[cur]);
        if(SZ(bruh[cenpar[cur]]) == 1) remax(res,mxd[cur]);
        else{
            int lol = 0;
            auto it = bruh[cenpar[cur]].rbegin();
            lol += (*it);
            it++;
            lol += (*it);
            remax(res,lol-1);
        }
        cur = cenpar[cur];
    }
}
 
void solvethetestcase(){
    cin >> n;
    REP(i,n-1){
        int u,v; cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    centroid_decomposition(1,-1);
    vis.reset();
    dfs(centroid,centroid,0);
    FOR(j,1,21){
        FOR(i,1,n+1){
            par[i][j] = par[par[i][j-1]][j-1];
        }
    }
    FOR(i,1,n+1){
        gg[sz[i]].pb(i);
        ans[i] = 1;
    }
    FORD(i,n,1){
        for(auto x:gg[i]){
            update(x);
        }
        if(i*2 <= n) ans[2*i] = res;
    }
    FOR(i,1,n+1){
        cout << ans[i] << "\n";
    }
}

Subtask #1
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	23756 KB	Output is correct
2	Correct	15 ms	23864 KB	Output is correct
3	Correct	16 ms	23756 KB	Output is correct
4	Correct	15 ms	23756 KB	Output is correct
5	Correct	16 ms	23784 KB	Output is correct
6	Correct	16 ms	23868 KB	Output is correct
7	Correct	16 ms	23784 KB	Output is correct
8	Correct	14 ms	23756 KB	Output is correct
9	Correct	14 ms	23776 KB	Output is correct
10	Correct	16 ms	23816 KB	Output is correct
11	Correct	16 ms	23852 KB	Output is correct
12	Correct	17 ms	23880 KB	Output is correct
13	Incorrect	15 ms	23756 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #2
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	23756 KB	Output is correct
2	Correct	15 ms	23864 KB	Output is correct
3	Correct	16 ms	23756 KB	Output is correct
4	Correct	15 ms	23756 KB	Output is correct
5	Correct	16 ms	23784 KB	Output is correct
6	Correct	16 ms	23868 KB	Output is correct
7	Correct	16 ms	23784 KB	Output is correct
8	Correct	14 ms	23756 KB	Output is correct
9	Correct	14 ms	23776 KB	Output is correct
10	Correct	16 ms	23816 KB	Output is correct
11	Correct	16 ms	23852 KB	Output is correct
12	Correct	17 ms	23880 KB	Output is correct
13	Incorrect	15 ms	23756 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #3
0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	23756 KB	Output is correct
2	Correct	15 ms	23864 KB	Output is correct
3	Correct	16 ms	23756 KB	Output is correct
4	Correct	15 ms	23756 KB	Output is correct
5	Correct	16 ms	23784 KB	Output is correct
6	Correct	16 ms	23868 KB	Output is correct
7	Correct	16 ms	23784 KB	Output is correct
8	Correct	14 ms	23756 KB	Output is correct
9	Correct	14 ms	23776 KB	Output is correct
10	Correct	16 ms	23816 KB	Output is correct
11	Correct	16 ms	23852 KB	Output is correct
12	Correct	17 ms	23880 KB	Output is correct
13	Incorrect	15 ms	23756 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

답안 #412103

Compilation message

Subtask #1 0 / 4.0

Subtask #2 0 / 16.0

Subtask #3 0 / 80.0

Subtask #1
0 / 4.0

Subtask #2
0 / 16.0

Subtask #3
0 / 80.0