Pagini recente » Cod sursa (job #2651329) | Cod sursa (job #521347) | Cod sursa (job #2125045) | Cod sursa (job #1179393) | Cod sursa (job #2262873)
#include <fstream>
using namespace std;
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
int n, m, nr, c, t, timp;
int v[1005][105];
bool on[1005];
void Read()
{
fin>>n>>m;
for(int i=0;i<n;++i)
fin>>on[i];
while(m--)
{
fin>>c>>t>>nr;
v[c][0] = t;
for(int i=1;i<=nr;++i)
fin>>v[c][i];
v[c][nr+1]=-1;
}
}
void Greedy()
{
for(int i=0;i<n;++i)
if( on[i] == 0 )
{
timp += v[i][0];
for( int j = 1; v[i][j] != -1; ++j )
on[v[i][j]] = 1 - on[v[i][j]];
}
fout<<timp<<"\n";
}
int main()
{
Read();
Greedy();
return 0;
}