Cod sursa(job #2497541)
Utilizator | Prunescu Bogdan Bogdy_P | Data | 22 noiembrie 2019 20:24:35 |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | ad_hoc | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("aprindere.in");
ofstream out("aprindere.out");
int n, m, C[1010], c, tc, k, sol, bec;
bool OK;
int main()
{
in >> n >> m;
for(int i = 0;i < n;i++)
in >> C[i];
for(int i = 1;i <= m;i++)
{
OK = 0;
in >> c >> tc >> k;
if(C[c] == 0)
{
OK = 1;
sol += tc;
}
for(int j = 1;j <= k;j++)
{
in >> bec;
if(OK) C[bec] = !C[bec];
}
}
out << sol;
return 0;
}