Pagini recente » Cod sursa (job #2669894) | Cod sursa (job #1899897) | Cod sursa (job #173634) | Cod sursa (job #1702944) | Cod sursa (job #3297645)
#include <fstream>
using namespace std;
ifstream fin ("aprindere.in");
ofstream fout ("aprindere.out");
int main () {
int n, m;
fin >> n >> m;
int v[1000];
for (int i = 0; i < n; ++i)
fin >> v[i];
int timp[n] = {0}, cnt[n] = {0}, mat[m][n] = {0};
for (int i = 1; i <= m; ++i) {
int c, t, nrc;
fin >> c >> t >> nrc;
timp[c] = t;
cnt[c] = nrc;
for (int j = 1; j <= nrc; ++j)
fin >> mat[c][j];
}
long long rez = 0;
for (int i = 0; i < n; ++i) {
if (!v[i]) {
rez += timp[i];
for (int j = 1; j <= cnt[i]; ++j) {
if (v[mat[i][j]])
v[mat[i][j]] = 0;
else
v[mat[i][j]] = 1;
}
}
}
fout << rez;
return 0;
}