acdream1233 Royal Federation （构造？）

Andrew Stankevich's Contest (3)

ASC 3

Royal Federation

Special JudgeTime Limit: 10000/5000MS (Java/Others)Memory Limit: 128000/64000KB (Java/Others)

Problem Description

The king of Fooland has recently decided to reorganize his kingdom. Inspired by the democracy processes in neighbouring countries, he decided to convert his kingdom into Royal Federation. The Royal Federation would consist of several provinces, each headed by its governor.

There are N cities in his kingdom, numbered from 1 to N. Some cities are connected by roads. Roads are designed in such a way, that for each city there is exactly one way to get to any other city by the roads, not passing through any city more than once.

To prevent wastes for maintaining too small provinces, each province must contain at least B cities. However, to keep governments effective, each province must contain at most 3B cities.

Each province must have its governer headquaters in some city. This city may be outside the province itslef, but one must be able to get to the city with governer headquaters of his province in such a way, that all intermediate cities that he visits on his way belong to his province (and only the terminal city may be from another province).

One city may contain headquaters for several provinces.

Help the king to see his plans fulfilled.

Input

The first line of the input file contains two integer numbers - N and B (1 <= N <= 10 000, 1 <= B <= N).

Next N - 1 lines contain descriptions of roads, each line contains two integer numbers - the cities the road connects.

Output

If it is impossible to fulfil king's plans of reorganization, output 0 on the first line of the output file. In the other case output K - the number of provinces in your plan of the Royal Federation. After that output N integer numbers ranging from 1 to K - for each city output the number of the province it belongs to.

Finally output K integer numbers —— the cities where the capitals of the provinces must be located in.

Sample Input

Sample Output

3

2 1 1 3 3 3 3 2

2 1 8

Source

Andrew Stankevich Contest 3

Manager

mathlover

题意：

国家有N个城市，任意城市可以到达任意城市，是一棵树。国王要给这些城市分省份。每个省份最少B个城市，最多3B个城市。每个省有一个首府，首府不一定是这个省的城市，只是首府到这个省各个城市只能经过这个省的城市。给出N和B，求分配方案，输出有多少个省，各个城市属于哪个省，每个省的首府是哪个城。（一个城可以是多个城的首府）（无解则输出0）

题解：

DFS，回溯时给当前点的各个子树分配颜色（省份），只要攒够不小于B个城市，就直接新生成一个颜色把它们刷了，首府是当前城市（所以可以当前点的不同分支刷成同一种颜色）。搞完所有点后，最后把剩下小于B个城市也刷成最后一种颜色。

正确性：主要就是看把最后剩下的小于B个城市也刷成最后一种颜色是否符合要求。根据我的刷法，一种颜色的城市数肯定是小于等于(2B-2)（两个含有B-1个城市的枝刷成的），最后剩下的没颜色的城市加上去也不会超过3B，OK！

然后是无解的情况，无解时颜色数为0，直接输出就行了，不用特判。

（这种范围比较宽的构造性题一般都比较水，大家居然都不做，搞的我也不敢做……

（其实一下也没想明白，慢慢才想出来的

代码：

 //#pragma comment(linker, "/STACK:102400000,102400000")

 #include<cstdio>

 #include<cmath>

 #include<iostream>

 #include<cstring>

 #include<algorithm>

 #include<cmath>

 #include<map>

 #include<set>

 #include<stack>

 #include<queue>

 using namespace std;

 #define ll long long

 #define usll unsigned ll

 #define mz(array) memset(array, 0, sizeof(array))

 #define mf1(array) memset(array, -1, sizeof(array))

 #define minf(array) memset(array, 0x3f, sizeof(array))

 #define REP(i,n) for(i=0;i<(n);i++)

 #define FOR(i,x,n) for(i=(x);i<=(n);i++)

 #define RD(x) scanf("%d",&x)

 #define RD2(x,y) scanf("%d%d",&x,&y)

 #define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z)

 #define WN(x) printf("%d\n",x);

 #define RE  freopen("D.in","r",stdin)

 #define WE  freopen("huzhi.txt","w",stdout)

 #define mp make_pair

 #define pb push_back

 #define pf push_front

 #define ppf pop_front

 #define ppb pop_back

 const double pi=acos(-1.0);

 const double eps=1e-;

 const int maxn=;

 struct Edge {

     int v,next;

 } e[maxn*];

 int head[maxn],en;

 void addedge(int x,int y) {

     e[en].v=y;

     e[en].next=head[x];

     head[x]=en++;

 }

 int n,B;

 int f[maxn];

 int sd[maxn];

 int ans;

 inline void fil(const int &x , const int &fa , const int &ys) {

     f[x]=ys;

     for(int i=head[x]; i!=-; i=e[i].next)

         if(e[i].v!=fa && f[e[i].v]==) fil(e[i].v , x , ys);

 }

 bool used[maxn];

 inline int dfs(const int &x) {

     int i;

     vector<pair<int,int> >s;

     used[x]=;

     for(i=head[x]; i!=-; i=e[i].next) {

         if(used[e[i].v]==){

             int t=dfs(e[i].v);

             if(t!=)s.pb(mp(e[i].v , t));

         }

     }

     int sum=,j=,k;

     i=;

     int size=s.size();

     while(i<size) {

         pair<int,int> pp=s[i];

         sum+=pp.second;

         if(sum>=B) {

             ans++;

             sd[ans]=x;

             for(k=j; k<=i; k++) {

                 fil(s[k].first , x , ans);

                 sum-=s[k].second;

             }

             j=i+;

         }

         i++;

     }

     sum++;

     if(sum>=B) {

         ans++;

         sd[ans]=x;

         i=size-;

         for(k=j; k<=i; k++) {

             fil(s[k].first , x , ans);

             sum-=s[k].second;

         }

         f[x]=ans;

         sum--;

     }

     return sum;

 }

 void farm() {

     ans=;

     mz(used);

     mz(f);

     int t=dfs();

     if(f[]==)fil(,,ans);

 }

 int main() {

     int i,x,y;

     while(RD2(n,B)!=EOF) {

         en=;

         mf1(head);

         REP(i,n-) {

             RD2(x,y);

             addedge(x,y);

             addedge(y,x);

         }

         farm();

         printf("%d\n",ans);

         if(ans!=) {

             if(n>=)printf("%d",f[]);

             FOR(i,,n)printf(" %d",f[i]);

             puts("");

             printf("%d",sd[]);

             FOR(i,,ans)printf(" %d",sd[i]);

             puts("");

         }

     }

     return ;

 }