New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Blueprint

Contributed by

imObscure

Medium

0/80

Avg time to solve 20 mins

Success Rate 75 %

0 upvotes

Problem Statement

Sam is updating the blueprint of a city. The original blueprint of the city consists of ‘N’ buildings numbered from 0 to ‘N’-1 which are connected by ‘M’ roads, ‘CONNECTIONS’ forming a network where CONNECTIONS[i] = [‘Ai’,’Bi’] represents a road between buildings ‘Ai’ and ‘Bi’.

Any building can be reached from any other building directly or indirectly connected through a series of roads.

There could be some buildings in the original blueprint of the city which are not connected with some other buildings directly or indirectly. Sam wants to update the blueprint of the city by removing some roads which directly connected any two buildings and adding a road between two disconnected buildings to make them connected.

Return the minimum number of times Sam needs to perform the changes such that all the buildings can be reached from any other building through a series of roads. If it is not possible, Return -1.

Example:

Input: ‘N’ = 5 , ‘M’ = 4 ,   'CONNECTIONS' =  [[0,1],[1,2],[2,3],[0,3]]

Output: 1
Explanation:
Remove the road between buildings 0 and 3, and add a road between buildings 0 and 4 , or 1 and 4 ,or 2 and 4 or 3 and 4.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input Format :

The first line of the input contains an integer,’ T’ , denoting the number of test cases.

The first line of each test case contains two integers, 'N’ and ‘M’, denoting the number of buildings and number of connections..

The next ‘M’ lines of each test case contains pair of two integers, denoting the road between buildings.

Output format :

Return an integer, denoting the minimum changes Sam needs to perform in the blueprint.

Constraints :

1  <= T <= 10
1  <= N <= 100000
1 <= M <= min(N x (N-1)/2 , 100000)
CONNECTIONS[i].length == 2
0 <= Ai,Bi < N
Ai != Bi
There are no repeated connections.
No two buildings are connected by more than one road. 
Time Limit: 1 sec

Sample Input 1 :

Sample Output 1 :

1
-1

Explanation Of Sample Input 1 :

Test 1:
Remove road between buildings 0 and 3, and add a road between building 0 and 4 , or 1     and 4 ,or 2 and 4 or 3 and 4. 

Test 2:
There are not enough roads to connect all the building in the city, so return -1.

Sample Input 2 :

Sample Output 2 :

0
1

Auto

Console