Pagini recente » Cod sursa (job #3251639) | Cod sursa (job #3281175) | Rating infoarena | Cod sursa (job #335370) | Cod sursa (job #1732774)
#include <fstream>
using namespace std;
ifstream f("aprindere.in");
ofstream g("aprindere.out");
int n,m1,i,j,s,c,t[1005],nr[1005],m[1005][1005],v[1005];
int main()
{
f >> n >> m1;
for(i = 1; i <= n; ++i)
{
f >> v[i];
if(v[i] == 0)
v[i] = -1;
}
for(i = 1; i <= m1; ++i)
{
f >> c >> t[i] >> nr[i];
for(j = 1; j <= nr[i]; ++j)
f >> m[c][j];
}
s = 0;
for(i = 1; i <= n; ++i)
{
if(v[i] == -1)
{
s += m[i][0];
for(j = 1; j <= nr[i]; ++j)
v[m[i][j]] *= -1;
}
}
g << s << '\n';
return 0;
}