Pagini recente » Cod sursa (job #1355816) | Cod sursa (job #1806718) | Cod sursa (job #2319861) | Cod sursa (job #2319891) | Cod sursa (job #2325237)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
int n,m,i,j,x,c,timp;
struct date{
int t;
int nr;
vector <int> afectate;
} v[1001];
int w[1001],modif[1001];
int main()
{
fin>>n>>m;
for(i=0;i<n;i++)
fin>>w[i];
for(i=1;i<=m;i++){
fin>>c;
fin>>v[c].t>>v[c].nr;
for(j=0;j<v[c].nr;j++){
fin>>x;
v[c].afectate.push_back(x);
}
}
for(i=0;i<n;i++){
if(w[i]^(modif[i]%2))continue;
timp+=v[i].t;
for(j=0;j<v[i].nr;j++)
modif[v[i].afectate[j]]++;
}
fout<<timp;
return 0;
}