Pagini recente » Cod sursa (job #2617314) | Cod sursa (job #3220726) | Cod sursa (job #1543366) | Cod sursa (job #105178) | Cod sursa (job #1363156)
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define Nmax 1005
using namespace std;
int n,m,i,j,p,q,nr,w[Nmax],sol;
vector < int >v[Nmax];
bool a[Nmax];
int main()
{
freopen("aprindere.in","r",stdin);
freopen("aprindere.out","w",stdout);
scanf("%d %d",&n,&m);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
while (m--)
{
scanf("%d",&p);
scanf("%d %d",&w[p],&q);
for (i=1;i<=q;i++)scanf("%d",&nr),v[p].push_back(nr);
}
for (i=0;i<n;i++)
if (!a[i])
{
sol+=w[i];
for (j=0;j<v[i].size();j++)
a[v[i][j]]=1-a[v[i][j]];
}
printf("%d",sol);
return 0;
}