Pagini recente » Cod sursa (job #41284) | Cod sursa (job #3312) | Cod sursa (job #2548079) | Cod sursa (job #2013633) | Cod sursa (job #3147166)
#include<iostream>
#include<vector>
using namespace std;
const int NMAX=1000;
int n,m,T[NMAX];
vector<int> bec[NMAX];
bool aprins[NMAX];
int main(){
ios_base::sync_with_stdio(false);
freopen("aprindere.in","r",stdin);
freopen("aprindere.out","w",stdout);
cin.tie(nullptr);
cout.tie(nullptr);
cin>>n>>m;
for(int i=0;i<n;++i){
cin>>aprins[i];
}
while(m--){
int c,k;
cin>>c>>T[c]>>k;
while(k--){
int x;
cin>>x;
bec[c].push_back(x);
}
}
int ans=0;
for(int i=0;i<n;++i){
if(aprins[i]){
continue;
}
ans+=T[i];
for(auto j:bec[i]){
aprins[j]^=1;
}
}
cout<<ans;
}