Cod sursa(job #1778984)
Utilizator | Data | 14 octombrie 2016 16:36:38 | |
---|---|---|---|
Problema | Aprindere | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream in("aprindere.in");
ofstream out("aprindere.out");
int n, m, cfg[1000], ans;
int main()
{
int i, j;
in >> n >> m;
for (int i=0; i <=n-1; i++)
{
in >> cfg[i];
}
for (i=0; i < m ; i++)
{
int c, t, nr, ok=0;
in >> c >> t >> nr;
if (cfg[c] == 0)
{
ans=ans+t;
ok=1;
}
for (int j=1; j <= nr; j++)
{
int x;
in >> x;
if (ok==1) cfg[x]=!cfg[x];
}
out << ans;
}
return 0;
}