Cod sursa(job #3267962)
| Utilizator | Data | 13 ianuarie 2025 12:07:15 | |
|---|---|---|---|
| Problema | Aprindere | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("aprindere.in");
ofstream out("aprindere.out");
int a[1000], b[1000], poz, timp, numar;
int main()
{
int n, m, suma = 0;
in >> n >> m;
for (int i = 0; i < n; i++)
in >> a[i];
for (int i = 0; i < m; i++) {
in >> poz >> timp >> numar;
for (int j = 0; j < numar; j++)
in >> b[j];
if (a[poz] == 0) {
for (int j = 0; j < numar; j++)
a[b[j]] = 1 - a[b[j]];
suma += timp;
}
}
out << suma;
return 0;
}