Cod sursa(job #230507)
#include <stdio.h>
#define N 1005
int v[N],a[N][N],n,m,cost[N];
void Read()
{
int x,y,z;
scanf("%d%d",&n,&m);
for (int i=0; i<n; i++)
scanf("%d",&v[i]);
for (int i=1; i<=m; i++)
{
scanf("%d%d%d",&x,&z,&y);
cost[x]=z;
a[x][0]=y;
for (int j=1; j<=a[x][0]; j++)
scanf("%d",&a[x][j]);
}
}
void Solve()
{
int sum=0;
for (int i=0; i<n; i++)
if (v[i]==0)
{
sum+=cost[i];
for (int j=1; j<=a[i][0]; j++)
if (v[a[i][j]]==0)
v[a[i][j]]=1;
else
v[a[i][j]]=0;
}
printf("%d\n",sum);
}
int main()
{
freopen("aprindere.in","r",stdin);
freopen("aprindere.out","w",stdout);
Read();
Solve();
}