Pagini recente » Cod sursa (job #925505) | Cod sursa (job #3231623) | Cod sursa (job #3229789) | Cod sursa (job #2744012) | Cod sursa (job #3267962)
#include <bits/stdc++.h>
using namespace std;
ifstream in("aprindere.in");
ofstream out("aprindere.out");
int a[1000], b[1000], poz, timp, numar;
int main()
{
int n, m, suma = 0;
in >> n >> m;
for (int i = 0; i < n; i++)
in >> a[i];
for (int i = 0; i < m; i++) {
in >> poz >> timp >> numar;
for (int j = 0; j < numar; j++)
in >> b[j];
if (a[poz] == 0) {
for (int j = 0; j < numar; j++)
a[b[j]] = 1 - a[b[j]];
suma += timp;
}
}
out << suma;
return 0;
}