Pagini recente » Cod sursa (job #1856334) | Cod sursa (job #1621784) | Cod sursa (job #488730) | Cod sursa (job #2360074) | Cod sursa (job #1554793)
# include <fstream>
# include <algorithm>
using namespace std;
ifstream cin ( "aprindere.in" );
ofstream cout ( "aprindere.out" );
int n, m, i, j, t, s, c ,aprins[1005], timp[1005], nr[105], a[1005][1005];
// pair < int, int > p;
int main ()
{
cin >> n >> m;
for ( i = 0; i < n; i ++ )
{
cin >> aprins[i];
}
///*
while ( m -- )
{
cin >> c;
cin >> timp[c] >> nr[c];
for ( t = 1; t <= nr[c]; t ++ )
cin >> a[t][c];
}
s = 0;
for ( i = 0; i < n; i ++ )
{
if ( aprins[i] ) ;
else
{
s = s + timp[i];
for ( t = 1; t <= nr[i]; t ++ )
if ( aprins[a[t][i]] == 0 )
aprins[a[t][i]] = 1;
else
aprins[a[t][i]] = 0;
}
}
cout << s;
return 0;
}