Cod sursa(job #3140297)
Utilizator | Caracioni Octavian Luca octavian202 | Data | 5 iulie 2023 14:22:52 |
---|---|---|---|
Problema | Aprindere | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.77 kb |
#include <iostream>
using namespace std;
bool aprins[10005];
int main() {
int n, m, res = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x > 0)
aprins[i] = true;
else
aprins[i] = false;
}
for (int intr = 0; intr < m; intr++) {
int ind, t, nr;
cin >> ind >> t >> nr;
if (aprins[ind]) {
for (int i = 0; i < nr; i++) {
int x;
cin >> x;
}
} else {
res += t;
aprins[ind] = true;
for (int i = 0; i < nr; i++) {
int x;
cin >> x;
aprins[x] = !aprins[x];
}
}
}
cout << res;
return 0;
}