Cod sursa(job #1118472)
Utilizator | Data | 24 februarie 2014 11:21:13 | |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.66 kb |
#include<cstdio>
using namespace std;
int a[1003],b[1003][1001],t[1003],n,m,c,sol,i;
int main()
{
freopen("aprindere.in","r",stdin);
freopen("aprindere.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=0;i<n;++i) scanf("%d",&a[i]);
for(int i=1;i<=m;++i)
{
scanf("%d",&c);
scanf("%d",&t[c]);
scanf("%d",&b[c][0]);
for(int j=1;j<=b[c][0];++j) scanf("%d",&b[c][j]);
}
for(int i=0;i<n;++i)
{
if(a[i]==0)
{
sol+=t[i];
for(int j=1;j<=b[i][0];j++) a[b[i][j]]=!a[b[i][j]];
}
}
printf("%d\n",sol);
return 0;
}