Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int col[MAXN];
- int n, m;
- vi cur;
- int solve()
- {
- scanf("%d %d", &n, &m);
- for (int i = 0; i < n; ++i)
- scanf("%d", &col[i]);
- for (int i = 0; i < m; ++i)
- {
- cur.clear();
- int bal = 0;
- int k = 0;
- scanf("%d", &k);
- for (int j = 0; j < k; ++j)
- {
- int x;
- scanf("%d", &x);
- --x;
- cur.inb(x);
- if (col[x] == 1)
- --bal;
- else
- ++bal;
- }
- if (bal > 0)
- for (int j = 0; j < k; ++j)
- col[cur[j]] ^= 1;
- }
- for (int i = 0; i < n; ++i)
- if (!col[i])
- puts("NO"), exit(0);
- puts("YES");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement