Submission #2540953


Source Code Expand

Copy
#define fi first
#define se second
#define fil(a,b) memset((a),(b),sizeof(a))
#define cl(a) fil(a,0)
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define rep(i,a,b) for (int i=(a),_ed=(b);i<_ed;i++)
#define per(i,a,b) for (int i=(b)-1,_ed=(a);i>=_ed;i--)
#define forg(i,gu) for (int i=gu;~i;i=e[i].next)
#define pw(x) ((ll(1))<<(x))
#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))
#define mmo(a,b) (((a)=1ll*(a)*(b)%mo)<0?(a)+=mo:(a))
void getre(){int x=0;printf("%d\n",1/x);}
void gettle(){int res=1;while(1)res<<=1;printf("%d\n",res);}
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
template<typename T,typename S>inline bool upmin(T&a,const S&b){return a>b?a=b,1:0;}
template<typename T,typename S>inline bool upmax(T&a,const S&b){return a<b?a=b,1:0;}
template<typename N,typename PN>inline N flo(N a,PN b){return a>=0?a/b:-((-a-1)/b)-1;}
template<typename N,typename PN>inline N cei(N a,PN b){return a>0?(a-1)/b+1:-(-a/b);}
template<typename N>N gcd(N a,N b){return b?gcd(b,a%b):a;}
template<typename N>inline int sgn(N a){return a>0?1:(a<0?-1:0);}
#if ( ( _WIN32 || __WIN32__ ) && __cplusplus < 201103L)
#define lld "%I64d"
#else
#define lld "%lld"
#endif
inline void gn(long long&x){
	int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');
	c=='-'?(sg=-1,x=0):(x=c-'0');
	while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;
}
inline void gn(int&x){long long t;gn(t);x=t;}
inline void gn(unsigned long long&x){long long t;gn(t);x=t;}
inline void gn(double&x){double t;scanf("%lf",&t);x=t;}
inline void gn(long double&x){double t;scanf("%lf",&t);x=t;}
inline void gs(char *s){scanf("%s",s);}
inline void gc(char &c){while((c=getchar())>126 || c<33);}
inline void pc(char c){putchar(c);}
#ifdef JCVB
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif
typedef long long ll;
typedef double db;
inline ll sqr(ll a){return a*a;}
inline db sqrf(db a){return a*a;}
const int inf=0x3f3f3f3f;
//const ll inf=0x3f3f3f3f3f3f3f3fll;
const db pi=3.14159265358979323846264338327950288L;
const db eps=1e-6;
//const int mo=0;
//int qp(int a,ll b){int n=1;do{if(b&1)n=1ll*n*a%mo;a=1ll*a*a%mo;}while(b>>=1);return n;}

int n;
vi chd[11111];

int qu[11111];
int d[11111];
int dis[11111];
int bfs(int u){
	int p=0,q=0;
	rep(i,1,n+1)dis[i]=-1;
	qu[q++]=u;
	dis[u]=0;
	while(p!=q){
		int u=qu[p++];
		for (auto v:chd[u]) {
			if(dis[v]!=-1)continue;
			dis[v]=dis[u]+1;
			qu[q++]=v;
		}
	}
}

vi leaf;

int needdeg[555];
int bfs2(){
	int p=0,q=0;
	rep(i,1,n+1)dis[i]=-1;
	rep(u,1,n+1)if(chd[u].size()==1) {
		dis[u]=0;
		qu[q++]=u;
	}
	while(p!=q){
		int u=qu[p++];
		for (auto v:chd[u]) {
			if(dis[v]!=-1)continue;
			dis[v]=dis[u]+1;
			qu[q++]=v;
		}
	}
}

