Pagini recente » Cod sursa (job #3195361) | Cod sursa (job #3231386) | Borderou de evaluare (job #1587718) | Borderou de evaluare (job #1837246) | Cod sursa (job #423410)
Cod sursa(job #423410)
#include <cstdio>
#define hg 8912
int v[1005],sol[1005][1005];
int n, m, sum, c, tc, nrc, poz, x;
char ch[hg];
inline void cit (int &x)
{
x = 0;
if (ch[0]=='\0') fread (ch, 1, hg, stdin);
else while (ch[poz] < '0' || ch[poz] > '9')
if (++poz == hg)
fread (ch, 1, hg, stdin), poz = 0;
while (ch[poz] >= '0' && ch[poz] <= '9')
{
x = x * 10 + ch[poz] - '0';
if (++poz == hg)
fread (ch, 1, hg, stdin), poz = 0;
}
}
int main ()
{
freopen ("aprindere.in","r",stdin);
freopen ("aprindere.out","w",stdout);
int i, j;
cit(n),cit(m);
for (i = 1; i <= n; i++)
{
cit(v[i]);
//if (v[i]==0)
// --v[i];
}
for (i=1; i<=m; i++)
{
cit(c),cit(tc),cit(nrc);
sol[c][0]=tc;
sol[c][1]=nrc++;
for (j = 2; j <= nrc; j++)
cit(x);
}
for (i = 1; i <= n; i++)
if (v[i] == 0)
{
sum+=sol[i][0];
//for (j=2; j<=sol[i][1]+1; ++j)
//v[sol[i][j]]=-v[sol[i][j]];
}
printf ("%d",sum);
return 0;
}