Pagini recente » Cod sursa (job #2912476) | Cod sursa (job #3031749) | Cod sursa (job #2059629) | Cod sursa (job #1142079) | Cod sursa (job #1202556)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("aprindere.in");
ofstream g ("aprindere.out");
const int NMAX = 1000 + 1;
const int CMAX = 100 + 1;
int n, m;
int v[NMAX], cam[CMAX];
void citeste () {
f >> n >> m;
for (int i = 0; i < n; i++) f >> v[i];
}
void rezolva () {
int c, tc, nrc, sol = 0;
for (int i = 0; i < m; i++) {
f >> c >> tc >> nrc;
for (int j = 0; j < nrc; j++) f >> cam[j];
if (v[c] == 0) {
sol = sol + tc;
for (int j = 0; j < nrc; j++)
v[cam[j]] = (v[cam[j]] + 1) % 2;
}
}
g << sol << '\n';
}
int main () {
citeste ();
rezolva ();
return 0;
}