Cod sursa(job #953454)
Utilizator | Ionescu Teodor teoionescu | Data | 26 mai 2013 11:15:03 |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream in("aprindere.in");
ofstream out("aprindere.out");
const int N = 1005;
int v[N],cost[N],a[N][105];
int n,m,x,s;
int main(){
int i,j;
in>>n>>m;
for(i=0;i<n;i++) in>>v[i];
for(i=1;i<=m;i++){
in>>x;
in>>cost[x];
in>>a[x][0];
for(j=1;j<=a[x][0];j++) in>>a[x][j];
}
for(i=0;i<n;i++){
if(v[i]==0){
s+=cost[i];
for(j=1;j<=a[i][0];j++) v[a[i][j]]=!v[a[i][j]];
}
}
out<<s;
return 0;
}