Pagini recente » Cod sursa (job #3128308) | Cod sursa (job #2342202) | Cod sursa (job #361607) | Cod sursa (job #2384360) | Cod sursa (job #799272)
Cod sursa(job #799272)
#include <fstream>
#include <iostream>
using namespace std;
int N,K;
int s[1010];
int light,nr,op,cst,ct;
int main()
{
ifstream in("aprindere.in");
ofstream out("aprindere.out");
in>>N>>K;
for(int i=1;i<=N;++i)
{
in>>s[i];
}
for(int i=1;i<=K;++i)
{
in>>light>>cst>>nr;
//cout<<"abc "<<light<<' '<<cst<<' '<<nr<<'\n';
if(s[light+1]==1)
{
for(int i=1;i<=nr;++i)
{
in>>light;
}
continue;
}
//cout<<"sus\n";
//cout<<cst<<" ";
ct+=cst;
for(int i=1;i<=nr;++i)
{
in>>op;
s[op+1]=!s[op+1];
}
//cout<<"dupa actionarea becului "<<light<<" conf este ";
//for(int i=1;i<=N;++i)
// cout<<s[i]<<' ';
//cout<<'\n';
}
//cout<<ct;
out<<ct<<'\n';
out.close();
return 0;
}