Pagini recente » Cod sursa (job #1554815) | Cod sursa (job #398344) | Cod sursa (job #129449) | Istoria paginii runda/shimulare_shmecheri | Cod sursa (job #1575938)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
const int NMax = 1005;
int N,M,Sol;
int L[NMax];
vector <int> J;
void Read_Solve()
{
int C,T,Nr;
fin>>N>>M;
for(int i=0;i<N;++i)
fin>>L[i];
for(int i=1;i<=M;++i)
{
fin>>C>>T>>Nr;
for(unsigned int j=1;j<=Nr;++j)
{
int x; fin>>x;
J.push_back(x);
}
if(L[C] == 0)
{
Sol+=T;
L[C] = 1 - L[C];
for(int j=0;j<J.size();++j)
L[J[j]] = 1 - L[J[j]];
}
}
}
void Print()
{
fout<<Sol<<"\n";
}
int main()
{
Read_Solve();
Print();
fin.close();
fout.close();
return 0;
}