Pagini recente » Cod sursa (job #3132076) | Cod sursa (job #2103655) | Cod sursa (job #1185348) | Cod sursa (job #3175319) | Cod sursa (job #1083155)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("aprindere.in");
ofstream g("aprindere.out");
int aprinse[1000], drum[1000],timp[1001], n, m ,t = 0;
int a[1000][1001];
int main()
{
f >> n >> m;
for (int i=0;i<n;i++)
f >> aprinse[i];
int cam;
for (int i=0;i<m;i++)
{
f >> cam;
f >> timp[cam] >> drum[cam];
for (int j=1;j<=drum[cam];j++)
f >> a[cam][j];
}
for (int i=0;i<n;i++)
{
if (!aprinse[i] && drum[i])
{
for (int j=1;j<=drum[i];j++)
aprinse[a[i][j]] = !aprinse[a[i][j]];
t += timp[i];
}
}
g << t << endl;
return 0;
}