Pagini recente » Cod sursa (job #894733) | Cod sursa (job #1753136) | Cod sursa (job #1731887) | Cod sursa (job #2331390) | Cod sursa (job #1790091)
#include <fstream>
using namespace std;
const int MAX = 1001;
int v[MAX], n, m, ans;
int main()
{
ifstream cin ("aprindere.in");
ofstream cout ("aprindere.out");
cin >> n >> m;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 1; i <= n; ++i)
{
int c, t, nrc, ok = 0;
cin >> c >> t >> nrc;
if (v[c] == 0)
{
ans += t;
ok = 1;
}
for (int j = 1; j <= nrc; ++j)
{
int x;
cin >> x;
if (ok == 1)
v[x] = !v[x];
}
}
cout << ans;
return 0;
}