Cod sursa(job #1065015)
Utilizator | Data | 22 decembrie 2013 17:03:09 | |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.55 kb |
#include<fstream>
#define dim 1002
using namespace std;
ifstream f("aprindere.in");
ofstream g("aprindere.out");
int stare[dim],c,t,xx,costminim;
int i,n,m,x,j;
inline int minim(int a,int b){
if(a<b)
return a;
return b;
}
int main () {
f>>n>>m;
for(i=0;i<n;++i)
f>>stare[i];
for(i=1;i<=m;++i){
f>>c>>t>>xx;
if(stare[c]==0)
costminim+=t;
else{
for(j=1;j<=xx;++j){
f>>x;
}
continue;
}
for(j=1;j<=xx;++j){
f>>x;
stare[x]=!stare[x];
}
}
g<<costminim<<"\n";
return 0;
}