Cod sursa(job #2134750)
| Utilizator | Data | 18 februarie 2018 11:57:46 | |
|---|---|---|---|
| Problema | Aprindere | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("aprindere.in");
ofstream fout("aprindere.out");
int n,m,i,j,h,ans;
int a[1010],v[1010],t[1010],nr[1010],ma[1010][1010];
int main()
{
fin>>n>>m;
for(i=0;i<n;i++)fin>>a[i];
for(i=0;i<m;i++)
{
fin>>v[i]>>t[i]>>nr[i];
for(j=0;j<nr[i];j++)
fin>>ma[i][j];
}
for(i=0;i<n;i++)
if(!a[i])
{
while(v[h]!=i)h++;
ans+=t[h];
for(j=0;j<nr[h];j++)
a[ma[h][j]]^=1;
}
fout<<ans;
return 0;
}
