Pagini recente » Cod sursa (job #1931689) | Cod sursa (job #372744) | Cod sursa (job #585086) | Cod sursa (job #287067) | Cod sursa (job #1044680)
#include <fstream>
#include <vector>
using namespace std;
int N,M,timp[1005];
bool stare[1005];
vector <int> L[1005];
inline void Read()
{
int i,j,x,cam,nrc;
ifstream fin("aprindere.in");
fin>>N>>M;
for(i=0;i<N;i++)
{
fin>>x;
if(x)
stare[i]=true;
}
for(i=1;i<=M;i++)
{
fin>>cam;
fin>>timp[cam]>>nrc;
for(j=1;j<=nrc;j++)
{
fin>>x;
L[cam].push_back(x);
}
}
fin.close();
}
inline void Solve()
{
int solutie=0,i,j,len;
for(i=0;i<N;i++)
if(!stare[i])
{
stare[i]=true;
solutie+=timp[i];
len=L[i].size();
for(j=0;j<len;j++)
{
if(!stare[L[i][j]])
stare[L[i][j]]=true;
else
stare[L[i][j]]=false;
}
}
ofstream fout("aprindere.out");
fout<<solutie<<"\n";
fout.close();
}
int main()
{
Read();
Solve();
return 0;
}