Cod sursa(job #2168498)
Utilizator | Danut Aldea DanutAldea | Data | 14 martie 2018 11:14:49 |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
int n,m,i,j,T,x,v[1000],t[1000];
int a[1001][101];
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
int main(){
fin>>n>>m;
for(i=0;i<n;i++){
fin>>v[i];
}
for(i=1;i<=m;i++){
fin>>x;
fin>>t[x];
fin>>a[x][0];
for(j=1;j<=a[x][0];j++)
fin>>a[x][j];
}
for(i=0;i<n;i++){
if(v[i]==0){
T+=t[i];
for(j=1;j<=a[i][0];j++)
v[a[i][j]]=1-v[a[i][j]];
}
}
fout<<T;
return 0;
}