Pagini recente » Cod sursa (job #3194867) | Cod sursa (job #2118925) | Cod sursa (job #2863246) | Cod sursa (job #1695315) | Cod sursa (job #1486432)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main(){
ifstream f("aprindere.in");
ofstream g("aprindere.out");
vector <int> v[1005];
int n, m, s = 0;
bool st[1005];
f >> n >> m;
for (int i = 0; i < n; ++i)
f >> st[i];
for (int i = 0; i < m; ++i){
int x, y, z;
f >> x >> y;
v[x].push_back(y);
f >> y;
for (int j = 0; j < y; ++j){
f >> z;
v[x].push_back(z);
}
}
for (int i = 0; i < n; ++i)
if (st[i] == 0){
s += v[i][0];
int x = v[i].size();
for (int j = 1; j < x; ++j){
st[v[i][j]] = !st[v[i][j]];
}
}
g << s;
f.close();
g.close();
return 0;
}