Pagini recente » Cod sursa (job #1185760) | Cod sursa (job #1545147) | Cod sursa (job #651623) | Cod sursa (job #2121092) | Cod sursa (job #714733)
Cod sursa(job #714733)
#include <cstdio>
#include <fstream>
using namespace std;
ifstream in ("aprindere.in");
int a[1024],n,m,sol,nr;
void read ()
{
in>>n>>m;
for(int i=0;i<n;++i)
{
in>>a[i];
nr+=(a[i]==0);
}
}
void solve ()
{
for(int i=1;i<=m&&nr;++i)
{
int c,t,q;
in>>c>>t>>n;
if(a[c])
for(int i=1;i<=n;++i)
in>>q;
else
{
for(int i=1;i<=n;++i)
{
in>>q;
nr+=(a[q]==0)?-1:1;
a[q]=1-a[q];
}
sol+=t;
}
}
}
void out ()
{
freopen ("aprindere.out","w",stdout);
printf("%d",sol);
}
int main ()
{
read ();
solve ();
out ();
return 0;
}