Cod sursa(job #721289)
| Utilizator | Data | 23 martie 2012 15:38:46 | |
|---|---|---|---|
| Problema | Aprindere | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("aprindere.in"); ofstream g("aprindere.out");
int v[1005], i, j, k, n, m, t, x, intr[1005][105];
int main(){
f>>n>>m;
for (i=0; i<n; i++) f>>v[i];
for (i=1; i<=m; i++){
f>>intr[i][1]>>intr[i][2]>>intr[i][3];
x=intr[i][3];
for (j=1; j<=x; j++) f>>intr[i][3+j];
}
for (i=0; i<n; i++){
if (v[i]==0){
for (j=1;;j++) if (intr[j][1]==i) break;
t+=intr[j][2];
x=intr[j][3];
for (k=1; k<=x; k++) v[intr[j][k+3]] ^=1;
}
}
g<<t;
}
