Cod sursa(job #1105239)
Utilizator | Data | 11 februarie 2014 17:07:59 | |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.52 kb |
#include<fstream>
using namespace std;
bool a[1002];
int main(){
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
int N,M,i,C,T,NR,S=0,x;
fin>>N>>M;
for(i=0;i<N;++i)fin>>a[i];
for(i=1;i<=M;++i)
{
fin>>C>>T>>NR;
if(!a[C])
{
while(NR--)
{
fin>>x;
a[x]=(a[x])?0:1;
}
S+=T;
}
else while(NR--)fin>>x;
}
fout<<S;
return 0;
}