Cod sursa(job #1204952)
Utilizator | Data | 4 iulie 2014 14:54:32 | |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
int n, m, c, tc, nrc, s;
int a[1001], room[1001];
int main()
{
fin >> n >> m;
for (int i = 0; i < n; i++)
fin >> a[i];
for (int i = 0; i < m; i++)
{
fin >> c >> tc >> nrc;
for (int j = 0; j < nrc; j++)
fin >> room[j];
if (a[c] == 0)
{
s = s + tc;
for (int j = 0; j < nrc; j++)
a[room[j]] = (a[room[j]] + 1) % 2;
}
}
fout << s;
fin.close();
fout.close();
return 0;
}