Pagini recente » Cod sursa (job #1218264) | Cod sursa (job #224158) | Cod sursa (job #1484833) | Cod sursa (job #1630035) | Cod sursa (job #1703388)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("aprindere.in");
ofstream out("aprindere.out");
const int maxn = 1005;
int rez[maxn][maxn];
int v[maxn];
char T[maxn];
void citire1()
{
in.getline(T + 1, maxn);
in.getline(T + 1, maxn);
int p = strlen(T + 1);
for(int i = 1; i <= p; i += 2)
v[i / 2] = T[i] - '0';
}
int main()
{
int n, m;
in >> n >> m;
citire1();
for(int i = 0; i < n; i++)
{
if(v[i] == 0)
v[i]--;
}
for(int i = 1; i <= m; i++)
{
int c, t, nr;
in >> c >> t >> nr;
rez[c][0] = t;
rez[c][1] = nr;
for(int j = 1; j <= nr; j++)
in >> rez[c][j+1];
}
int s = 0;
for(int i = 0; i < n; i++)
{
if(v[i] == -1)
{
s = s + rez[i][0];
for (int j = 2; j <= rez[i][1] + 1; j++)
v[rez[i][j]] = v[rez[i][j]] * (-1);
}
}
out << s;
return 0;
}