Cod sursa(job #1061861)
| Utilizator | Data | 20 decembrie 2013 13:19:37 | |
|---|---|---|---|
| Problema | Aprindere | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("aprindere.in");
ofstream g("aprindere.out");
int N, M, C, Tc, NRc, sol, x;
bool bec[1005];
int main()
{
f>>N>>M;
for (int i=0; i<N; ++i)
f>>bec[i];
while (M--)
{
f>>C>>Tc>>NRc;
if (bec[C]==0)
{
sol+=Tc;
for (int i=1; i<=NRc; ++i)
f>>x, bec[x]=1-bec[x];
}
else for (int i=1; i<=NRc; ++i) f>>x;
}
g<<sol<<'\n';
return 0;
}
