Pagini recente » Cod sursa (job #2419104) | Cod sursa (job #1610046) | Cod sursa (job #2079707) | Cod sursa (job #1438518) | Cod sursa (job #712829)
Cod sursa(job #712829)
#include<cstdio>
using namespace std;
long a[1001][101];
long c[1001];
long t[1001];
int main () {
long n,m,i,j,k,suma=0;
freopen("aprindere.in","r",stdin);
freopen("aprindere.out","w",stdout);
scanf("%ld%ld",&n,&m);
for (i=0;i<n;i++)
scanf("%ld",&c[i]);
for (i=1;i<=m;i++) {
scanf("%ld",&k);
scanf("%ld%ld",&t[k],&a[k][0]);
for (j=1;j<=a[k][0];j++)
scanf("%ld",&a[k][j]);
}
for (i=0;i<n;i++)
if (c[i]==0) {
suma=suma+t[i];
for (j=1;j<=a[i][0];j++)
if (c[a[i][j]]==1)
c[a[i][j]]=0;
else c[a[i][j]]=1;
}
printf("%ld\n",suma);
return 0;
}