Cod sursa(job #2190555)
Utilizator | Data | 31 martie 2018 10:21:56 | |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream cin ("aprindere.in");
ofstream cout ("aprindere.out");
const int nmax = 1001;
int n, m;
int nrRoom, time1, k, x;
int sol;
bool ok;
bool room[1 + nmax];
int main() {
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> room[i];
for(int i = 1; i <= m; i++) {
cin >> nrRoom >> time1 >> k;
nrRoom++;
if(!room[nrRoom]) {
sol += time1;
ok = 1;
} else
ok = 0;
for(int j = 1; j <= k; j++) {
cin >> x;
x++;
if(ok)
room[x] ^= 1;
}
}
cout << sol;
return 0;
}