Pagini recente » Cod sursa (job #399630) | Monitorul de evaluare | Cod sursa (job #684394) | Cod sursa (job #3294942) | Cod sursa (job #1316723)
#include <cstdio>
#include <fstream>
#define nmax 1005
using namespace std;
ifstream f("aprindere.in");
ofstream g("aprindere.out");
int n,m;
int v[nmax],sum;
int t[nmax],nr[nmax],k[nmax][nmax];
int main()
{
int i,j,c;
f>>n>>m;
for (i=0;i<n;i++)
f>>v[i];
for (i=1;i<=m;i++) {
f>>c;
f>>t[c]>>nr[c];
for (j=1;j<=nr[c];j++)
f>>k[c][j];
}
for (i=0;i<n;i++)
if (v[i]==0) {
sum+=t[i];
for (j=1;j<=nr[i];j++)
v[k[i][j]]=1-v[k[i][j]];
}
g<<sum;
return 0;
}