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 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;
N - 1 <= R <= min(10^7, (N * (N - 1) ) / 2));
1 <= K <= N;
0 <= S <= 10^6
OUTPUT
print "Yes" if the soldiers are placed optimally 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 OUTPUT No Yes
WARNING ==> Large input.
hide comments
|
imsaral:
2017-06-26 19:56:01
bfs with the help of STL easily does the trick :)
|
|
ashish1508:
2017-06-25 21:38:47
what are the values of M ? |
|
yashrocks22:
2017-03-16 11:57:13
if getting WA,check for cyclic graphs and also take care of o/p format got 2 wa's bcoz of it!! Last edit: 2017-03-16 11:58:51 |
|
himbhadani:
2017-01-31 05:48:29
very weak test case.
|
|
reconnect:
2017-01-06 18:59:28
NO test cases are fine. Remember "every city is protected by one and only one soldier". So if a city falls under jurisdiction of 2 soldiers then it is not optimal. This is what the question means. |
|
cat_got_bored:
2016-12-12 19:26:32
The problem statement is not clear at all. Test data is probably wrong too |
|
sanaa95:
2016-11-03 18:13:34
weak test cases.
|
|
sandeepd:
2016-10-16 16:38:32
Nice problem. Think about all the cases based on "in such a way that every city is protected by one and only one soldier" and you can avoid all WA. |
|
rahulpadhy:
2016-08-12 06:47:42
In case of cyclic graphs, do we visit the already visited nodes again ?
|
|
sumit_danish:
2016-08-06 17:50:24
is this bidirectional graph..? |
| 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 |
RSS