Pagini recente » Cod sursa (job #49315) | Cod sursa (job #407267) | Cod sursa (job #2831693) | Cod sursa (job #1366922) | Cod sursa (job #1061478)
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int NMAX = 1010;
int N, M, V[NMAX], C, T, Nr, X, Cost;
int main()
{
freopen("aprindere.in", "r", stdin);
freopen("aprindere.out", "w", stdout);
scanf("%i %i", &N, &M);
for(int i = 1; i <= N; ++ i) scanf("%i", &V[i]);
for(int i = 1; i <= M; ++ i)
{
scanf("%i %i %i", &C, &T, &Nr);
C ++;
bool OK = 0;
if(V[C] == 0) OK = 1, Cost += T;
for(int j = 1; j <= Nr; ++ j)
{
scanf("%i", &X);
if(OK) V[X + 1] = 1 - V[X + 1];
}
}
printf("%i\n", Cost);
}