Pagini recente » Cod sursa (job #2942642) | Cod sursa (job #3277226) | Cod sursa (job #1258394) | Cod sursa (job #159850) | Cod sursa (job #1211850)
#include<iostream>
#include<vector>
#include<fstream>
using namespace std;
ifstream f("aprindere.in");
ofstream g("aprindere.out");
vector <int> intrp[1005];
int sum,i,j,c,n,m,k,t[1005],timp[1005];
int main()
{
f>>n>>m;
for(i=0;i<n;i++)f>>t[i];
for(j=0;j<m;j++)
{
f>>c;
f>>timp[c];
f>>k;
while(k>0){f>>i;
intrp[c].push_back(i);k--;}
}
sum=0;
for(i=0;i<n;i++)
{
if(t[i]==0){
t[i]=1;
sum+=timp[i];
for(j=0;j<intrp[i].size();j++)
t[intrp[i][j]]=!t[intrp[i][j]];
}
}
g<<sum;
return 0;
}