Pagini recente » Cod sursa (job #337334) | Cod sursa (job #1774265) | Cod sursa (job #979568) | Cod sursa (job #1800820) | Cod sursa (job #1080984)
#include <iostream>
#include <fstream>
using namespace std;
int v[1005],t[1005],n,m, a[1005][1005];
int main()
{
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
int i,j,c,nr;
long long T = 0;
fin>>n>>m;
for(i=0;i<n;i++)
fin>>v[i];
for(i=1;i<=m;i++)
{
fin>>c;
fin>>t[c]>>nr;
a[c][0]=nr;
for ( j = 1; j <= nr ; j ++ )
fin>>a[c][j];
}
for(i=0;i<n;i++)
if ( v[i] == 0 )
{
T += t[i];
for ( j =1 ;j <= a[i][0]; j ++ )
v[ a[i][j] ] = 1 - v[ a[i][j] ];
}
fout<<T;
return 0;
}