Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #1402430)
| Utilizator | Data | 26 martie 2015 16:21:38 | |
|---|---|---|---|
| Problema | Aprindere | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <cstdio>
#define Nmax 1010
using namespace std;
int i , j , n , m , poz , t , nr , x , sol;
int mod[Nmax];
int main()
{
freopen("aprindere.in","r",stdin);
freopen("aprindere.out","w",stdout);
for (scanf("%d %d", &n, &m), i = 1; i <= n; ++i)
scanf("%d", &mod[i]);
for (i = 1; i <= m; ++i)
{
scanf("%d %d %d", &poz, &t, &nr);
if (!mod[++poz])
{
for (sol = sol + t , j = 1; j <= nr; ++j)
{
scanf("%d", &x);
mod[++x] = !mod[x];
}
continue;
}
for (j = 1; j <= nr; ++j) scanf("%d", &x);
}
printf("%d\n", sol);
return 0;
}
