Pagini recente » Cod sursa (job #1466213) | Cod sursa (job #2123059) | Istoria paginii runda/agm-2018-testare | Cod sursa (job #728130) | Cod sursa (job #1700051)
#include <cstdio>
using namespace std;
short int N,M,t[1001]={},aff[1001][101]={},pos,i,j;
int S;
bool v[1001]={};
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",&pos);
scanf("%d%d",&t[pos],&aff[pos][0]);
for(j=1;j<=aff[pos][0];j++)
scanf("%d",&aff[pos][j]);
}
for(i=0;i<N;i++)
if(v[i]==0)
{
S+=t[i];
for(j=1;j<=aff[i][0];j++)
v[aff[i][j]]-=1;
}
printf("%d\n",S);
for(int i=0;i<N;i++)
printf("%d",v[i]);
return 0;
}