Pagini recente » Borderou de evaluare (job #115333) | Borderou de evaluare (job #2185944) | Borderou de evaluare (job #2717917) | Borderou de evaluare (job #1597924) | Cod sursa (job #8191)
Cod sursa(job #8191)
#include <stdio.h>
#define in "aprindere.in"
#define out "aprindere.out"
#define dim 1001
bool aprins[dim];
int cost=0, n, m;
int p[dim];
int main()
{
int x, tc, nr, q;
freopen(in,"r",stdin);
freopen(out,"w",stdout);
scanf("%d%d",&n,&m);
for ( int i = 0; i < n; i++ )
{
scanf("%d",&x);
aprins[i] = x;
}
int ok = 1;
for ( int j = 1; j <= m; j++ )
{
scanf("%d%d%d",&x,&tc,&nr);
ok = 0;
for ( int i = 1; i <= nr; i++ )
{
scanf("%d",&q);
p[i] = q;
if ( q == x && aprins[x] == 0 ) ok = 1;
}
if ( ok == 1 )
{
//printf("%d\n",p[1]);
cost += tc;
for ( int i = 1; i <= nr; i++ )
{
if ( aprins[p[i]] == 0 ) aprins[p[i]] = 1;
else aprins[p[i]] = 0;
}
}
}
printf("%d",cost);
}