Cod sursa(job #2438667)
Utilizator | Patrascu Adrian Octavian PatrascuAdrian1 | Data | 13 iulie 2019 12:32:35 |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream f("aprindere.in");
ofstream g("aprindere.out");
int n,m,x,nrc,nr,cost,i,j;
bool a[1001];
int main()
{
f >> n >> m;
for(i = 0 ; i < n; ++i)
f >> a[i];
for(; m; --m)
{
f >> x >> cost >> nrc;
if(!a[x])
{
nr += cost;
for(; nrc; --nrc)
{
f >> x;
a[x] = 1 - a[x];
}
}
else
for(; nrc; --nrc)
f >> x;
}
g << nr;
return 0;
}