AKBAR - Akbar , The great


 

All of us are familiar with the reign of the great mughal ruler , Akbar. He was always concerned with the prosperity and safety of the people . Therefore to safeguard his kingdom (which consisted of N cities) he wanted to place secret soldiers all over his kingdom so as to protect the people . But since his kingdom is very large therefore he wanted to place as minimum of them as possible because the salary of these undercover soldiers was very high ,ie, in such a way that every city is protected by only one soldier .
 As for these soldiers , they have varible strength .
The strength of a particular soldier is defined as the number of cities he can safeguard from a particular city along with that city. 
Also the kingdom is connected with a network of secret two way roads for faster access only accessible to these soldiers. The length of any road on this network between any two cities is 1 kms .There are R such roads in the kingdom. 
He had given this task to birbal to place the soldiers . Birbal didn't wanted to be a fool in front of the king , therefore took the job and placed M soldiers all over the kingdom but he was not very good at mathematics . But since he is very intelligent he somehow places the guards all over the kingdom and now turns to you (who is a genius mathematician ;) ) to check whether his placements are good or not.
Your task is to check if all the placements of the soldiers are optimum or not.
INPUT
The input consists of t test cases . Each test case then consists of 3 parts.The first line consists of N and R and M.
the next R lines consists of two numbers a and b denoting the two cities between which a road exists .
the next M lines consists of 2 numbers k and strength denoting the city number and the strength of that particular soldier respectively .
=> strength 0 means it will only guard the city on which it is present .
=> assume every city is accesible from every other city .
CONSTRAINTS
t <= 10;
1 <= N <= 10^6;
N-1 <= R <= min(10^9 , (N*(N-1))/2));
1 <= k <= N;
0 <= strength <= 10^6
OUTPUT
print "Yes" if the soldiers are placed optimumly else print "No". (quotes are for clearity)
SAMPLE INPUT
3 2 2
1 2
2 3
1 2
2 0
4 5 2
1 4
1 2
1 3
4 2
3 4
2 1
3 0
SAMPLE OUTPUT
No
Yes
WARNING ==> Large input . Be careful with certain languages. Use scanf() for c/c++ ;

All of us are familiar with the reign of the great mughal ruler , Akbar. He was always concerned with the prosperity and safety of the people . Therefore to safeguard his kingdom (which consisted of N cities) he wanted to place secret soldiers all over his kingdom so as to protect the people . But since his kingdom is very large therefore he wanted to place them in such a way that every city is protected by one and only one soldier.According to Akbar , this is the optimum placement.

 As for these soldiers they can protect multiple cities according to their strengths.

The strength of a particular soldier is defined as the maximum distance upto which a guard can protect a city from its base city(base city is the city assigned to the guard). If there are 3 cities C1, C2 and C3 such that C1 C2 and C2 C3 are connected respectively, if a soldier with strength 1 is placed at C2 then all the cities C1, C2 and C3 are protected by that soldier.

Also the kingdom is connected with a network of secret two way roads for faster access only accessible to these soldiers. The length of any road on this network between any two cities is 1 kms .There are R such roads in the kingdom. 

He had given this task to birbal to place the soldiers . Birbal didn't wanted to be a fool in front of the king , therefore took the job and placed M soldiers all over the kingdom but he was not very good at mathematics . But since he is very intelligent he somehow places the guards all over the kingdom and now turns to you (who is a genius mathematician ;) ) to check whether his placements are good or not.

 

Your task is to check if the placements of the soldiers are optimum or not.

 

INPUT

 

The input consists of T test cases . Each test case then consists of 3 parts.The first line consists of N, R and M.

the next R lines consists of two numbers A and B denoting the two cities between which a road exists .

the next M lines consists of 2 numbers, city number K and strength S of that particular soldier.

 

=> strength 0 means it will only guard the city on which it is present .

=> assume every city is accesible from every other city .

 

CONSTRAINTS

 

T <= 10;

1 <= N <= 10^6;

-1 <= R <= min( 10^7 , ( * (- 1) ) / 2) );

1 <= K <= N;

0 <= S <= 10^6

 

OUTPUT

 

print "Yes" if the soldiers are placed optimumly else print "No". (quotes are for clarity)

 

SAMPLE INPUT

 

2

3 2 2

1 2

2 3

1 2

2 0

4 5 2

1 4

1 2

1 3

4 2

3 4

2 1

3 0

 

SAMPLE OUTPUT

 

No

Yes

 

WARNING ==> Large input.

 


hide comments
amulyagaur: 2017-10-17 18:04:20

Fuckingly awesome :P

make9chaos: 2017-10-04 19:40:10

@imsaral
Applying same logic but Its not working.
Getting WA

code_aim: 2017-09-01 17:16:50

Very good problem :-)

For those getting WA try this :
1
6 6 1
1 2
1 3
2 4
3 5
4 6
5 6
1 3

Ans : Yes

prakhar2808: 2017-07-16 17:56:05

TLE again and again

komninos: 2017-07-16 15:51:39

I am offended

jatin03: 2017-07-06 17:56:43

how to solve cyclic part in this
solved it finally ac was a silly mistake

Last edit: 2017-07-07 08:19:48
anurag31: 2017-07-06 15:02:28

@anubhav112..same approch got AC...just keep in mind to stop processing whenever u visit the visited node..simply print no

anubhav112: 2017-07-05 05:35:51

My approach is to do a BFS from soldier source till its strength, however getting tle again and again on the 3rd testcase..
Can anyone help me to optimize my code a little bit!? this is my code..
http://www.spoj.com/submit/AKBAR/id=19735680

Last edit: 2017-07-05 05:38:38
mastik5h_1998: 2017-07-02 23:29:28

wrong question....

imsaral: 2017-06-26 19:56:01

bfs with the help of STL easily does the trick :)
AC in one go :D
The trick is apllying bfs till the strength of each soldier does not reduce to zero and storing for each node the soldiers which are protecting it.This should be exactly equal to 1.
My 101th :D


Added by:Prayank Mathur
Date:2014-10-12
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:own