Cod sursa(job #1310171)
Utilizator | Data | 6 ianuarie 2015 15:45:34 | |
---|---|---|---|
Problema | Aprindere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
# include <bits/stdc++.h>
using namespace std;
ifstream fi("aprindere.in");
ofstream fo("aprindere.out");
int b[1005];
int s[1005];
int main(void)
{
int n,m,ans=0;
fi>>n>>m;
for (int i=0;i<n;++i) fi>>b[i];
int x,y,z;
while (m --)
{
fi>>x>>y>>z;
for (int j=1;j<=z;++j) fi>>s[j];
if (!b[x])
{
ans += y;
b[x] = 1;
for (int j=1;j<=z;++j) b[s[j]] = !b[s[j]];
}
}
return fo << ans << '\n',0;
}