Cod sursa(job #1310191)
Utilizator | Data | 6 ianuarie 2015 16:10:06 | |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.43 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int n,m,rs,i,x,nr,aux;
bool a[1005];
int main()
{
ifstream cin("aprindere.in");
ofstream cout("aprindere.out");
cin>>n>>m;
for(i=0;i<n;++i) cin>>a[i];
while(m--)
{
cin>>i>>x>>nr;
if(a[i]) while(nr--) cin>>aux;
else {
while(nr--) cin>>aux,a[aux]^=1;
rs+=x;
}
}
cout<<rs<<'\n';
return 0;
}