Pagini recente » Cod sursa (job #1697331) | Cod sursa (job #2904360) | Cod sursa (job #1295261) | Cod sursa (job #3129747) | Cod sursa (job #1073244)
#include <fstream>
#include <vector>
using namespace std;
const int MAX_N = 1e4;
int st[MAX_N], t[MAX_N];
vector <int> G[MAX_N];
int main(){
ifstream cin( "aprindere.in" );
int N, M;
cin >> N >> M;
for( int i = 0; i < N; ++i )
cin >> st[i];
for( int i = 0; i < M; ++i ){
int c, nr;
cin >> c;
cin >> t[c] >> nr;
for( int j = 0; j < nr; ++j ){
int x;
cin >> x;
G[c].push_back( x );
}
}
cin.close();
int ans = 0;
for( int i = 0; i < N; ++i ){
if( !st[i] ){
ans += t[i];
for( unsigned int j = 0; j < G[i].size(); ++j )
st[G[i][j]] ^= 1;
}
}
ofstream cout( "aprindere.out" );
cout << ans;
cout.close();
return 0;
}