結果
| 問題 | No.3405 Engineering University of Tree |
| コンテスト | |
| ユーザー |
 Taiki0715
|
| 提出日時 | 2026-11-04 22:52:08 |
| 言語 | C++23 (gcc 15.3.0 + boost 1.92.0 + ACL) |
| 結果 |
AC
不安定
|
| 実行時間 | 1,241 ms / 2,000 ms |
| + 395µs | |
| コード長 | 16,380 bytes |
| 記録 | |
| コンパイル時間 | 3,177 ms |
| コンパイル使用メモリ | 354,808 KB |
| 実行使用メモリ | 17,948 KB |
| 最終ジャッジ日時 | 2026-11-04 22:52:25 |
| 合計ジャッジ時間 | 12,791 ms |
|
ジャッジサーバーID （参考情報） |
judge2_0 / judge7_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 22 |
ソースコード
#include<cassert>
#include <bits/stdc++.h>
#ifndef IO_HPP
#define IO_HPP
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<array>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
using namespace std;
template<typename T1,typename T2>istream &operator>>(istream&,pair<T1,T2>&);
template<typename...Args>istream &operator>>(istream&,tuple<Args...>&a);
template<typename T>istream &operator>>(istream&is,vector<T>&a);
template<typename T,size_t N>istream &operator>>(istream&is,array<T,N>&a);
template<typename T1,typename T2>
istream &operator>>(istream&is,pair<T1,T2>&a){
is>>a.first>>a.second;
return is;
}
template<size_t pos,typename...Args>
void read_tuple(istream&is,tuple<Args...>&a){
if constexpr(pos<tuple_size<tuple<Args...>>::value){
is>>get<pos>(a);
read_tuple<pos+1>(is,a);
}
}
template<typename...Args>
istream &operator>>(istream&is,tuple<Args...>&a){
read_tuple<0>(is,a);
return is;
}
template<typename T>
istream &operator>>(istream&is,vector<T>&a){
for(T&x:a)is>>x;
return is;
}
template<typename T,size_t N>
istream &operator>>(istream&is,array<T,N>&a){
for(T&x:a)is>>x;
return is;
}
template<typename T1,typename T2>ostream &operator<<(ostream&os,const pair<T1,T2>&);
template<typename...Args>ostream &operator<<(ostream&os,const tuple<Args...>&);
template<typename T>ostream &operator<<(ostream&os,const vector<T>&);
template<typename T,typename Seq,typename Comp>ostream &operator<<(ostream&os,priority_queue<T,Seq,Comp>);
template<typename T>ostream &operator<<(ostream&os,queue<T>);
template<typename T>ostream &operator<<(ostream&os,deque<T>);
template<typename T>ostream &operator<<(ostream&os,stack<T>);
template<typename T,size_t N>ostream &operator<<(ostream&os,const array<T,N>&);
template<typename Key,typename Val,typename Comp>ostream &operator<<(ostream&os,const map<Key,Val,Comp>&);
template<typename Key,typename Val,typename Hash>ostream &operator<<(ostream&os,const unordered_map<Key,Val,Hash>&);
template<typename T,typename Comp>ostream &operator<<(ostream&os,const set<T,Comp>&);
template<typename T,typename Comp>ostream &operator<<(ostream&os,const multiset<T,Comp>&);
template<typename T,typename Hash>ostream &operator<<(ostream&os,const unordered_set<T,Hash>&);
template<typename T1,typename T2>
ostream &operator<<(ostream&os,const pair<T1,T2>&a){
os<<a.first<<' '<<a.second;
return os;
}
template<size_t pos,typename...Args>
void write_tuple(ostream&os,const tuple<Args...>&a){
if constexpr(pos<tuple_size<tuple<Args...>>::value){
if constexpr(pos>0)os<<' ';
os<<get<pos>(a);
write_tuple<pos+1>(os,a);
}
}
template<typename...Args>
ostream &operator<<(ostream&os,const tuple<Args...>&a){
write_tuple<0>(os,a);
return os;
}
template<typename T>
ostream &operator<<(ostream&os,const vector<T>&a){
os<<'{';
for(int i=0;i<(int)a.size();i++){
os<<a[i];
if(i+1!=a.size())os<<',';
}
os<<'}';
return os;
}
template<typename T,typename Seq,typename Comp>
ostream &operator<<(ostream&os,priority_queue<T,Seq,Comp>a){
os<<'{';
if(!a.empty()){
os<<a.top();a.pop();
while(!a.empty()){
os<<',';
os<<a.top();
a.pop();
}
}
os<<'}';
return os;
}
template<typename T>
ostream &operator<<(ostream&os,queue<T>a){
os<<'{';
if(!a.empty()){
os<<a.front();a.pop();
while(!a.empty()){
os<<',';
os<<a.front();
a.pop();
}
}
os<<'}';
return os;
}
template<typename T>
ostream &operator<<(ostream&os,deque<T>a){
os<<'{';
if(!a.empty()){
os<<a.front();a.pop_front();
while(!a.empty()){
os<<',';
os<<a.front();
a.pop_front();
}
}
os<<'}';
return os;
}
template<typename T>
ostream &operator<<(ostream&os,stack<T>a){
os<<'{';
if(!a.empty()){
os<<a.top();a.pop();
while(!a.empty()){
os<<',';
os<<a.top();
a.pop();
}
}
os<<'}';
return os;
}
template<typename T,size_t N>
ostream &operator<<(ostream&os,const array<T,N>&a){
os<<'{';
for(int i=0;i<(int)a.size();i++){
os<<a[i];
if(i+1!=a.size())os<<',';
}
os<<'}';
return os;
}
template<typename Key,typename Val,typename Comp>
ostream &operator<<(ostream&os,const map<Key,Val,Comp>&a){
if(a.empty()){
os<<"{}";
return os;
}
auto itr=a.begin();
os<<"{["<<itr->first<<","<<itr->second<<']';
while(++itr!=a.end())os<<",["<<itr->first<<','<<itr->second<<']';
os<<'}';
return os;
}
template<typename Key,typename Val,typename Hash>
ostream &operator<<(ostream&os,const unordered_map<Key,Val,Hash>&a){
if(a.empty()){
os<<"{}";
return os;
}
auto itr=a.begin();
os<<"{["<<itr->first<<","<<itr->second<<']';
while(++itr!=a.end())os<<",["<<itr->first<<','<<itr->second<<']';
os<<'}';
return os;
}
template<typename T,typename Comp>
ostream &operator<<(ostream&os,const set<T,Comp>&a){
if(a.empty()){
os<<"{}";
return os;
}
auto itr=a.begin();
os<<'{'<<*itr;
while(++itr!=a.end())os<<','<<*itr;
os<<'}';
return os;
}
template<typename T,typename Comp>
ostream &operator<<(ostream&os,const multiset<T,Comp>&a){
if(a.empty()){
os<<"{}";
return os;
}
auto itr=a.begin();
os<<'{'<<*itr;
while(++itr!=a.end())os<<','<<*itr;
os<<'}';
return os;
}
template<typename T,typename Hash>
ostream &operator<<(ostream&os,const unordered_set<T,Hash>&a){
if(a.empty()){
os<<"{}";
return os;
}
auto itr=a.begin();
os<<'{'<<*itr;
while(++itr!=a.end())os<<','<<*itr;
os<<'}';
return os;
}
#endif
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int){for(auto &i:a)i--;}
using vref=typename vector<bool>::reference;
vref operator|=(vref a,bool b){a=a|b;return a;}
vref operator&=(vref a,bool b){a=a&b;return a;}
vref operator^=(vref a,bool b){a=a^b;return a;}
#define overload3(_1,_2,_3,name,...) name
#define rep1(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define reps(i,l,r) rep2(i,l,r)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)
#define yn(x) cout<<((x)?"Yes\n":"No\n")
#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())
template<typename T>
inline int fkey(vector<T>&z,T key){return lower_bound(z.begin(),z.end(),key)-z.begin();}
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
else return init;
}
#ifdef LOCAL
#include<debug.h>
#define SWITCH(a,b) (a)
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define SWITCH(a,b) (b)
#endif
struct Timer{
clock_t start;
Timer(){
start=clock();
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout<<fixed<<setprecision(16);
}
inline double now(){return (double)(clock()-start)/1000;}
#ifdef LOCAL
~Timer(){
cerr<<"time:";
cerr<<now();
cerr<<"ms\n";
}
#endif
}timer;
void SOLVE();
int main(){
int testcase=1;
//cin>>testcase;
for(int i=0;i<testcase;i++){
SOLVE();
}
}
template<typename T=int>
struct Edge{
int from,to;
T weight;
int index;
Edge(int from_,int to_,T weight_=T(),int index_=-1):from(from_),to(to_),weight(weight_),index(index_){}
Edge():from(-1),to(-1),weight(),index(-1){}
friend std::ostream &operator<<(std::ostream &os,const Edge&e){
os<<'[';
os<<"from:"<<e.from;
os<<"to:"<<e.to;
os<<"weight:"<<e.weight;
os<<"index:"<<e.index;
os<<']';
return os;
}
};
template<typename T=int>
struct Tree{
int n,r;
std::vector<Edge<T>>edge;
std::vector<Edge<T>>g;
std::vector<int>ptr;
struct tree_range{
using iterator=typename std::vector<Edge<T>>::iterator;
iterator l,r;
iterator begin()const{return l;}
iterator end()const{return r;}
int size()const{return r-l;}
bool empty()const{return !size();}
Edge<T> &operator[](int i)const{return l[i];}
};
struct const_tree_range{
using iterator=typename std::vector<Edge<T>>::const_iterator;
iterator l,r;
iterator begin()const{return l;}
iterator end()const{return r;}
int size()const{return r-l;}
bool empty()const{return !size();}
const Edge<T> &operator[](int i)const{return l[i];}
};
explicit Tree(int n_):n(n_){
edge.reserve(n-1);
}
Tree():n(0){}
Tree(int n_,const std::vector<Edge<T>>&e,bool dir=false):n(n_),r(-1),edge(e){
if(!dir)build();
else{
std::vector<bool>seen(n,false);
ptr.resize(n+1);
for(const Edge<T>&i:edge)ptr[i.from]++,ptr[i.to]++,seen[i.to]=true;
for(int i=1;i<=n;i++)ptr[i]+=ptr[i-1];
r=std::find(seen.begin(),seen.end(),false)-seen.begin();
assert(ptr[n]==n*2-2);
g.resize(ptr[n]);
for(const Edge<T>&i:edge)g[--ptr[i.to]]=Edge<T>(i.to,i.from,i.weight,i.index);
for(const Edge<T>&i:edge)g[--ptr[i.from]]=i;
}
}
template<bool weighted=false,bool index=1>
void read(){
for(int i=0;i<n-1;i++){
int u,v;
T w=T();
std::cin>>u>>v;
if constexpr(index)u--,v--;
if constexpr(weighted)std::cin>>w;
else w=1;
edge.emplace_back(u,v,w,i);
}
build();
}
template<bool index=1>
void readp(){
ptr.resize(n+1);
for(int i=1;i<n;i++){
int p;
std::cin>>p;
if constexpr(index)p--;
edge.emplace_back(p,i,1,i-1);
ptr[p]++;
ptr[i]++;
}
for(int i=1;i<=n;i++)ptr[i]+=ptr[i-1];
g.resize(n*2-2);
for(auto&&[u,v,w,i]:edge)g[--ptr[v]]=Edge<T>(v,u,w,i);
for(int i=0;i<n-1;i++){
g[--ptr[edge[i].from]]=edge[i];
}
r=0;
}
void add_edge(int u,int v){edge.emplace_back(u,v,1,edge.size());}
void add_edge(int u,int v,T w){edge.emplace_back(u,v,w,edge.size());}
void add_edge(int u,int v,T w,int idx){edge.emplace_back(u,v,w,idx);}
inline bool is_directed()const{return r!=-1;}
void build(){
r=-1;
ptr.assign(n+1,0);
for(auto&&[u,v,w,i]:edge)ptr[u]++,ptr[v]++;
for(int i=1;i<=n;i++)ptr[i]+=ptr[i-1];
assert(ptr[n]==n*2-2);
g.resize(n*2-2);
for(auto&&[u,v,w,i]:edge){
g[--ptr[u]]=Edge(u,v,w,i);
g[--ptr[v]]=Edge(v,u,w,i);
}
}
void remove_parent(int root=0){
if(r!=-1){
if(r!=root)build();
else return;
}
edge.resize(n-1);
std::vector<int>par(n,-1);
par[root]=-1;
std::queue<int>que;
que.push(root);
while(!que.empty()){
int x=que.front();
que.pop();
for(int i=ptr[x];i<ptr[x+1];){
const Edge<T>&e=g[i];
if(e.to!=par[x]){
par[e.to]=x;
assert(e.index<n-1);
edge[e.index]=e;
que.push(e.to);
i++;
}
else{
if(i+1==ptr[x+1])break;
std::swap(g[i],g[ptr[x+1]-1]);
}
}
}
r=root;
}
void re_index(){
assert((int)edge.size()==n-1);
for(int i=0;i<n-1;i++)edge[i].index=i;
build();
if(r!=-1)remove_parent(r);
}
std::vector<int>bfs_order()const{
assert(is_directed());
std::vector<int>bfs(n);
int p=0,q=0;
bfs[q++]=root();
while(p<q){
int x=bfs[p++];
for(const Edge<T>&e:(*this)[x])bfs[q++]=e.to;
}
return bfs;
}
std::vector<int>dfs_order()const{
assert(is_directed());
std::vector<int>res;
res.reserve(n);
std::vector<int>st(n);
int p=0;
st[p++]=root();
while(p){
int x=st[--p];
res.push_back(x);
p+=(*this)[x].size();
for(const Edge<T>&e:(*this)[x])st[--p]=e.to;
p+=(*this)[x].size();
}
return res;
}
std::vector<int>rbfs_order()const{
std::vector<int>bfs=bfs_order();
std::reverse(bfs.begin(),bfs.end());
return bfs;
}
void hld(){
assert(is_directed());
std::vector<int>sub(n);
for(int x:rbfs_order()){
sub[x]=1;
int mx=-1;
for(Edge<T>&e:(*this)[x]){
sub[x]+=sub[e.to];
if(mx<sub[e.to]){
mx=sub[e.to];
std::swap((*this)[x][0],e);
}
}
}
}
std::pair<std::vector<int>,std::vector<int>>in_out_order(){
assert(is_directed());
std::vector<int>in(n),out(n);
int p=0;
auto dfs=[&](auto self,int x)->void {
in[x]=p++;
for(const Edge<T>&e:(*this)[x]){
self(self,e.to);
}
out[x]=p;
};
dfs(dfs,root());
return std::make_pair(in,out);
}
std::pair<T,std::vector<int>>diameter()const{
assert(!is_directed());
static constexpr T inf=std::numeric_limits<T>::max();
std::vector<T>dst(n,inf);
dst[0]=0;
std::vector<int>que(n);
int p=0,q=1;
que[0]=0;
while(p<q){
int x=que[p++];
for(const Edge<T>&e:(*this)[x])if(dst[e.to]==inf){
dst[e.to]=dst[x]+e.weight;
que[q++]=e.to;
}
}
int u=std::max_element(dst.begin(),dst.end())-dst.begin();
std::fill(dst.begin(),dst.end(),inf);
dst[u]=0;
p=0,q=1;
que[0]=u;
while(p<q){
int x=que[p++];
for(const Edge<T>&e:(*this)[x])if(dst[e.to]==inf){
dst[e.to]=dst[x]+e.weight;
que[q++]=e.to;
}
}
int v=std::max_element(dst.begin(),dst.end())-dst.begin();
T weight=dst[v];
std::vector<int>res;
while(u!=v){
res.push_back(v);
for(const Edge<T>&e:(*this)[v])if(dst[e.to]<dst[v]){
v=e.to;
break;
}
}
res.push_back(u);
return std::make_pair(weight,res);
}
std::vector<int>path_construct(int u,int v)const{
assert(0<=u&&u<size());
assert(0<=v&&v<size());
std::vector<int>res;
auto dfs=[&](auto self,int x,int p)->bool {
res.push_back(x);
if(x==v)return true;
for(int i=ptr[x];i<ptr[x+1];i++)if(g[i].to!=p){
if(self(self,g[i].to,x))return true;
}
res.pop_back();
return false;
};
dfs(dfs,u,-1);
return res;
}
int size()const{return n;}
tree_range operator[](int i){return tree_range{g.begin()+ptr[i],g.begin()+ptr[i+1]-(r!=-1&&r!=i)};}
const_tree_range operator[](int i)const{return const_tree_range{g.begin()+ptr[i],g.begin()+ptr[i+1]-(r!=-1&&r!=i)};}
const Edge<T>& get_edge(int i)const{return edge[i];}
inline int parent(int i)const{return i==r?-1:g[ptr[i+1]-1].to;}
const Edge<T>& parent_edge(int i)const{
assert(r!=-1&&i!=r);
return g[ptr[i+1]-1];
}
inline int root()const{return r;}
typename std::vector<Edge<T>>::iterator begin(){return edge.begin();}
typename std::vector<Edge<T>>::iterator end(){return edge.end();}
typename std::vector<Edge<T>>::const_iterator begin()const{return edge.begin();}
typename std::vector<Edge<T>>::const_iterator end()const{return edge.end();}
};
void SOLVE(){
int n;
cin>>n;
Tree t(n);
vector<int>id(n-1,-1);
rep(i,n){
int c;
cin>>c;
while(c--){
int e;
cin>>e;
e--;
if(id[e]==-1)id[e]=i;
else t.add_edge(id[e],i);
}
}
t.build();
vector<int>ans(n+2);
t.remove_parent();
vector<int>ord=t.rbfs_order();
auto solve=[&](int k)->int {
vector<int>dp(n),ep(n);
for(int x:ord){
int s=0;
int c=0;
for(auto e:t[x]){
s+=ep[e.to];
if(dp[e.to]==ep[e.to])c++;
}
if(c>=k){
dp[x]=s+1;
ep[x]=s+1;
}
else if(c==k-1){
dp[x]=s;
ep[x]=s+1;
}
else{
dp[x]=s;
ep[x]=s;
}
}
return dp[0];
};
auto dfs=[&](auto self,int l,int r)->void {
if(l>=r)return;
if(ans[l-1]==ans[r]){
fill(ans.begin()+l,ans.begin()+r,ans[l-1]);
return;
}
int mid=(l+r)/2;
ans[mid]=solve(mid);
self(self,l,mid);
self(self,mid+1,r);
};
ans[0]=n+1;
dfs(dfs,1,n);
rep(i,1,n)cout<<ans[i]<<" \n"[i+1==n];
}