Pagini recente » Cod sursa (job #3238342) | Cod sursa (job #2426758) | Cod sursa (job #1968712) | Cod sursa (job #175149) | Cod sursa (job #1938611)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int v[1010],cost[1010];
vector <int> g[1010];
int main()
{
ifstream fin ("aprindere.in");
ofstream fout ("aprindere.out");
int n,m,i,j,a,c,t,total=0,x,nr;
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>v[i];
for(i=1; i<=m; i++)
{
fin>>c>>t>>nr;
c++;
cost[c]=t;
for(j=1; j<=nr; j++)
{
fin>>x;
x++;
g[c].push_back(x);
}
}
for(i=1; i<=n; i++)
{
if(v[i]!=1)
{
total+=cost[i];
for(j=0; j<g[i].size(); j++)
v[g[i][j]]^=1;
}
}
fout<<total;
return 0;
}