Cod sursa(job #1073704)
| Utilizator | Data | 6 ianuarie 2014 18:58:42 | |
|---|---|---|---|
| Problema | Aprindere | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream cin("aprindere.in");
ofstream cout("aprindere.out");
const int n_max=1001;
int n, m, i, j, s[n_max], x, t[n_max], v[n_max][101], a;
int main()
{
cin>>n>>m;
for(i=0; i<n; i++) cin>>s[i];
for(i=1; i<=m; i++)
{
cin>>x;
cin>>t[x];
cin>>v[x][0];
for(j=1; j<=v[x][0]; j++) cin>>v[x][j];
}
for(i=0; i<n; i++)
if(!s[i])
{
a+=t[i];
for(j=1; j<=v[i][0]; j++) s[v[i][j]]=(s[v[i][j]]+1)%2;
}
cout<<a;
return 0;
}
