Cod sursa(job #3151774)
Utilizator | Mihai Octavian Mihai_Oct | Data | 22 septembrie 2023 20:12:00 |
---|---|---|---|
Problema | Aprindere | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
int n, m, i, j, cam, tmp, q, r, nrc;
int a[1002];
int main() {
fin >> n >> m;
for(i = 0; i < n; i++) fin >> a[i];
for(i = 1; i <= m; i++) {
fin >> c >> t >> k;
if(a[c] == 0) {
while(k--) {
fin >> q;
a[q] = 1 - a[q];
}
r += t;
}
else {
while(k--) fin >> q;
}
}
fout << r;
return 0;
}