Pagini recente » Cod sursa (job #576786) | Cod sursa (job #950754) | Cod sursa (job #1785144) | Borderou de evaluare (job #1036370) | Cod sursa (job #2495242)
#include<fstream>
using namespace std;
const int N=1<<10;
int a[N][N],t[N],x,n,m,nr,v[N];
int main(){
ifstream in("aprindere.in");
in >> n >> m;
for( int i = 0; i < n; i++ )
in >> v[i];
for( int i = 0; i < m; i++ )
{
in >> x;
in >> t[x] >> a[x][0];
for( int j = 1; j <= a[x][0]; j++ )
in >> a[x][j];
}
in.close();
ofstream out("aprindere.out");
for( int i = 0; i < n; i++ )
if( !v[i] ){
nr += t[i];
for( int j = 1; j <= a[i][0]; j++ )
v[a[i][j]] = (!v[a[i][j]]);
}
out << nr;
out.close();
return 0;
}