Cod sursa(job #2111483)
| Utilizator | Data | 22 ianuarie 2018 10:40:22 | |
|---|---|---|---|
| Problema | Aprindere | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
int n,m,v[1001],t[1001],nr[1001][101],c,tt;
int main()
{
fin>>n>>m;
for(int i=0;i<n;i++)
fin>>v[i];
for(int i=1;i<=m;i++)
{
fin>>c;
fin>>t[c]>>nr[c][0];
for(int j=1;j<=nr[c][0];j++)
fin>>nr[c][j];
}
for(int i=0;i<n;i++)
if(v[i]==0)
{
for(int j=1;j<=nr[i][0];j++)
v[nr[i][j]]=1-v[nr[i][j]];
tt=tt+t[i];
}
fout<<tt<<'\n';
return 0;
}
