ГлавнаяСборникиТурнирыРазделыФорумыУчастникиПечатьПомощьО системе

Сборники > Kovrov IT 2010 > задача:


A. Провайдеры

Задачи сборника

• Задача 7
• A. Провайдеры
• B. Primes
• C. Bishops
• D. Unusual Lottery
• E. Polygons
• F. Liars and Knights
• G. Sequence
• H. Coins
• I. Galls village

Обратная связь

Если у вас есть предложения или пожелания по работе Contester, посетите форум сайта www.contester.ru.

Лимит времени 1500/2000/2000/2000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Автор: Сергей Виноградов, Ярославль.

There are N providers and M internet users in your town. Every user needs internet, but does not need more than one provider. Every user knows, what providers are available to him. Every provider can accept connections from not more than Ki users. You must find the maximal quantity of users, that can be connected to internet at the same time.

Input
The first line contains two integers N (1 ≤ N ≤ 50) and M (1 ≤ M ≤ 500). The second line contains N numbers Ki (1 ≤ Ki ≤ 50). Each line of next M lines contains a lists of providers, available for corresponding user - a set of nonrepeating numbers from 1 to N, separated by single spaces. List of providers is terminated by zero.

Output
Output one number - maximal quantity of users online.

Input 1 Output 1
2 5
3 2
1 2 0
1 2 0
1 0
1 0
2 0
5

Для отправки решений необходимо выполнить вход.

www.contester.ru