codeforces 1005F dfs+bfs+思维

最新推荐文章于 2020-12-22 18:55:35 发布

望舒丶

最新推荐文章于 2020-12-22 18:55:35 发布

阅读量444

点赞数

分类专栏： codeforces DFS

本文链接：https://blog.csdn.net/swust5120166213/article/details/81012796

版权

codeforces 同时被 2 个专栏收录

8 篇文章 0 订阅

订阅专栏

DFS

4 篇文章 0 订阅

订阅专栏

There are $n$ cities in Berland. Some pairs of cities are connected by roads. All roads are bidirectional. Each road connects two different cities. There is at most one road between a pair of cities. The cities are numbered from $1$ to $n$ .

It is known that, from the capital (the city with the number $1$ ), you can reach any other city by moving along the roads.

The President of Berland plans to improve the country's road network. The budget is enough to repair exactly $n - 1$ roads. The President plans to choose a set of $n - 1$ roads such that:

it is possible to travel from the capital to any other city along the $n - 1$ chosen roads,
if $d_{i}$ is the number of roads needed to travel from the capital to city $i$ , moving only along the $n - 1$ chosen roads, then $d_{1} + d_{2} + \dots + d_{n}$ is minimized (i.e. as minimal as possible).

In other words, the set of $n - 1$ roads should preserve the connectivity of the country, and the sum of distances from city $1$ to all cities should be minimized (where you can only use the $n - 1$ chosen roads).

The president instructed the ministry to prepare $k$ possible options to choose $n - 1$ roads so that both conditions above are met.

Write a program that will find $k$ possible ways to choose roads for repair. If there are fewer than $k$ ways, then the program should output all possible valid ways to choose roads.

Input

The first line of the input contains integers $n$ , $m$ and $k$ ( $2 \leq n \leq 2 \cdot 10^{5}, n - 1 \leq m \leq 2 \cdot 10^{5}, 1 \leq k \leq 2 \cdot 10^{5}$ ), where $n$ is the number of cities in the country, $m$ is the number of roads and $k$ is the number of options to choose a set of roads for repair. It is guaranteed that $m \cdot k \leq 10^{6}$ .

The following $m$ lines describe the roads, one road per line. Each line contains two integers $a_{i}$ , $b_{i}$ ( $1 \leq a_{i}, b_{i} \leq n$ , $a_{i} \neq b_{i}$ ) — the numbers of the cities that the $i$ -th road connects. There is at most one road between a pair of cities. The given set of roads is such that you can reach any city from the capital.

Output

Print $t$ ( $1 \leq t \leq k$ ) — the number of ways to choose a set of roads for repair. Recall that you need to find $k$ different options; if there are fewer than $k$ of them, then you need to find all possible different valid options.

In the following $t$ lines, print the options, one per line. Print an option as a string of $m$ characters where the $j$ -th character is equal to '1' if the $j$ -th road is included in the option, and is equal to '0' if the road is not included. The roads should be numbered according to their order in the input. The options can be printed in any order. All the $t$ lines should be different.

Since it is guaranteed that $m \cdot k \leq 10^{6}$ , the total length of all the $t$ lines will not exceed $10^{6}$ .

If there are several answers, output any of them.

Examples

Input

Copy

Output

Copy

2
1110
1011

Input

Copy

Output

Copy

1
101001

Input

Copy

Output

Copy

2
111100
110110

题意：给你一个无向图，1为起点，建立一个最小生成树让起点到其他个点的距离最小，如果有比k大的方案数输出k种方案，如果比k小就输出全部，每一种方案的每一条边用了为1没用为0，输出。

思路：好多人在求最小生成树的时候用的dij或spfa来求最短路，但是我就得没必要，直接以1为起点bfs为深度，这样跑出来的深度就是最小生成树，然后dfs答案，这个操作十分巧妙，步骤为：当起点为 st 可以到达的所有点 en 满足dep[st]==dep[en]+1;那么en点一定是st点的上层点 en点一定要连接到上层点，但不一定是st点把这条边的id记录，让后dfs每一个点可能的每一条边具体看代码

#include<stdio.h>
#include<string.h>
#include<cmath>
#include<stdlib.h>
#include<time.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<queue>
#include<set>
#include<map>
#define ll long long
#define qq printf("QAQ\n");
using namespace std;
const int maxn=1e5+5;
const int inf=2e9+1e8+1234;
const ll linf=8e18+9e17;
const int mod=1e9+7;
const double e=exp(1.0);
const double pi=acos(-1);
struct node{
	int to,id;
};
vector<node>v[maxn<<1];
vector<int>v1[maxn<<1];
vector<string>v2;
int dep[maxn<<1]={0},ans,num,n,k;
string s;
void bfs()
{
	queue<int>q;
	q.push(1);
	dep[1]=1;
	//v1[1].push_back(1);
	while(!q.empty())
	{
		int now=q.front();
		q.pop();
		num=max(num,dep[now]);
		for(int i=0;i<v[now].size();i++)
		{
			int next=v[now][i].to;
			if(!dep[next])
			{
			//s[v[now][i].id]='1';
			dep[next]=dep[now]+1;
			
			//v1[dep[next]].push_back((node){next,v[now][i].id});
			
			q.push(next);
			}
		}
	}
}
void dfs(int st)
{
	if(v2.size()>=k)return ;
	if(st>n)
	{
		v2.push_back(s);
		return ;
	}
	for(int i=0;i<v1[st].size();i++)
	{
		s[v1[st][i]]='1';
		dfs(st+1);
		s[v1[st][i]]='0';
	}
}
int main()
{
	int m;
	while(scanf("%d%d%d",&n,&m,&k)!=EOF)
	{
		int st,en;
		s.clear();
		for(int i=0;i<m;i++)
		{
			s+='0';
			scanf("%d%d",&st,&en);
			v[st].push_back((node){en,i});
			v[en].push_back((node){st,i});
		}
		ans=1,num=0;
		bfs();
		for(int i=2;i<=n;i++)
		{
			for(int j=0;j<v[i].size();j++)
			{
				int next=v[i][j].to;
				if(dep[i]==dep[next]+1)v1[i].push_back(v[i][j].id);
			}
		}
		dfs(2);
		printf("%d\n",v2.size());
		for(int i=0;i<v2.size();i++)
		cout<<v2[i]<<endl;
	}
	return 0;
}