Codeforces 638C Road Improvement【思维+Dfs】

最新推荐文章于 2017-10-15 01:00:21 发布

mengxiang000000

最新推荐文章于 2017-10-15 01:00:21 发布

阅读量527

点赞数

CC 4.0 BY-SA版权

分类专栏：思维搜索文章标签： Codeforces 638C

本文链接：https://blog.csdn.net/mengxiang000000/article/details/78054091

思维同时被 2 个专栏收录

692 篇文章

订阅专栏

搜索

224 篇文章

订阅专栏

本文探讨了一个涉及图论的问题，即如何最有效地安排施工队修复连接多个城市的道路，确保所有道路能在最短时间内修复完毕。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

In Berland there are n cities and n - 1 bidirectional roads. Each road connects some pair of cities, from any city you can get to any other one using only the given roads.

In each city there is exactly one repair brigade. To repair some road, you need two teams based in the cities connected by the road to work simultaneously for one day. Both brigades repair one road for the whole day and cannot take part in repairing other roads on that day. But the repair brigade can do nothing on that day.

Determine the minimum number of days needed to repair all the roads. The brigades cannot change the cities where they initially are.

Input

The first line of the input contains a positive integer n (2 ≤ n ≤ 200 000) — the number of cities in Berland.

Each of the next n - 1 lines contains two numbers ui, vi, meaning that the i-th road connects city ui and city vi (1 ≤ ui, vi ≤ n, ui ≠ vi).

Output

First print number k — the minimum number of days needed to repair all the roads in Berland.

In next k lines print the description of the roads that should be repaired on each of the k days. On the i-th line print first number di — the number of roads that should be repaired on the i-th day, and then di space-separated integers — the numbers of the roads that should be repaired on the i-th day. The roads are numbered according to the order in the input, starting from one.

If there are multiple variants, you can print any of them.

Examples

input
4
1 2
3 4
3 2

output
2
2 2 1
1 3

input
6
3 4
5 4
3 2
1 3
4 6

output
3
1 1 
2 2 3 
2 4 5 

Note

In the first sample you can repair all the roads in two days, for example, if you repair roads 1 and 2 on the first day and road 3 — on the second day.

题目大意：

给出N个点的一棵树，每个点现在都有一个施工队，如果重新修建一条边需要一条边两侧的施工队同时工作才行。

现在问最少多少天，能够使得所有边都重建完成；

思路：

Dfs一遍即可，对于一个点来讲，其往下走的时候，每条边的工作天数都肯定不同。

再维护一个天数，即父亲点和当前点修建这条边的天数编号x，对应这个当前点和其儿子节点之间的修建工作，我们再从第一天开始分配工作，如果遇到了和x编号相同的时候，我们天数++即可。

具体参考代码。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<map>
#include<vector>
using namespace std;
vector<int>mp[250000],ans[250000];
int output;
map<pair<int,int>,int>s;
void Dfs(int u,int from,int prenum)
{
    int day=0;
    for(int i=0;i<mp[u].size();i++)
    {
        int v=mp[u][i];
        if(v==from)continue;
        day++;if(prenum==day)day++;
        ans[day].push_back(s[make_pair(u,v)]);
        Dfs(v,u,day);
    }
    output=max(output,day);
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        s.clear();
        output=0;
        for(int i=1;i<=n;i++)mp[i].clear(),ans[i].clear();
        for(int i=1;i<=n-1;i++)
        {
            int x,y;scanf("%d%d",&x,&y);
            mp[x].push_back(y);
            mp[y].push_back(x);
            s[make_pair(x,y)]=s[make_pair(y,x)]=i;
        }
        Dfs(1,-1,0);
        printf("%d\n",output);
        for(int i=1;i<=output;i++)
        {
            printf("%d ",ans[i].size());
            for(int j=0;j<ans[i].size();j++)
            {
                int v=ans[i][j];
                printf("%d ",v);
            }
            printf("\n");
        }
    }
}