Pagini recente » Cod sursa (job #2090025) | Cod sursa (job #505024) | Cod sursa (job #2037486) | Cod sursa (job #931118) | Cod sursa (job #1003714)
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("aprindere.in");
ofstream out("aprindere.out");
const int MAXN = 1010;
int s[MAXN][MAXN], t[MAXN], v[MAXN];
int main()
{
int i, j, m, n, sol = 0, x;
in >> n >> m;
for(i = 0; i < n; ++i)
in >> v[i];
for(i = 0; i < m; ++i){
in >> x;
in >> t[x] >> s[x][0];
for(j = 1; j <= s[x][0]; ++j)
in >> s[x][j];
}
for(i = 0; i < n; ++i)
if(!v[i]){
sol += t[i];
for(j = 1; j <= s[i][0]; ++j)
v[ s[i][j] ] ^= 1;
}
out << sol;
return 0;
}