ll gao() {
	cl(needdeg);
	leaf.clear();
	bfs(1);
	int u=1;
	rep(i,1,n+1)if(dis[i]>dis[u])u=i;
	bfs(u);
	int d=0;
	rep(i,1,n+1)upmax(d,dis[i]);
	rep(i,1,n+1)if(chd[i].size()==1) {
		leaf.pb(i);
	}
	int idtot=n;
	for (auto le:leaf) {
		bfs(le);
		int ma=0;
		rep(i,1,n+1)upmax(ma,dis[i]);
		int del = d - ma;
		int las=le;
		rep(j,0,del) {
			int ne = ++idtot;
			chd[las].pb(ne);
			chd[ne].pb(las);
			las=ne;
		}
	}
	n=idtot;
	bfs2();
	rep(u,1,n+1) {
		upmax(needdeg[dis[u]],chd[u].size());
	}
	ll ans=1;
	if(d%2==1) {
		rep(i,1,d/2+1)
			ans *= needdeg[i]-1;

		ans*=2;
	}else{
		rep(i,1,d/2)
			ans*=needdeg[i]-1;
		ans*=needdeg[d/2];
	}
	return ans;
}
int oldn;

vi  oldchd[111];
void clea() {
	rep(i,1,n+1)chd[i].clear();
	rep(i,1,oldn+1)chd[i]=oldchd[i];
	n=oldn;
}
int main()
{
	gn(n);
	oldn=n;
	rep(i,1,n){
		int u,v;
		gn(u);gn(v);
		chd[u].pb(v);
		chd[v].pb(u);
	}
	rep(i,1,n+1)oldchd[i]=chd[i];
	bfs(1);
	int u=1;
	rep(i,1,n+1)if(dis[i]>dis[u])u=i;
	bfs(u);
	int d=0;
	rep(i,1,n+1)upmax(d,dis[i]);
	rep(i,1,n+1)if(chd[i].size()==1) {
		leaf.pb(i);
	}
	int idtot=n;
	for (auto le:leaf) {
		bfs(le);
		int ma=0;
		rep(i,1,n+1)upmax(ma,dis[i]);
		int del = d - ma;
		int las=le;
		rep(j,0,del) {
			int ne = ++idtot;
			chd[las].pb(ne);
			chd[ne].pb(las);
			las=ne;
		}
	}
	n=idtot;
	bfs2();
	rep(u,1,n+1) {
		upmax(needdeg[dis[u]],chd[u].size());
	}
	ll ans=1;
	if(d%2==1) {
		rep(i,1,d/2+1)
			ans *= needdeg[i]-1;

		ans*=2;
	}else{
		rep(i,1,d/2)
			ans*=needdeg[i]-1;
		ans*=needdeg[d/2];
		rep(u,1,oldn+1){
			clea();
			chd[u].pb(n+1);
			chd[n+1].pb(u);
			n++;
			upmin(ans,gao());
		}
	}
	cout<<d/2+1<<" ";
	cout<<ans<<endl;
	return 0;

}

Submission Info

Submission Time
Task D - Isomorphism Freak
User jcvb
Language C++14 (GCC 5.4.1)
Score 0
Code Size 4695 Byte
Status

Compile Error

./Main.cpp: In function ‘void getre()’:
./Main.cpp:14:39: error: ‘printf’ was not declared in this scope
 void getre(){int x=0;printf("%d\n",1/x);}
                                       ^
./Main.cpp: In function ‘void gettle()’:
./Main.cpp:15:58: error: ‘printf’ was not declared in this scope
 void gettle(){int res=1;while(1)res<<=1;printf("%d\n",res);}
                                                          ^
./Main.cpp: At global scope:
./Main.cpp:16:9: error: ‘pair’ does not name a type
 typedef pair<int,int> pii;
         ^
./Main.cpp:17:9: error: ‘vector’ does not name a type
 typedef vector<int> vi;
         ^
./Main.cpp:18:9: error: ‘vector’ does not name a type
 typedef vector<pii> vpii;
         ^
./Main.cpp: In function ‘void gn(long long int&)’:
./Main.cpp:31:36: error: ‘getchar’ was not declared in this scope
  int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');
                                    ^
./Main.cpp:33:19: error: ‘getchar’ was not declared in this scope
  while((c=getcha...