KINGSHIP - Editorial

ad-hoc
cook43
editorial
graph
kingship
simple

#1

PROBLEM LINK:

Practice
Contest

Author: Shiplu Hawlader
Tester: Tasnim Imran Sunny
Editorialist: Lalit Kundu

DIFFICULTY:

SIMPLE-EASY

PREREQUISITES:

Connected Graph
Tree

PROBLEM:

Connect all the N(<=10^5) cities to make a connected graph in minimum cost. Cost of adding each edge is product of population of the two cities between whom edge is being added. All populations are given in the input.

QUICK EXPLANATION:

Graph formed finally should be a tree. We connect all the other nodes to the node with smallest population which results in minimum cost.

image2

EXPLANATION:

We need to add edges such that all the cities become connected. Connected is defined as “it should be possible from any city to reach any other city by a sequence of edges”.

There doesn’t exist a graph which is connected and has less than (N-1) edges (which is known as a tree).
So we will be constructing a tree finally with (N-1) edges.
Suppose we create some random tree with (N-1) edges. Now I pick two nodes i and j where Pi and Pj both are not the minimum and remove that edge from there and connect nodes x and j, where Px is minimum.

I have a change of ( Px * Pj ) - ( Pi * Pj ) which is less than zero since Px < Pi.

image3

So, we all nodes will be connected to the node with smallest value.
Pseudo Code:

n=input   
value array=input     
ans=0    
for i=1 to N-1:    
    ans += value**value[0]   
print ans    

AUTHOR’S AND TESTER’S SOLUTIONS:

Author’s solution can be found here.
Tester’s solution can be found here.


#2

@kuldeep992: You should have used long to avoid integer overflow.


#3

http://www.codechef.com/viewsolution/3429768

Why it got wrong?


#4

Isn’t it a minimum spanning tree problem? If so, can we solve it using kruskal or prim algo.


#5

can anyone explain me where is integer overflowing in my code ?
http://www.codechef.com/viewplaintext/3426847


#6

Can kruskal’s and prim algorithm be used ?


#7

to avoid integer overflow use ’ long long ’ . I had got a WA while using ‘int’ . and the problem is of
'ad-hoc ’ category which means you do not require to apply any special algorithm to get it solved .


#8

please explain the case n=1…why isn’t the ans=0 for that?


#9

what is the answer if input:
1
2
5 5


#10

why can’t we use long n, long vector and long long sum??


#11

can you tell me why i got wrong answer…
http://www.codechef.com/viewsolution/3428578


#12

http://www.codechef.com/viewsolution/3427213

sme here!! can u tell d reson 4r it’s faliure?


#13

long is 32 bit. You are getting integer overflow in your code.


#14

I think you can user Prim’s algorithm, because of it’s implementation if you start from vertex with min Pi, but not Kruskal’s…


#15

it is sum+=a**min;

try

1
3
1000000 1000000 1000000

#16

i got it. thanks ! :slight_smile:


#17

Y cant kruskal be used ?


#18

Complexity of Kruskal’s is O(ElogV), while of this algorithm is linear. I guess it might result in TLE. Morever this algorithm is very easy to implement unlike Kruskal.