Cod sursa(job #2079008)
Utilizator | Data | 30 noiembrie 2017 13:41:41 | |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include<fstream>
using namespace std;
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
int V[1003];
int main()
{
int N,M,T=0;
fin>>N>>M;
for(int i=0;i<N;i++)
fin>>V[i];
for(int i=1;i<=M;i++)
{
int X,Y,Z;
fin>>X>>Y>>Z;
if(V[X]==0)
{
T+=Y;
for(int j=1;j<=Z;j++)
{
int K;
fin>>K;
V[K]=1-V[K];
}
}
else
for(int j=1;j<=Z;j++)
{
int K;
fin>>K;
}
}
fout<<T;
}