Pagini recente » Cod sursa (job #2886173) | Cod sursa (job #2609829) | Cod sursa (job #1304707) | Cod sursa (job #1658497) | Cod sursa (job #972217)
Cod sursa(job #972217)
#include <cstdio>
#include <algorithm>
using namespace std;
int i,n,k,j,m,s,dr,x,ok,tmax,t,p;
int v[2000];
int main()
{
freopen ("aprindere.in","r",stdin);
freopen ("aprindere.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
{
scanf("%d",&v[i]);
}
for(i=1;i<=m;i++)
{
scanf("%d%d%d",&x,&t,&p);
if(v[x]==0)
{
// printf("%d\n",i);
tmax+=t;
for(j=1;j<=p;j++)
{
scanf("%d",&ok);
v[ok]=1-v[ok];
}
}
else
{
for(j=1;j<=p;j++)
{
scanf("%d",&ok);
}
}
}
printf("%d\n",tmax);
}