Pagini recente » Cod sursa (job #3162279) | Soluţii ONIS 2015, Runda 2 | Cod sursa (job #1644875) | Cod sursa (job #193094) | Cod sursa (job #3253150)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
struct AAA {
int ind, timp,dim;
vector<int>cam;
};
int main() {
int aprins[1002], n, intr, t, i, j,x,sum=0;
bool ok;
AAA v[1002];
fin >> n >> intr;
for (i = 0; i < n; i++)
fin >> aprins[i];
for (t = 1; t <= intr; t++) {
fin >> v[t].ind >> v[t].timp >> v[t].dim;
ok = 0;
if (aprins[v[t].ind]==0) {
//fout << v[t].ind << endl;
ok = 1;
sum += v[t].timp;
//fout << v[t].ind << endl;
}
for (i = 1; i <= v[t].dim; i++) {
fin >> x;
v[t].cam.push_back(x);
if (ok)
aprins[x] = 1 - aprins[x];
}
}
fout << sum;
}