Pagini recente » Cod sursa (job #2680177) | Cod sursa (job #3032578) | Cod sursa (job #1596849) | Cod sursa (job #1993109) | Cod sursa (job #133014)
Cod sursa(job #133014)
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
int n,m,i,j,k,st[1010],t;
struct {int c,t,nr,a[110];} a[1010];
int main()
{
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
fin>>n>>m;
for(i=0;i<n;i++) fin>>st[i];
for(i=1;i<=m;i++){
fin>>a[i].c>>a[i].t>>a[i].nr;
for(j=0;j<a[i].nr;j++)
fin>>a[i].a[j];}
j=1;
for(i=0;i<n;i++)
if(!st[i]){
while(a[j].c!=i) j++;
t+=a[j].t;
for(k=1;k<=a[j].nr;k++)
st[a[j].a[k]]^=1;}
fout<<t<<endl;
fout.close();
return 0;
}