Cod sursa(job #2005997)
| Utilizator | Data | 28 iulie 2017 15:50:18 | |
|---|---|---|---|
| Problema | Aprindere | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include<fstream>
using namespace std;
ifstream fi("aprindere.in");
ofstream fo("aprindere.out");
int n,m,i,j,nr,x,B[1001],X[1001][101],timp,c,T[1001];
bool A[1001];
int main()
{
fi>>n>>m;
for(i=1; i<=n; i++)
fi>>A[i];
for(i=1; i<=m; i++)
{
fi>>c;
fi>>T[c+1]>>nr;
X[c+1][0]=nr;
for(j=1; j<=nr; j++)
{
fi>>x;
B[x+1]=c+1;
X[c+1][j]=x+1;
}
}
for(i=1; i<=n; i++)
{
if(A[i]==0)
{
for(j=1; j<=X[i][0]; j++)
A[X[i][j]]=!A[X[i][j]];
timp+=T[i];
}
}
fo<<timp<<"\n";
fi.close();
fo.close();
return 0;
}
