Pagini recente » Cod sursa (job #23599) | Cod sursa (job #1405249) | Cod sursa (job #50728) | Cod sursa (job #1345539) | Cod sursa (job #528437)
Cod sursa(job #528437)
#include<fstream>
#define dmax 1010
using namespace std;
int n,m;
bool lum[dmax];
int a[dmax][dmax];
long long cost;
void citire()
{
int i,j,x;
ifstream fin("aprindere.in");
fin>>n>>m;
for (i=1; i<=n; i++)
fin>>lum[i-1];
for (i=1; i<=m; i++)
{
fin>>x>>a[x][1]>>a[x][2];
for (j=1; j<=a[x][2]; j++)
fin>>a[x][j+2];
}
fin.close();
}
void solve()
{
int i,j;
for (i=0; i<=n-1; i++)
if (lum[i] == 0)
{
cost += a[i][1];
for (j=1; j<=a[i][2]; j++)
if (lum[a[i][j+2]] == 0)
lum[a[i][j+2]] = 1; else
lum[a[i][j+2]] = 0;
}
}
void afisare()
{
ofstream fout("aprindere.out");
fout<<cost;
fout.close();
}
int main()
{
citire();
solve();
afisare();
return 0;
}