Pagini recente » Cod sursa (job #1341427) | Cod sursa (job #2765386) | Cod sursa (job #661390) | Cod sursa (job #1497118) | Cod sursa (job #735246)
Cod sursa(job #735246)
#include<fstream>
using namespace std;
ifstream f("aprindere.in");
ofstream g("aprindere.out");
int i,j,x,n,m,s,X,l,nrc,nr,t;
int a[1000];
inline void solve()
{
for(i=1;i<=m&&nr!=0;++i)
{
f>>l>>t>>nrc;
if(a[l]!=0)
for(j=1;j<=nrc;++j)
f>>X;
else
{
for(j=1;j<=nrc;++j)
{
f>>X;
if(a[X]==0)
nr--;
else
++nr;
a[X]=1-a[X];
}
s+=t;
}
}
}
int main()
{
f>>n>>m;
for(i=0;i<n;++i)
{
f>>a[i];
if(a[i]==0)
++nr;
}
solve();
g<<s;
return 0;
}