Dynamic programming., Count Scorecards(30 points) In a tournament, N players play, Data Structure & Algorithms

Dynamic programming., Data Structure & Algorithms

Assignment Help:

Count Scorecards(30 points)

In a tournament, N players play against each other exactly once. Each game results in either of the player winning. There are no ties. You have given a scorecard containing the scores of each player at the end of the tournament. The score of a player is the total number of games the player won in the tournament. However, the scores of some players might have been erased from the scorecard. How many possible scorecards are consistent with the input scorecard?

Input:
The first line contains the number of cases T. T cases follow. Each case contains the number N on the first line followed by N numbers on the second line. The ith number denotes s_i, the score of the ith player. If the score of the ith player has been erased, it is represented by -1.

Output:
Output T lines, containing the answer for each case. Output each result modulo 1000000007.

Constraints:
1 <= T <= 20
1 <= N <= 40
-1 <= s_i < N

Sample Input:
5
3
-1 -1 2
3
-1 -1 -1
4
0 1 2 3
2
1 1
4
-1 -1 -1 2

Sample Output:
2
7
1
0
12

Explanation:
For the first case, there are 2 scorecards possible: {0,1,2} or {1,0,2}.
For the second case, the valid scorecards are {1,1,1}, {0,1,2}, {0,2,1}, {1,0,2}, {1,2,0}, {2,0,1}, {2,1,0}.
For the third case, the only valid scorecard is {0,1,2,3}.
For the fourth case, there is no valid scorecard. It is not possible for both players to have score 1.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages

Dynamic programming., Data Structure & Algorithms

Related Discussions:- Dynamic programming.

Array implementation of a circular queue, A circular queue can be implement...

Lists, In the earlier unit, we have discussed about the arrays. Arrays are ...

How to write binary search algorithm?, Q. Write down the binary search algo...

Array, extra key inserted at end of array is called

Graph, For the following graph find the adjacency matrix and adjacency list...

Boundary tag method in context of dynamic memory management, Q. How can we ...

Homework, Write a recursive function the computes the number of digits in a...

Procedures, what is far and near procedures in system programming?

Algorithsm, What are the properties of an algorithsm?

Algo for quicksort, Easy algorithm for beginner for quicksort with explanat...

Write Your Message!

Featured Services

Online Tutoring

Project Development

Exam Preparation

Course Help

Assignment Help

Popular Subjects

Assured A++ Grade

Academics

Major Subjects

Majors

Get In Touch

TERMS & POLICIES

HELP & SUPPORT