Cod sursa(job #2957686)

Utilizator nicu_ducalNicu Ducal nicu_ducal Data 23 decembrie 2022 12:22:43
Problema Aprindere Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.4 kb
#include <bits/stdc++.h>
using namespace std;

template <typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template <typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
using i64 = long long int;

const int INF = INT_MAX, MOD = 1e9 + 7;
const long long LINF = LLONG_MAX;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {0, 0, 0, -1, 1, -1, 1, 1, -1};
const int dy[] = {0, -1, 1, 0, 0, -1, 1, -1, 1};

int main() {
  ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
  /// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

  ifstream cin("aprindere.in");
  ofstream cout("aprindere.out");

  int N, M; cin >> N >> M;
  vector<int> light(N), times(N);
  vector<vector<int>> swi(N);
  for (int i = 0; i < N; i++)
    cin >> light[i];
  for (int i = 0; i < M; i++) {
    int room, k, c;
    cin >> room;
    cin >> times[room] >> k;
    swi[room].resize(k);
    for (int j = 0; j < k; j++)
      cin >> swi[room][j];

  }

  int ans = 0;
  for (int i = 0; i < N; i++) {
    if (light[i] == 0 and times[i] > 0) {
      light[i] = 1;
      ans += times[i];
      for (int j = 0; j < (int) swi[i].size(); j++)
        light[swi[i][j]] ^= 1;
    }
  }

  cout << ans << "\n";

  return 0;
}