Pagini recente » Cod sursa (job #119376) | Cod sursa (job #1010470) | Cod sursa (job #3263998) | Cod sursa (job #1594393) | Cod sursa (job #2491997)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
#define N 1024
vector <int> curr;
int v[N],i,n,m,j,x,y,nr,c,ans;
int main()
{
ifstream fin ("aprindere.in");
ofstream fout ("aprindere.out");
fin >> n >> m;
for (i = 0; i < n; ++i)
fin >> v[i];
for (i = 0; i < m; ++i){
fin >> x >> c >> nr;
for (j = 0; j < nr; ++j){
fin >> y;
curr.push_back (y);
}
if (!v[x]){
ans += c;
for (j = 0; j < nr; ++j)
v[curr[j]] = 1 - v[curr[j]];
}
curr.clear ();
}
fout << ans;
return 0;
}