Cod sursa(job #1886069)
| Utilizator | Data | 20 februarie 2017 17:11:04 | |
|---|---|---|---|
| Problema | Aprindere | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.86 kb |
#include <fstream>
using namespace std;
ifstream fin ("aprindere.in");
ofstream fout ("aprindere.out");
bool X[1005];
int main()
{
int N, M, i, timp=0, C, Tc, NRc, indice, j;
fin>>N>>M;
for (i=0; i<N; i++)
fin>>X[i];
for (i=1; i<=M; i++)
{
fin>>C;
if (X[C]==0)
{
fin>>Tc>>NRc;
timp=timp+Tc;
for (j=1; j<=NRc; j++)
{
fin>>indice;
if (indice>=C)
if (X[indice]==0)
X[indice]=1;
else
X[indice]=0;
}
}
else
{
fin>>Tc>>NRc;
for (j=1; j<=NRc; j++)
fin>>indice;
}
}
fout<<timp<<"\n";
fin.close();
fout.close();
return 0;
}
