Pagini recente » Cod sursa (job #505702) | Cod sursa (job #635887) | Clasamentul arhivei de probleme | Borderou de evaluare (job #2029692) | Cod sursa (job #2165699)
#include <fstream>
using namespace std;
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
int main()
{
int n,m,i,a[1001],c[1002],nr[1001],v[1001][101],j,ok;
int t[1001],s=0;
fin>>n>>m;
for (i=0;i<n;i++)
{
fin>>a[i];
}
for (i=1;i<=m;i++){
fin>>c[i];
fin>>t[i];
fin>>nr[i];
for (j=1;j<=nr[i];j++){
fin>>v[i][j];
}
}
c[0]=0;
for (i=0;i<n;i++){
if (a[i]==0)
{
ok=0;
for (j=1;j<=m;j++)
if (c[j]==i)
{
ok=j;
break;
}
if (c[ok]==i)
{
s=s+t[ok];
for (j=1;j<=nr[ok];j++)
{
a[v[ok][j]]=(a[v[ok][j]]+1)%2;
}
}
}
}
fout<<s;
return 0;
}