Any idea about how to solve this problem? I cannot even figure out why the output for the given example is 8. There are 11 relations: AB>C, C>A, BC>D, ACD>B, D>E, D>G, BE>C, CG>B, CG>D, CE>A, CE>G. I can see that relation CE>A is redundant because C>A, and CE contains C. But which other 2 relations are redundant?
Thanks in advance!
875 - Monopoly
Moderator: Board moderators
Re: 875 - Monopoly
Can anyone who solved this problem explain the sample I/O given ? I was able to figure out that CE > A is redundant. But no clue abt the other 2.
-
- Guru
- Posts: 5947
- Joined: Thu Sep 01, 2011 9:09 am
- Location: San Jose, CA, USA
Re: 875 - Monopoly
This problem can't be judged, it has no real I/O. This code gets AC:
Code: Select all
int main(void) {return 0;}
Check input and AC output for thousands of problems on uDebug!
Re: 875 - Monopoly
Hi,
I have created a set for this, and hopefully it will be set soon. Here is an illustration of ACD > B is not needed, since
it can be derived from:
ACD > ACG > AB > B
Since D>G, and CG > B
Can you now find the remaining unneeded one now?
I have created a set for this, and hopefully it will be set soon. Here is an illustration of ACD > B is not needed, since
it can be derived from:
ACD > ACG > AB > B
Since D>G, and CG > B
Can you now find the remaining unneeded one now?