| Submit | All submissions | Best solutions | Back to list |
TOUR - Fake tournament |
We consider only special type of tournaments. Each tournament consists of a series of matches. We have n competitors at the beginning of a competition and after each match the loser is moved out of the competition and the winner stays in (there are no draws). The tournament ends when there is only one participant left - the winner. It is a task of National Sports Federation to schedule the matches. Members of this committee can pick the contestants for the first match. Then, after they know the result, they say which of the remaining contestants meet in the second match, and so on until there is only one participant left.
It is easy to see that not only skill and training decides about the win, but also "luck" - i.e. the schedule. The members of NSF know it as well.
The committee used the training time to look carefully on the performance of each probable contestant. It is clear now, at the start of the season, that some of the results between the competitors are 100% predictable. Having this information NSF considers if it is possible to schedule the matches in such a way that the given contestant x wins. That is to plan the matches for x only with those who will lose with him (then he wins the whole tournament of course). If it is possible then w say that the tournament can be set for x.
Task
Your task is to write a program which determines the number of contestants of a given tournament for which it is possible to set it.
Input
t [number of tests to solve].
In the first line of each test:
n (1<=n<=1000) - the number of participants of the tournament. We number the participants with numbers 1, 2 ... n.
The following line contains a list of participants who will inevitably win with participant 1. This list begins with a number m (the number of contestants "better" than 1) and numbers n1, n2 ... nm
delimited by single spaces.
Next n-1 lines contain analogous lists for participants 2, 3 ... n.
Remark 1. The fact that participant a would lose with b and b would lose with c doesn't necessarily mean that a would lose with c in a direct match.
Remark 2. It is not possible that a is on the list of contestants better than b and b is on the list of a at the same time.
Output
For each test your program should output a single integer - the number of participants, for which it is possible to set the tournament.
Example
Input: 1 3 2 3 2 1 3 0 Output: 1
| Added by: | Adam Dzedzej |
| Date: | 2004-06-08 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All |
| Resource: | Internet Contest Pogromcy Algorytmów (Algorithm Tamers) Round IV, 2001 |
hide comments
|
||||||||
|
2017-08-16 08:10:57
Try in O(n) with scc |
||||||||
|
2017-06-14 13:48:58
Try to solve it through SCC !!! Last edit: 2017-06-14 16:17:20 |
||||||||
|
2017-03-31 11:59:48
@shady .here it can be fixed for 1,2 and 5 |
||||||||
|
2017-02-24 17:25:54 Madcannibal
We can calculate array reachs[] (contain how many node can reach me in dfs) in O(n^2) by doing dfs n times, and the answer be the number of i that reachs[i] equal n. |
||||||||
|
2016-10-12 16:24:04
No need for SCC |
||||||||
|
2016-09-19 10:40:03
what does it mean RTE SIGABRT ?? |
||||||||
|
2016-08-11 17:55:15
It's a simple dfs!! No SCC....No need to overthink!! Just make sure that the tournament can be set for x if it can be reached from all the other nodes |
||||||||
|
2016-07-05 08:44:05
Worth solving. An implementation of strongly connected components and Indegrees of the components. Remember -> ...... line contains a list of participants who will " inevitably win" with participant 1! .... Doing the opposite costed 5 WA's :p |
||||||||
|
2016-06-30 21:31:01
spent a whole day! learnt a lot :) 0.08 sec is happiness! thanks to @Assem Raj Baranwaal |
||||||||
|
2016-06-24 01:09:18 deerishi
Awesome Problem!! |
||||||||
RSS