Pagini recente » Diferente pentru preoni-2008/runda-1/solutii intre reviziile 21 si 22 | Istoria paginii runda/ah2/clasament | Istoria paginii runda/de_test/clasament | Monitorul de evaluare | Cod sursa (job #1330288)
#include <cstdio>
#include <iostream>
#define nmax 1005
using namespace std;
int n,m,a[nmax],sum;
int main(){
int c,t,nr,x,i;
freopen("aprindere.in","r",stdin);
freopen("aprindere.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=0;i<n;i++) scanf("%d",&a[i]);
while(m--){
scanf("%d%d%d",&c,&t,&nr);
if(!a[c]){
sum+=t;
while(nr--){
scanf("%d",&x);
if(!a[x])a[x]=1;
else a[x]=0;
}
continue;
}
while(nr--)
scanf("%d",&x);
}
cout<<sum<<'\n';
return 0;
}