problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
bitset<10> bb;
cin >> n >> m;
vector<bitset<10>> sw(m);
vector<int> p(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int ii = 0; ii < k; ii++) {
int a;
cin >> a;
sw.at(i).set(a - 1);
}
}
for (int i = 0; i < m; i++)
cin >> p.at(i);
int cnt = 0;
for (int i = 1; i < (1 << n); i++) {
bb = i;
bool can = true;
for (int j = 0; j < m; j++) {
int tmpcnt = 0;
for (int k = 0; k < m; k++)
if (sw.at(j).test(k) && bb.test(k))
tmpcnt++;
if (tmpcnt % 2 != p.at(j))
can = false;
}
if (can)
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
bitset<10> bb;
cin >> n >> m;
vector<bitset<10>> sw(m);
vector<int> p(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int ii = 0; ii < k; ii++) {
int a;
cin >> a;
sw.at(i).set(a - 1);
}
}
for (int i = 0; i < m; i++)
cin >> p.at(i);
int cnt = 0;
for (int i = 0; i < (1 << n); i++) {
bb = i;
bool can = true;
for (int j = 0; j < m; j++) {
int tmpcnt = 0;
for (int k = 0; k < n; k++)
if (sw.at(j).test(k) && bb.test(k))
tmpcnt++;
if (tmpcnt % 2 != p.at(j))
can = false;
}
if (can)
cnt++;
}
cout << cnt << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,251 | 841,250 | u119737518 | cpp |
p03031 | #define TST 0
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// for loop
#define F(i, L, R) for (long i = L; i < R; i++)
#define FE(i, L, R) for (long i = L; i <= R; i++)
// for (reversed)
#define FR(i, L, R) for (long i = L; i > R; i--)
#define FRE(i, L, R) for (long i = L; i >= R; i--)
// data types
#define Int long
#define ul unsigned long
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned shoft
// vectors
typedef vector<int> vi;
typedef vector<long> vl;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define ALL(c) (c).begin(), (c).end()
#define last(vec) vec.size() - 1
#define lastEle(vec) vec[last(vec)]
#define pb push_back
#define InputV(a, n) \
F(i, 0, n) { \
long l; \
cin >> l; \
a.pb(l); \
}
// debug
#define DBG(vari) cerr << #vari << " = " << (vari) << endl;
#define printA(a, L, R) FE(i, L, R) cout << a[i] << (i == R ? '\n' : ' ')
#define printAF(a, L) printA(a, 0, L - 1)
#define printV(a) printA(a, 0, a.size() - 1)
#define printM(a, n, m) \
F(i, 0, n) { FE(j, 0, m) cout << a[i][j] << (i == m ? '\n' : ' '); }
// utils
#define char2int(c) (c - '0')
#define bit(x, i) (x & (1 << i))
#define space ' '
#define PI 3.14159265358979323
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define printMatrix(mat, n, m) \
{ \
F(i, 0, n) { \
F(j, 0, m) { cout << mat[i][j] << space; } \
cout << endl; \
} \
}
int main() {
#if TST == 1
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
int n, m;
cin >> n >> m;
vvi s;
int k;
vi k_num;
F(j, 0, m) {
cin >> k;
k_num.pb(k);
vi tmp;
F(i, 0, k) {
int s_tmp;
cin >> s_tmp;
tmp.pb(s_tmp);
}
s.pb(tmp);
}
vi p;
F(i, 0, m) {
int p_tmp;
cin >> p_tmp;
p.pb(p_tmp);
}
long ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
for (int j = 0; j < m; j++) {
int count = 0;
// count number of switches in s
for (int i = 0; i < k_num[i]; i++) {
if (bit & 1 << (s[j][i] - 1)) {
count++;
}
}
if (!(count % 2 == p[j])) {
// all switch do not light
goto nextbit;
}
}
// all swich turn on
ans++;
nextbit:
continue;
}
#if TST == 1
#endif
cout << ans << endl;
}
| #define TST 0
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// for loop
#define F(i, L, R) for (long i = L; i < R; i++)
#define FE(i, L, R) for (long i = L; i <= R; i++)
// for (reversed)
#define FR(i, L, R) for (long i = L; i > R; i--)
#define FRE(i, L, R) for (long i = L; i >= R; i--)
// data types
#define Int long
#define ul unsigned long
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned shoft
// vectors
typedef vector<int> vi;
typedef vector<long> vl;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define ALL(c) (c).begin(), (c).end()
#define last(vec) vec.size() - 1
#define lastEle(vec) vec[last(vec)]
#define pb push_back
#define InputV(a, n) \
F(i, 0, n) { \
long l; \
cin >> l; \
a.pb(l); \
}
// debug
#define DBG(vari) cerr << #vari << " = " << (vari) << endl;
#define printA(a, L, R) FE(i, L, R) cout << a[i] << (i == R ? '\n' : ' ')
#define printAF(a, L) printA(a, 0, L - 1)
#define printV(a) printA(a, 0, a.size() - 1)
#define printM(a, n, m) \
F(i, 0, n) { FE(j, 0, m) cout << a[i][j] << (i == m ? '\n' : ' '); }
// utils
#define char2int(c) (c - '0')
#define bit(x, i) (x & (1 << i))
#define space ' '
#define PI 3.14159265358979323
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define printMatrix(mat, n, m) \
{ \
F(i, 0, n) { \
F(j, 0, m) { cout << mat[i][j] << space; } \
cout << endl; \
} \
}
int main() {
#if TST == 1
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
int n, m;
cin >> n >> m;
vvi s;
int k;
vi k_num;
F(j, 0, m) {
cin >> k;
k_num.pb(k);
vi tmp;
F(i, 0, k) {
int s_tmp;
cin >> s_tmp;
tmp.pb(s_tmp);
}
s.pb(tmp);
}
vi p;
F(i, 0, m) {
int p_tmp;
cin >> p_tmp;
p.pb(p_tmp);
}
long ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
for (int j = 0; j < m; j++) {
int count = 0;
// count number of switches in s
for (int i = 0; i < k_num[j]; i++) {
if (bit & 1 << (s[j][i] - 1)) {
count++;
}
}
if (!(count % 2 == p[j])) {
// all switch do not light
goto nextbit;
}
}
// all swich turn on
ans++;
nextbit:
continue;
}
#if TST == 1
#endif
cout << ans << endl;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,255 | 841,256 | u177076864 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
vector<int> p(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> s[i][j];
s[i][j]--;
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
int sum = 0;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < s[j].size(); j++) {
if (bit & (1 << s[i][j])) {
cnt++;
}
}
if (cnt % 2 == p[i]) {
sum++;
}
}
if (sum == m) {
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
vector<int> p(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> s[i][j];
s[i][j]--;
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
int sum = 0;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < s[i].size(); j++) {
if (bit & (1 << s[i][j])) {
cnt++;
}
}
if (cnt % 2 == p[i]) {
sum++;
}
}
if (sum == m) {
ans++;
}
}
cout << ans << endl;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,270 | 841,271 | u244626757 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<int>;
#define rep(n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define gSort(a) sort(a.begin(), a.end(), greater<int>())
#define pout(n, a) cout << fixed << setprecision(n) << (a)
#define Cast(dig, n) static_cast<std::bitset<(dig)>>(n)
const int INF = 2147483647;
const ll MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
// s[i][j] i:m j:ki
vector<vector<int>> s(m);
for (int i = 0; i < m; ++i) {
int k = 0;
cin >> k;
for (int j = 0; j < k; ++j) {
int swt = 0;
cin >> swt;
--swt;
s[i].emplace_back(swt);
}
}
// 0:偶数個 1:奇数個
vector<int> p(m);
rep(m) { cin >> p[i]; }
ll ans = 0;
// スイッチのON/OFFの全パターン
for (int bit = 1; bit < (1 << n); ++bit) {
// パターンが条件を満たすか
bool judge = true;
// 電球iの時を考える
for (int i = 0; i < m; ++i) {
// cout << i << " Light Bulb simulated" << endl;
int swt = 0;
for (auto j : s[i]) {
// cout << Cast(10, bit) << " & " << Cast(10, (1 << j)) << endl;
if (bit & (1 << j)) {
// cout << "Switch " << j << " is ON" << endl;
++swt;
}
}
if ((swt % 2 != p[i])) {
judge = false;
break;
} else {
// cout << i << " Light Bulb is POWERED!!" << endl;
}
}
if (judge) {
// cout << "ans_bit = " << Cast(10, bit) << endl;
++ans;
}
// cout << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<int>;
#define rep(n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define gSort(a) sort(a.begin(), a.end(), greater<int>())
#define pout(n, a) cout << fixed << setprecision(n) << (a)
#define Cast(dig, n) static_cast<std::bitset<(dig)>>(n)
const int INF = 2147483647;
const ll MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
// s[i][j] i:m j:ki
vector<vector<int>> s(m);
for (int i = 0; i < m; ++i) {
int k = 0;
cin >> k;
for (int j = 0; j < k; ++j) {
int swt = 0;
cin >> swt;
--swt;
s[i].emplace_back(swt);
}
}
// 0:偶数個 1:奇数個
vector<int> p(m);
rep(m) { cin >> p[i]; }
ll ans = 0;
// スイッチのON/OFFの全パターン
for (int bit = 0; bit < (1 << n); ++bit) {
// パターンが条件を満たすか
bool judge = true;
// 電球iの時を考える
for (int i = 0; i < m; ++i) {
// cout << i << " Light Bulb simulated" << endl;
int swt = 0;
for (auto j : s[i]) {
// cout << Cast(10, bit) << " & " << Cast(10, (1 << j)) << endl;
if (bit & (1 << j)) {
// cout << "Switch " << j << " is ON" << endl;
++swt;
}
}
if ((swt % 2 != p[i])) {
judge = false;
break;
} else {
// cout << i << " Light Bulb is POWERED!!" << endl;
}
}
if (judge) {
// cout << "ans_bit = " << Cast(10, bit) << endl;
++ans;
}
// cout << endl;
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,274 | 841,275 | u043377689 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
signed main(void) {
int n, m, cnt, ans;
cin >> n >> m;
vector<int> s[m];
int p[m];
bool ok;
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int st;
cin >> st;
s[i].push_back(st);
}
}
rep(i, m) cin >> p[i];
ans = 0;
for (int bit = 1; bit < (1 << n); bit++) {
vector<int> v;
for (int i = 0; i < n; i++) {
if (bit & (1 << i)) {
v.push_back(i + 1);
}
}
ok = true;
rep(j, m) {
cnt = 0;
rep(k, s[j].size()) {
rep(i, v.size()) {
if (v[i] == s[j][k])
cnt++;
}
}
if (cnt % 2 != p[j])
ok = false;
}
if (ok)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
signed main(void) {
int n, m, cnt, ans;
cin >> n >> m;
vector<int> s[m];
int p[m];
bool ok;
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int st;
cin >> st;
s[i].push_back(st);
}
}
rep(i, m) cin >> p[i];
ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
vector<int> v;
for (int i = 0; i < n; i++) {
if (bit & (1 << i)) {
v.push_back(i + 1);
}
}
ok = true;
rep(j, m) {
cnt = 0;
rep(k, s[j].size()) {
rep(i, v.size()) {
if (v[i] == s[j][k])
cnt++;
}
}
if (cnt % 2 != p[j])
ok = false;
}
if (ok)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,278 | 841,279 | u890331732 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
int D1[10] = {};
int D2[100] = {};
int D3[1000] = {};
int main() {
int N, M;
cin >> N >> M;
bool Sk[M][N] = {};
int k, sj;
rep(i, M) {
cin >> k;
rep(j, k) {
cin >> sj;
Sk[i][sj] = true;
}
}
bool P[15];
rep(i, M) cin >> P[i];
int ans = 0;
for (int bit = 0; bit < (1 << N); bit++) {
bool all_light = true;
rep(m, M) {
int cnt_on = 0;
rep(n, N) {
if ((Sk[m][n]) && (bit & 1 << n))
cnt_on++;
}
if (cnt_on % 2 != P[m])
all_light = false;
}
if (all_light)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
int D1[10] = {};
int D2[100] = {};
int D3[1000] = {};
int main() {
int N, M;
cin >> N >> M;
bool Sk[M][N] = {};
int k, sj;
rep(i, M) {
cin >> k;
rep(j, k) {
cin >> sj;
Sk[i][sj - 1] = true;
}
}
bool P[M];
rep(i, M) cin >> P[i];
int ans = 0;
for (int bit = 0; bit < (1 << N); bit++) {
bool all_light = true;
rep(m, M) {
int cnt_on = 0;
rep(n, N) {
if ((Sk[m][n]) && (bit & 1 << n))
cnt_on++;
}
if (cnt_on % 2 != P[m])
all_light = false;
}
if (all_light)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"assignment.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change"
] | 841,280 | 841,281 | u494249944 | cpp |
p03031 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> void cout_vector(vector<T> A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(M);
vector<int> P(M);
vector<int> K(M);
int ans = 0;
rep(i, M) {
int k;
cin >> k;
vector<int> s(k);
rep(j, k) cin >> s[j];
S[i] = s;
}
rep(i, M) cin >> P[i];
for (int bit = 0; bit < N * N; bit++) {
bool flag = true;
vector<int> True_switch;
for (int i = 0; i < N; i++) {
if (bit & (1 << i)) {
True_switch.push_back(i + 1);
}
}
// cout << "----------" << endl;
// cout_vector(True_switch);
int m = 0;
rep(k, M) {
int on_count = 0;
for (int s : S[k]) { // S[k]についてonになっているスイッチを取得
for (int t : True_switch) {
if (s == t)
on_count++;
}
}
flag = (on_count % 2 == P[k]);
if (!(flag))
break; //ダメになったらその時点でループ打ち切り
m++;
}
(m == M) && (ans++);
}
cout << ans << endl;
return 0;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> void cout_vector(vector<T> A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(M);
vector<int> P(M);
vector<int> K(M);
int ans = 0;
rep(i, M) {
int k;
cin >> k;
vector<int> s(k);
rep(j, k) cin >> s[j];
S[i] = s;
}
rep(i, M) cin >> P[i];
for (int bit = 0; bit < (1 << N); bit++) {
bool flag = true;
vector<int> True_switch;
for (int i = 0; i < N; i++) {
if (bit & (1 << i)) {
True_switch.push_back(i + 1);
}
}
// cout << "----------" << endl;
// cout_vector(True_switch);
int m = 0;
rep(k, M) {
int on_count = 0;
for (int s : S[k]) {
for (int t : True_switch) {
if (s == t)
on_count++;
}
}
flag = (on_count % 2 == P[k]);
if (!(flag))
break;
m++;
}
(m == M) && (ans++);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 841,284 | 841,285 | u879294842 | cpp |
p03031 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> void cout_vector(vector<T> A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(M);
vector<int> P(M);
vector<int> K(M);
int ans = 0;
rep(i, M) {
int k;
cin >> k;
vector<int> s(k);
rep(j, k) cin >> s[j];
S[i] = s;
}
rep(i, M) cin >> P[i];
for (int bit = 0; bit < N * N; bit++) {
bool flag = true;
vector<int> True_switch;
for (int i = 0; i < N; i++) {
if (bit & (1 << i)) {
True_switch.push_back(i + 1);
}
}
int m = 0;
rep(k, M) {
int on_count = 0;
for (int s : S[k]) {
for (int t : True_switch) {
if (s == t)
on_count++;
}
}
flag = (on_count % 2 == P[k]);
if (!(flag))
break;
m++;
}
(m == M) && (ans++);
}
cout << ans << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> void cout_vector(vector<T> A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(M);
vector<int> P(M);
vector<int> K(M);
int ans = 0;
rep(i, M) {
int k;
cin >> k;
vector<int> s(k);
rep(j, k) cin >> s[j];
S[i] = s;
}
rep(i, M) cin >> P[i];
for (int bit = 0; bit < (1 << N); bit++) {
bool flag = true;
vector<int> True_switch;
for (int i = 0; i < N; i++) {
if (bit & (1 << i)) {
True_switch.push_back(i + 1);
}
}
// cout << "----------" << endl;
// cout_vector(True_switch);
int m = 0;
rep(k, M) {
int on_count = 0;
for (int s : S[k]) {
for (int t : True_switch) {
if (s == t)
on_count++;
}
}
flag = (on_count % 2 == P[k]);
if (!(flag))
break;
m++;
}
(m == M) && (ans++);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 841,286 | 841,285 | u879294842 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
REP(i, m) {
int k;
cin >> k;
s[i].resize(k, 0);
REP(j, k) { cin >> s[i][j]; }
}
vector<int> p(m, 0);
REP(i, m) cin >> p[i];
int cnt = 0;
for (int i = 1; i < (1 << n); i++) {
int light[n] = {0};
for (int j = 0; j < n; j++) {
if (i & 1 << j) {
light[j] = 1;
}
}
int f = 1;
REP(j, m) {
int cc = 0;
REP(k, s[j].size()) {
if (light[s[j][k] - 1] == 1)
cc++;
}
if (cc % 2 != p[j]) {
f = 0;
break;
}
if (f == 0)
break;
}
if (f)
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
REP(i, m) {
int k;
cin >> k;
s[i].resize(k, 0);
REP(j, k) { cin >> s[i][j]; }
}
vector<int> p(m, 0);
REP(i, m) cin >> p[i];
int cnt = 0;
// bit全探索
for (int i = 0; i < (1 << n); i++) {
int light[n] = {0}; //組み合わせを保存
for (int j = 0; j < n; j++) {
if (i & 1 << j) {
light[j] = 1;
}
}
//この組み合わせでf==1のままならcnt++
int f = 1;
//電球 m個について考える
REP(j, m) {
// 電球jが光るかどうか
int cc = 0; //スイッチカウント
REP(k, s[j].size()) { //スイッチ
//添字に気をつける
if (light[s[j][k] - 1] == 1)
cc++;
}
if (cc % 2 != p[j]) {
f = 0;
break;
}
if (f == 0)
break;
}
if (f)
cnt++;
}
cout << cnt << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,287 | 841,288 | u852839243 | cpp |
p03031 | //
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/04/04.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
// ABC128
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
// const ll INF = 1LL<<60;
// const int INF = 1<<29;
// const ll MOD = 1000000007;
//#define __DBG__
void solve(void) {
int N, M;
cin >> N >> M;
vector<bitset<10>> S(N, 0);
vector<int> P(M, 0);
REP(i, M) {
int K;
cin >> K;
int L;
REP(j, K) {
cin >> L;
L--;
S[j].set(L);
}
}
REP(i, M) { cin >> P[i]; }
int t = 0;
REP(i, 1 << N) {
bool flag = true;
REP(j, M) {
bitset<10> tmp = S[j] & bitset<10>(i);
// cout << bitset<10>(i) << "/" << bitset<10>(tmp) << " " <<
// tmp.count()%2 << ":" << P[j] << endl;
if (tmp.count() % 2 == P[j]) {
continue;
} else {
flag = false;
break;
}
}
if (flag)
t++;
}
cout << t << endl;
return;
}
#define TESTCASES 1
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
REP(i, TESTCASES) { solve(); }
return 0;
}
| //
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/04/04.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
// ABC128
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
// const ll INF = 1LL<<60;
// const int INF = 1<<29;
// const ll MOD = 1000000007;
//#define __DBG__
void solve(void) {
int N, M;
cin >> N >> M;
vector<bitset<10>> S(N, 0);
vector<int> P(M, 0);
REP(i, M) {
int K;
cin >> K;
int L;
REP(j, K) {
cin >> L;
L--;
S[i].set(L);
}
}
REP(i, M) { cin >> P[i]; }
int t = 0;
REP(i, 1 << N) {
bool flag = true;
REP(j, M) {
bitset<10> tmp = S[j] & bitset<10>(i);
// cout << bitset<10>(i) << "/" << bitset<10>(tmp) << " " <<
// tmp.count()%2 << ":" << P[j] << endl;
if (tmp.count() % 2 == P[j]) {
continue;
} else {
flag = false;
break;
}
}
if (flag)
t++;
}
cout << t << endl;
return;
}
#define TESTCASES 1
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
REP(i, TESTCASES) { solve(); }
return 0;
}
| [
"identifier.change",
"variable_access.subscript.index.change"
] | 841,289 | 841,290 | u671267423 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m, sw[10];
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
bitset<10> s;
cin >> k;
for (int j = 0; j < k; j++) {
int sw_tmp;
cin >> sw_tmp;
s.set(sw_tmp - 1);
}
sw[i] = s.to_ulong();
}
int p[20];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
// bit全探索
// (1<<n) = 2^n
// 今回はmax10なので1024回るーぷ
int ans = 0;
for (int bit = 1; bit < (1 << n); ++bit) {
vector<int> vec;
for (int i = 0; i < n; ++i) {
// bit に i番目のフラグが立っている
if (bit & (1 << i)) {
vec.push_back(i);
}
}
// 電球m回(max 10)ループ
bool flag = true;
for (int light = 0; light < m; light++) {
// cout << "flag " << flag << endl;
// cout << endl;
// cout << "bit " << bit << endl;
// cout << "light " << light << endl;
int count = 0;
for (int i = 0; i < (int)vec.size(); ++i) {
// onの時
if (sw[light] & (1 << vec[i])) {
count++;
}
}
// cout << "count " << count << endl;
// cout << "p " << p[light] << endl;
if (count % 2 != p[light]) {
flag = false;
continue;
}
}
if (flag) {
ans++;
}
}
// for (int i=0;i<m;i++) {
// cout << s[i] << endl;
// }
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m, sw[10];
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
bitset<10> s;
cin >> k;
for (int j = 0; j < k; j++) {
int sw_tmp;
cin >> sw_tmp;
s.set(sw_tmp - 1);
}
sw[i] = s.to_ulong();
}
int p[20];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
// bit全探索
// (1<<n) = 2^n
// 今回はmax10なので1024回るーぷ
int ans = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
vector<int> vec;
for (int i = 0; i < n; ++i) {
// bit に i番目のフラグが立っている
if (bit & (1 << i)) {
vec.push_back(i);
}
}
// 電球m回(max 10)ループ
bool flag = true;
for (int light = 0; light < m; light++) {
// cout << "flag " << flag << endl;
// cout << endl;
// cout << "bit " << bit << endl;
// cout << "light " << light << endl;
int count = 0;
for (int i = 0; i < (int)vec.size(); ++i) {
// onの時
if (sw[light] & (1 << vec[i])) {
count++;
}
}
// cout << "count " << count << endl;
// cout << "p " << p[light] << endl;
if (count % 2 != p[light]) {
flag = false;
continue;
}
}
if (flag) {
ans++;
}
}
// for (int i=0;i<m;i++) {
// cout << s[i] << endl;
// }
cout << ans;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,296 | 841,297 | u576375251 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> light(m);
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
light[i].resize(k); // kore!!!!
cin >> light[i][j];
--light[i][j];
}
}
vector<int> p(m);
for (int i = 0; i < m; ++i)
cin >> p[i];
// bit全探索
// (1<<n) = 2^n
// 今回はmax10なので1024回るーぷ
int ans = 0;
for (int bit = 1; bit < (1 << n); ++bit) {
// 電球m回(max 10)ループ
bool flag = true;
for (int i = 0; i < m; i++) {
int count = 0;
for (int j = 0; j < (int)light[i].size(); ++j) {
// onの時
if ((bit >> light[i][j]) & 1) {
count++;
}
}
if (count % 2 != p[i]) {
flag = false;
continue;
}
}
if (flag)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> light(m);
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
light[i].resize(k); // kore!!!!
cin >> light[i][j];
--light[i][j];
}
}
vector<int> p(m);
for (int i = 0; i < m; ++i)
cin >> p[i];
// bit全探索
// (1<<n) = 2^n
// 今回はmax10なので1024回るーぷ
int ans = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
// 電球m回(max 10)ループ
bool flag = true;
for (int i = 0; i < m; i++) {
int count = 0;
for (int j = 0; j < (int)light[i].size(); ++j) {
// onの時
if ((bit >> light[i][j]) & 1) {
++count;
}
}
if (count % 2 != p[i]) {
flag = false;
continue;
}
}
if (flag)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,298 | 841,299 | u576375251 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#include <map>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool is_prime(int k, int i) {
if (k == 2)
return true;
if (k <= i)
return true;
else {
if (k % i == 0)
return false;
else
return is_prime(k, i + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s;
REP(i, m) {
int k;
cin >> k;
vector<int> s_i(k);
REP(j, k) { cin >> s_i[j]; }
s.push_back(s_i);
}
vector<int> p(m);
REP(i, m) { cin >> p[i]; }
int counter = 0;
REP(i, pow(2, n)) {
ll bi_i = i;
vector<int> bi(m);
REP(j, n) {
bi[j] = bi_i % 2;
bi_i /= 2;
}
bool flag = true;
REP(j, m) {
int swi_sum = 0;
for (int sw : s[j]) {
if (bi[sw - 1] == 1) {
swi_sum += 1;
}
}
if (swi_sum % 2 != p[j]) {
flag = false;
break;
}
}
if (flag)
counter += 1;
}
cout << counter << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#include <map>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool is_prime(int k, int i) {
if (k == 2)
return true;
if (k <= i)
return true;
else {
if (k % i == 0)
return false;
else
return is_prime(k, i + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s;
REP(i, m) {
int k;
cin >> k;
vector<int> s_i(k);
REP(j, k) { cin >> s_i[j]; }
s.push_back(s_i);
}
vector<int> p(m);
REP(i, m) { cin >> p[i]; }
int counter = 0;
REP(i, pow(2, n)) {
ll bi_i = i;
vector<int> bi(n);
REP(j, n) {
bi[j] = bi_i % 2;
bi_i /= 2;
}
/*REP(j, n) {
cout << bi[j] << ' ';
}
cout << endl;*/
bool flag = true;
REP(j, m) {
int swi_sum = 0;
for (int sw : s[j]) {
/*cout << "sw = " << sw - 1 << endl;*/
if (bi[sw - 1] == 1) {
swi_sum += 1;
}
}
/*cout << "swi_sum = " << swi_sum << endl;*/
if (swi_sum % 2 != p[j]) {
flag = false;
}
}
if (flag)
counter += 1;
}
cout << counter << endl;
} | [] | 841,302 | 841,301 | u579355226 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = vector<vd>;
using vvvi = vector<vvi>;
using vvvll = vector<vvll>;
using vvvd = vector<vvd>;
const double pi = 3.141592653589793;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> d;
rep(i, m) {
int k;
cin >> k;
vector<int> d1;
rep(j, k) {
int s;
cin >> s;
d1.push_back(s);
}
d.push_back(d1);
}
int p[m];
rep(i, m) { cin >> p[i]; }
int ans = 0;
for (int i = 1; i < (1 << n); i++) {
bitset<10> s(i);
int b = 1;
for (int j = 0; j < m; j++) {
int c = 0;
for (int x : d[j]) {
if (s.test(x - 1)) {
c += 1;
}
}
if (c % 2 != p[j]) {
b = 0;
break;
}
}
if (b) {
ans += 1;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = vector<vd>;
using vvvi = vector<vvi>;
using vvvll = vector<vvll>;
using vvvd = vector<vvd>;
const double pi = 3.141592653589793;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> d;
rep(i, m) {
int k;
cin >> k;
vector<int> d1;
rep(j, k) {
int s;
cin >> s;
d1.push_back(s);
}
d.push_back(d1);
}
int p[m];
rep(i, m) { cin >> p[i]; }
int ans = 0;
for (int i = 0; i < (1 << n); i++) {
bitset<10> s(i);
int b = 1;
for (int j = 0; j < m; j++) {
int c = 0;
for (int x : d[j]) {
if (s.test(x - 1)) {
c += 1;
}
}
if (c % 2 != p[j]) {
b = 0;
break;
}
}
if (b) {
ans += 1;
}
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,307 | 841,308 | u518042385 | cpp |
p03031 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod = 1000000007;
int k[123], s[123][123], p[123];
signed main() {
int n, m, ans = 0;
cin >> n >> m;
for (int h = 0; h < m; h++) {
cin >> k[h];
for (int i = 0; i < k[h]; i++) {
cin >> s[h][i];
}
}
for (int h = 0; h < m; h++) {
cin >> p[h];
}
for (int i = 0; i <= (1 << n); i++) {
vector<int> sep = {};
int dame = 0;
for (int j = 0; j <= n - 1; j++) {
if ((i & (1 << j)) > 0) {
sep.push_back(j + 1);
}
}
if (sep.size() == 0) {
continue;
}
for (int h = 0; h < m; h++) {
int cnt = 0;
for (int x = 0; x < k[h]; x++) {
for (int y = 0; y < sep.size(); y++) {
if (s[h][x] == sep[y]) {
cnt++;
}
}
}
if (cnt % 2 != p[h]) {
dame = 1;
}
}
if (dame == 0) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod = 1000000007;
int k[123], s[123][123], p[123];
signed main() {
int n, m, ans = 0;
cin >> n >> m;
for (int h = 0; h < m; h++) {
cin >> k[h];
for (int i = 0; i < k[h]; i++) {
cin >> s[h][i];
}
}
for (int h = 0; h < m; h++) {
cin >> p[h];
}
for (int i = 0; i <= (1 << n); i++) {
vector<int> sep = {};
int dame = 0;
for (int j = 0; j <= n - 1; j++) {
if ((i & (1 << j)) > 0) {
sep.push_back(j + 1);
}
}
if (i == 0) {
continue;
}
for (int h = 0; h < m; h++) {
int cnt = 0;
for (int x = 0; x < k[h]; x++) {
for (int y = 0; y < sep.size(); y++) {
if (s[h][x] == sep[y]) {
cnt++;
}
}
}
if (cnt % 2 != p[h]) {
dame = 1;
}
}
if (dame == 0) {
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.remove"
] | 841,311 | 841,312 | u986568278 | cpp |
p03031 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[m];
bool s[m][n] = {};
int tmp;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> tmp;
s[i][tmp - 1] = true;
}
}
int p[m];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
// cout << "\n";
// for (int i = 0; i < m; i++){
// for (int j = 0; j < n; j++){
// cout << (int)s[i][j] << " ";
// }
// cout << "\n";
// }
// cout << "\n";
bool jud;
int connect;
int count = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
jud = true;
for (int i = 0; i < m; i++) {
connect = 0;
for (int j = 0; j < n; j++) {
if (s[i][j] && (bit & (1 << i)))
connect++;
}
if (connect % 2 != p[i] || connect < 1)
jud = false;
}
if (jud)
count++;
}
cout << count << "\n";
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[m];
bool s[m][n] = {};
int tmp;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> tmp;
s[i][tmp - 1] = true;
}
}
int p[m];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
// cout << "\n";
// for (int i = 0; i < m; i++){
// for (int j = 0; j < n; j++){
// cout << (int)s[i][j] << " ";
// }
// cout << "\n";
// }
// cout << "\n";
bool jud;
int connect;
int count = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
jud = true;
for (int i = 0; i < m; i++) {
connect = 0;
for (int j = 0; j < n; j++) {
if (s[i][j] && (bit & (1 << j)))
connect++;
}
if (connect % 2 != p[i])
jud = false;
}
if (jud)
count++;
}
cout << count << "\n";
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 841,313 | 841,314 | u568501780 | cpp |
p03031 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[m];
bool s[m][n] = {};
int tmp;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> tmp;
s[i][tmp - 1] = true;
}
}
int p[m];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
// cout << "\n";
// for (int i = 0; i < m; i++){
// for (int j = 0; j < n; j++){
// cout << (int)s[i][j] << " ";
// }
// cout << "\n";
// }
// cout << "\n";
bool jud;
int connect;
int count = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
jud = true;
for (int i = 0; i < m; i++) {
connect = 0;
for (int j = 0; j < n; j++) {
if (s[i][j] && (bit & (1 << i)))
connect++;
}
if (connect % 2 != p[i])
jud = false;
}
if (jud)
count++;
}
cout << count / 2 << "\n";
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[m];
bool s[m][n] = {};
int tmp;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> tmp;
s[i][tmp - 1] = true;
}
}
int p[m];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
// cout << "\n";
// for (int i = 0; i < m; i++){
// for (int j = 0; j < n; j++){
// cout << (int)s[i][j] << " ";
// }
// cout << "\n";
// }
// cout << "\n";
bool jud;
int connect;
int count = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
jud = true;
for (int i = 0; i < m; i++) {
connect = 0;
for (int j = 0; j < n; j++) {
if (s[i][j] && (bit & (1 << j)))
connect++;
}
if (connect % 2 != p[i])
jud = false;
}
if (jud)
count++;
}
cout << count << "\n";
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 841,315 | 841,314 | u568501780 | cpp |
p03031 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
s--;
S[i].push_back(s);
}
}
vector<int> p(M);
for (int i = 0; i < M; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 1; i < (1 << N); i++) {
int n = i;
vector<bool> on(N, false);
for (int j = 0; j < N; j++) {
if (n % 2 == 1) {
on[j] = true;
}
n /= 2;
}
bool ok = true;
for (int m = 0; m < M; m++) {
int cnt = 0;
for (int s : S[m]) {
if (on[s]) {
cnt++;
}
}
if (cnt % 2 != p[m]) {
ok = false;
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
s--;
S[i].push_back(s);
}
}
vector<int> p(M);
for (int i = 0; i < M; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < (1 << N); i++) {
int n = i;
vector<bool> on(N, false);
for (int j = 0; j < N; j++) {
if (n % 2 == 1) {
on[j] = true;
}
n /= 2;
}
bool ok = true;
for (int m = 0; m < M; m++) {
int cnt = 0;
for (int s : S[m]) {
if (on[s]) {
cnt++;
}
}
if (cnt % 2 != p[m]) {
ok = false;
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,334 | 841,335 | u119098168 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000001;
constexpr ll INF = 1e18;
constexpr ll MOD = 998244353;
const double PI = 3.1415926535897;
typedef pair<ll, ll> P;
int main() {
int N, M;
cin >> N >> M;
vector<int> S[20];
for (int i = 0; i < M; i++) {
int A;
cin >> A;
for (int i = 0; i < A; i++) {
int B;
cin >> B;
S[B - 1].push_back(i);
}
}
vector<int> vec(M);
for (int i = 0; i < M; i++) {
cin >> vec.at(i);
}
int ret = 0;
for (int bit = 0; bit < (1 << N); bit++) {
vector<bool> on;
for (int i = 0; i < N; i++) {
if (bit & (1 << i)) {
on.push_back(i);
}
}
vector<int> cnt(M);
for (int i = 0; i < on.size(); i++) {
for (int j = 0; j < S[on.at(i)].size(); j++) {
cnt.at(S[on.at(i)].at(j))++;
}
}
bool ret2 = true;
for (int i = 0; i < M; i++) {
if (cnt.at(i) % 2 != vec.at(i)) {
ret2 = false;
}
}
if (ret2 == true) {
ret++;
}
}
cout << ret << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000001;
constexpr ll INF = 1e18;
constexpr ll MOD = 998244353;
const double PI = 3.1415926535897;
typedef pair<ll, ll> P;
int main() {
int N, M;
cin >> N >> M;
vector<int> S[20];
for (int i = 0; i < M; i++) {
int A;
cin >> A;
for (int j = 0; j < A; j++) {
int B;
cin >> B;
S[B - 1].push_back(i);
}
}
vector<int> vec(M);
for (int i = 0; i < M; i++) {
cin >> vec.at(i);
}
int ret = 0;
for (int bit = 0; bit < (1 << N); bit++) {
vector<int> on;
for (int i = 0; i < N; i++) {
if (bit & (1 << i)) {
on.push_back(i);
}
}
vector<int> cnt(M);
for (int i = 0; i < on.size(); i++) {
for (int j = 0; j < S[on.at(i)].size(); j++) {
cnt.at(S[on.at(i)].at(j))++;
}
}
bool ret2 = true;
for (int i = 0; i < M; i++) {
if (cnt.at(i) % 2 != vec.at(i)) {
ret2 = false;
}
}
if (ret2 == true) {
ret++;
}
}
cout << ret << endl;
} | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change"
] | 841,336 | 841,337 | u322714721 | cpp |
p03031 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
#define debug_vi(v) \
copy((v).begin(), (v).end(), ostream_iterator<int>(cout, " "));
#define debug_vll(v) \
copy((v).begin(), (v).end(), ostream_iterator<long long>(cout, " "));
#define debug_vd(v) \
copy((v).begin(), (v).end(), ostream_iterator<double>(cout, " "));
#define sort_v(v) sort((v).begin(), (v).end()); //昇順
#define d_sort_vi(v) sort((v).begin(), (v).end(), greater<int>()); //昇順
#define d_sort_vd(v) sort((v).begin(), (v).end(), greater<double>()); //昇順
int main() {
int n, m;
cin >> n >> m;
vector<int> result(m);
vector<vector<int>> hoge(m, vector<int>(n));
int tmp;
for (int i = 0; i < m; i++) {
cin >> tmp;
for (int v = 0; v < tmp; v++) {
cin >> hoge[i][v];
}
}
for (int i = 0; i < m; i++) {
cin >> result[i];
}
int count = 0;
int kumi = 0;
bool f = true;
for (int bit = 0; bit < (1 << n); bit++) {
// cout << bitset<3>(bit) << endl;
f = true;
for (int i = 0; i < m; i++) {
for (int v = 0; v < hoge[i].size(); v++) {
if (hoge[i][v] == 0) {
continue;
}
if ((bit >> (hoge[i][v] - 1)) & 1) {
count += 1;
}
}
if (count % 2 != result[i]) {
f = false;
// break;
}
}
if (f) {
// cout << bitset<3>(bit) << endl;
kumi += 1;
}
}
cout << kumi << endl;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
#define debug_vi(v) \
copy((v).begin(), (v).end(), ostream_iterator<int>(cout, " "));
#define debug_vll(v) \
copy((v).begin(), (v).end(), ostream_iterator<long long>(cout, " "));
#define debug_vd(v) \
copy((v).begin(), (v).end(), ostream_iterator<double>(cout, " "));
#define sort_v(v) sort((v).begin(), (v).end()); //昇順
#define d_sort_vi(v) sort((v).begin(), (v).end(), greater<int>()); //昇順
#define d_sort_vd(v) sort((v).begin(), (v).end(), greater<double>()); //昇順
int main() {
int n, m;
cin >> n >> m;
vector<int> result(m);
vector<vector<int>> hoge(m, vector<int>(n));
int tmp;
for (int i = 0; i < m; i++) {
cin >> tmp;
for (int v = 0; v < tmp; v++) {
cin >> hoge[i][v];
}
}
for (int i = 0; i < m; i++) {
cin >> result[i];
}
int count = 0;
int kumi = 0;
bool f = true;
for (int bit = 0; bit < (1 << n); bit++) {
// cout << bitset<3>(bit) << endl;
f = true;
for (int i = 0; i < m; i++) {
for (int v = 0; v < hoge[i].size(); v++) {
if (hoge[i][v] == 0) {
continue;
}
if ((bit >> (hoge[i][v] - 1)) & 1) {
count += 1;
}
}
if (count % 2 != result[i]) {
f = false;
// break;
}
count = 0;
}
if (f) {
// cout << bitset<3>(bit) << endl;
kumi += 1;
}
}
cout << kumi << endl;
} | [
"assignment.add"
] | 841,342 | 841,343 | u981388291 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int counter_function(int x) {
if (x == 0) {
return 0;
}
return counter_function(x >> 1) + (x & 1);
}
int main() {
int N, M, k, on_switch_cnt, on_light_cnt, all_light;
vector<vector<int>> s;
vector<int> p;
cin >> N >> M;
s.resize(M);
p.resize(M);
for (int i = 0; i < M; i++) {
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < M; i++) {
cin >> p[i];
}
all_light = 0; //全ての電球が点灯しているときの数
for (int bits = 0; bits <= (1 << N); bits++) { // 2^Nパターンを2bit全探索
on_light_cnt = 0; //点灯している電球の数
for (int i = 0; i < M; i++) {
on_switch_cnt = 0;
for (int j = 0; j < s[i].size(); j++) {
if ((bits >> (s[i][j] - 1)) & 1) {
on_switch_cnt++;
}
}
if (on_switch_cnt % 2 == p[i]) {
on_light_cnt++;
}
}
if (on_light_cnt == M) {
all_light++;
}
}
cout << all_light << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int counter_function(int x) {
if (x == 0) {
return 0;
}
return counter_function(x >> 1) + (x & 1);
}
int main() {
int N, M, k, on_switch_cnt, on_light_cnt, all_light;
vector<vector<int>> s;
vector<int> p;
cin >> N >> M;
s.resize(M);
p.resize(M);
for (int i = 0; i < M; i++) {
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < M; i++) {
cin >> p[i];
}
all_light = 0; //全ての電球が点灯しているときの数
for (int bits = 0; bits < (1 << N); bits++) { // 2^Nパターンを2bit全探索
on_light_cnt = 0; //点灯している電球の数
for (int i = 0; i < M; i++) {
on_switch_cnt = 0;
for (int j = 0; j < s[i].size(); j++) {
if ((bits >> (s[i][j] - 1)) & 1) {
on_switch_cnt++;
}
}
if (on_switch_cnt % 2 == p[i]) {
on_light_cnt++;
}
}
if (on_light_cnt == M) {
all_light++;
}
}
cout << all_light << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,346 | 841,347 | u440276250 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vector誤字保険
#define ednl endl // endl誤字保険
#define opt() \
cin.tie(0); \
ios::sync_with_stdio(false) // 入出力速度改善
#define rep(i, l, r) \
for (ll i = (l); i < (r); i++) // 範囲[l, r)で刻み1のfor文(順方向)
#define repp(i, l, r, k) \
for (ll i = (l); i < (r); i += (k)) // 範囲[l, r)で刻みkのfor文(順方向)
#define rrep(i, l, r) \
for (ll i = (r - 1); i >= (l); i--) // 範囲[l, r)で刻み1のfor文(逆方向)
#define rrepp(i, l, r, k) \
for (ll i = (r - 1); i >= (l); i -= (k)) // 範囲[l, r)で刻みkのfor文(逆方向)
#define all(x) (x).begin(), (x).end() // vectorのポインタ位置指定用
#define max(p, q) ((p) > (q) ? (p) : (q)) // max拡張
#define min(p, q) ((p) < (q) ? (p) : (q)) // min拡張
#define bit(n, m) (((n) >> (m)) & 1) // 変数nのm番目のbitを取り出す
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dy[] = {0, 1, 0, -1}; // 4方向近傍
int dx[] = {1, 0, -1, 0}; // 4方向近傍
#define INF ((1LL << 62) - (1LL << 31))
//#define MOD 998244353
#define MOD 1000000007
#define invp(a, p) pom(a, p - 2, p)
////////////////////////////////////////////////////////////////////////////////////////
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
bool fuck(char c) {
return (c == 'a' || c == 't' || c == 'c' || c == 'o' || c == 'd' ||
c == 'e' || c == 'r' || c == '@');
}
int main() {
ll n, m;
cin >> n >> m;
vector<vector<ll>> s;
rep(i, 0, m) {
ll k;
cin >> k;
vector<ll> tmp;
rep(j, 0, k) {
ll t;
cin >> t;
t--;
tmp.pb(t);
}
s.pb(tmp);
}
ll p[m];
rep(i, 0, m) cin >> p[i];
ll res = 0;
// cout << (1<<n)+1<<endl;
rep(i, 0, (1 << n) + 1) {
vector<ll> v;
rep(j, 0, n) if (i >> j & 1) v.pb(j);
ll light[m];
rep(j, 0, m) light[j] = 0;
rep(j, 0, v.size()) {
rep(l, 0, m) { rep(k, 0, s[l].size()) if (s[l][k] == v[j]) light[l]++; }
}
bool f = true;
rep(j, 0, m) {
if (light[j] % 2 != p[j]) {
f = false;
break;
}
}
if (f)
res++;
}
cout << res << ednl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vector誤字保険
#define ednl endl // endl誤字保険
#define opt() \
cin.tie(0); \
ios::sync_with_stdio(false) // 入出力速度改善
#define rep(i, l, r) \
for (ll i = (l); i < (r); i++) // 範囲[l, r)で刻み1のfor文(順方向)
#define repp(i, l, r, k) \
for (ll i = (l); i < (r); i += (k)) // 範囲[l, r)で刻みkのfor文(順方向)
#define rrep(i, l, r) \
for (ll i = (r - 1); i >= (l); i--) // 範囲[l, r)で刻み1のfor文(逆方向)
#define rrepp(i, l, r, k) \
for (ll i = (r - 1); i >= (l); i -= (k)) // 範囲[l, r)で刻みkのfor文(逆方向)
#define all(x) (x).begin(), (x).end() // vectorのポインタ位置指定用
#define max(p, q) ((p) > (q) ? (p) : (q)) // max拡張
#define min(p, q) ((p) < (q) ? (p) : (q)) // min拡張
#define bit(n, m) (((n) >> (m)) & 1) // 変数nのm番目のbitを取り出す
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dy[] = {0, 1, 0, -1}; // 4方向近傍
int dx[] = {1, 0, -1, 0}; // 4方向近傍
#define INF ((1LL << 62) - (1LL << 31))
//#define MOD 998244353
#define MOD 1000000007
#define invp(a, p) pom(a, p - 2, p)
////////////////////////////////////////////////////////////////////////////////////////
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
bool fuck(char c) {
return (c == 'a' || c == 't' || c == 'c' || c == 'o' || c == 'd' ||
c == 'e' || c == 'r' || c == '@');
}
int main() {
ll n, m;
cin >> n >> m;
vector<vector<ll>> s;
rep(i, 0, m) {
ll k;
cin >> k;
vector<ll> tmp;
rep(j, 0, k) {
ll t;
cin >> t;
t--;
tmp.pb(t);
}
s.pb(tmp);
}
ll p[m];
rep(i, 0, m) cin >> p[i];
ll res = 0;
// cout << (1<<n)+1<<endl;
rep(i, 0, (1 << n)) {
vector<ll> v;
rep(j, 0, n) if ((i >> j) & 1) v.pb(j);
ll light[m];
rep(j, 0, m) light[j] = 0;
rep(j, 0, v.size()) {
rep(l, 0, m) { rep(k, 0, s[l].size()) if (s[l][k] == v[j]) light[l]++; }
}
// rep(j,0,m)cout<<light[j];
// cout<<endl;
bool f = true;
rep(j, 0, m) {
if (light[j] % 2 != p[j]) {
f = false;
break;
}
}
if (f)
res++;
}
cout << res << ednl;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 841,376 | 841,377 | u547754910 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int convBin(int n) {
int t = 1;
for (int i = 1; i < n; ++i) {
t *= 2;
}
return t;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> switches(n);
vector<int> lights(m);
for (int i = 0; i < m; ++i) {
int cn;
cin >> cn;
int key = 0;
for (int i = 0; i < cn; ++i) {
int t;
cin >> t;
key |= convBin(t);
}
switches[i] = key;
}
for (int i = 0; i < m; ++i) {
int t;
cin >> t;
lights[i] = t;
}
int maxN = 1;
for (int i = 0; i < n; ++i) {
maxN *= 2;
}
int ans = 0;
for (int i = 0; i <= maxN; ++i) {
bool all = true;
for (int j = 0; j < m; ++j) {
int key = switches[j];
int t = i & key;
int cnt = 0;
// cout << "i : " << i << " key: " << key << " t: " << t << endl;
for (int k = t; k > 0; k /= 2) {
if (k % 2 == 1) {
++cnt;
}
}
if (cnt % 2 != lights[j]) {
all = false;
break;
}
}
if (all) {
++ans;
}
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int convBin(int n) {
int t = 1;
for (int i = 1; i < n; ++i) {
t *= 2;
}
return t;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> switches(n);
vector<int> lights(m);
for (int i = 0; i < m; ++i) {
int cn;
cin >> cn;
int key = 0;
for (int i = 0; i < cn; ++i) {
int t;
cin >> t;
key |= convBin(t);
}
switches[i] = key;
}
for (int i = 0; i < m; ++i) {
int t;
cin >> t;
lights[i] = t;
}
int maxN = 1;
for (int i = 0; i < n; ++i) {
maxN *= 2;
}
int ans = 0;
for (int i = 0; i < maxN; ++i) {
bool all = true;
for (int j = 0; j < m; ++j) {
int key = switches[j];
int t = i & key;
int cnt = 0;
// cout << "i : " << i << " key: " << key << " t: " << t << endl;
for (int k = t; k > 0; k /= 2) {
if (k % 2 == 1) {
++cnt;
}
}
if (cnt % 2 != lights[j]) {
all = false;
break;
}
}
if (all) {
// cout << "ans : " << i << endl;
++ans;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,378 | 841,379 | u469612749 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int n, m, cnt = 0;
int k[12], p[12], s[12][12], ison[12];
void solve(int num) {
if (num <= n) {
ison[num] = 1;
solve(num + 1);
ison[num] = 0;
solve(num + 1);
} else {
for (int i = 0; i < m; ++i) {
int oncnt = 0;
for (int j = 0; j < k[i]; ++j) {
if (ison[s[i][j]])
++oncnt;
}
if (oncnt % 2 != p[i])
return;
}
}
++cnt;
}
int main(void) {
cin >> n >> m;
for (int i = 0; i < m; ++i) {
cin >> k[i];
for (int j = 0; j < k[i]; ++j) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; ++i) {
cin >> p[i];
}
for (int i = 0; i <= n; ++i)
ison[i] = 0;
solve(1);
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n, m, cnt = 0;
int k[12], p[12], s[12][12], ison[12];
void solve(int num) {
if (num <= n) {
ison[num] = 1;
solve(num + 1);
ison[num] = 0;
solve(num + 1);
} else {
for (int i = 0; i < m; ++i) {
int oncnt = 0;
for (int j = 0; j < k[i]; ++j) {
if (ison[s[i][j]])
++oncnt;
}
if ((oncnt % 2) != p[i])
return;
}
++cnt;
}
}
int main(void) {
cin >> n >> m;
for (int i = 0; i < m; ++i) {
cin >> k[i];
for (int j = 0; j < k[i]; ++j) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; ++i) {
cin >> p[i];
}
for (int i = 0; i <= n; ++i)
ison[i] = 0;
solve(1);
cout << cnt << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 841,388 | 841,389 | u314988220 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define INF_LL 1LL << 60
#define ll long long
typedef pair<int, int> P;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<vector<int>> vec(m);
vector<int> p(m);
REP(i, m) {
int k;
cin >> k;
vec[i].resize(k);
REP(j, k) {
cin >> vec[i][j];
vec[i][j]--;
}
}
REP(i, m) cin >> p[i];
REP(i, (1 << n)) {
bool isON = true;
REP(j, m) {
int cnt = 0;
REP(k, sizeof(vec[j])) if ((i >> vec[j][k]) & 1) cnt++;
if ((cnt % 2) != p[j])
isON = false;
}
if (isON)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define INF_LL 1LL << 60
#define ll long long
typedef pair<int, int> P;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<vector<int>> vec(m);
vector<int> p(m);
REP(i, m) {
int k;
cin >> k;
vec[i].resize(k);
REP(j, k) {
cin >> vec[i][j];
vec[i][j]--;
}
}
REP(i, m) cin >> p[i];
REP(i, (1 << n)) {
bool isON = true;
REP(j, m) {
int cnt = 0;
REP(k, vec[j].size()) if ((i >> vec[j][k]) & 1) cnt++;
if ((cnt % 2) != p[j])
isON = false;
}
if (isON)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"call.add"
] | 841,394 | 841,395 | u127768253 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define INF_LL 1LL << 60
#define ll long long
typedef pair<int, int> P;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<vector<int>> vec(m);
vector<int> p(m);
REP(i, m) {
int k;
cin >> k;
vec[i].resize(k);
REP(j, k) {
cin >> vec[i][j];
vec[i][j]--;
}
}
REP(i, m) cin >> p[i];
REP(i, (1 << n)) {
bool isON = true;
REP(j, m) {
int cnt = 0;
REP(k, sizeof(vec[j])) if ((i >> vec[j][k]) & 1) cnt++;
if ((cnt % 2) == p[j])
isON = false;
}
if (isON)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define INF_LL 1LL << 60
#define ll long long
typedef pair<int, int> P;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<vector<int>> vec(m);
vector<int> p(m);
REP(i, m) {
int k;
cin >> k;
vec[i].resize(k);
REP(j, k) {
cin >> vec[i][j];
vec[i][j]--;
}
}
REP(i, m) cin >> p[i];
REP(i, (1 << n)) {
bool isON = true;
REP(j, m) {
int cnt = 0;
REP(k, vec[j].size()) if ((i >> vec[j][k]) & 1) cnt++;
if ((cnt % 2) != p[j])
isON = false;
}
if (isON)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"call.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 841,397 | 841,395 | u127768253 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, s_, ans = 0;
cin >> n >> m;
int s[m] = {0}, p[m] = {0};
for (int i = 0; i < m; ++i) {
cin >> k;
for (int j = 0; j < k; ++j) {
cin >> s_;
s[i] += pow(2, s_ - 1);
}
}
for (int i = 0; i < m; ++i) {
cin >> p[i];
}
for (int j = 1; j < (1 << n); ++j) {
int cm = 0;
for (int i = 0; i < m; ++i) {
int bit = j & s[i];
int on = 0;
while (bit) {
if (bit % 2 == 1)
on++;
bit >>= 1;
}
if (p[i] == on % 2) {
cm++;
} else {
break;
}
}
if (cm == m) {
ans++;
}
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, s_, ans = 0;
cin >> n >> m;
int s[m] = {0}, p[m] = {0};
for (int i = 0; i < m; ++i) {
cin >> k;
for (int j = 0; j < k; ++j) {
cin >> s_;
s[i] += pow(2, s_ - 1);
}
}
for (int i = 0; i < m; ++i) {
cin >> p[i];
}
for (int j = 0; j < (1 << n); ++j) {
int cm = 0;
for (int i = 0; i < m; ++i) {
int bit = j & s[i];
int on = 0;
while (bit) {
if (bit % 2 == 1)
on++;
bit >>= 1;
}
if (p[i] == on % 2) {
cm++;
} else {
break;
}
}
if (cm == m) {
ans++;
}
}
cout << ans << '\n';
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,398 | 841,399 | u021083776 | cpp |
p03031 | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M;
cin >> N >> M;
long long res = 0;
int a[M + 7][N + 7];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
a[i][0] = k;
for (int j = 1; j <= k; j++) {
cin >> a[i][j];
}
}
int b[M + 1];
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int i = 0; i < pow(2, N); i++) {
int bulbs = 0;
for (int j = 0; j < M; j++) {
int t = a[j][0];
int switches = 0;
for (int p = 1; p <= t; p++) {
int o = 1 << (M - a[j][p]);
int l = o & i;
if (l > 0)
switches++;
}
if (switches % 2 == b[j])
bulbs++;
}
if (bulbs == M)
res++;
}
cout << res;
return 0;
}
| using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M;
cin >> N >> M;
long long res = 0;
int a[M + 7][N + 7];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
a[i][0] = k;
for (int j = 1; j <= k; j++) {
cin >> a[i][j];
}
}
int b[M + 1];
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int i = 0; i < pow(2, N); i++) {
int bulbs = 0;
for (int j = 0; j < M; j++) {
int t = a[j][0];
int switches = 0;
for (int p = 1; p <= t; p++) {
int o = 1 << (N - a[j][p]);
int l = o & i;
if (l > 0)
switches++;
}
if (switches % 2 == b[j])
bulbs++;
}
if (bulbs == M)
res++;
}
cout << res;
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 841,408 | 841,409 | u466568754 | cpp |
p03031 | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M;
cin >> N >> M;
int res = 0;
int a[M + 7][N + 7];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
a[i][0] = k;
for (int j = 1; j <= k; j++) {
cin >> a[i][j];
}
}
int b[M + 1];
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int i = 0; i < pow(2, N); i++) {
int bulbs = 0;
for (int j = 0; j < M; j++) {
int t = a[j][0];
int switches = 0;
for (int p = 1; p <= t; p++) {
int o = 1 << (M - a[j][p]);
int l = o & i;
if (l > 0)
switches++;
}
if (switches % 2 == b[j])
bulbs++;
}
if (bulbs == M)
res++;
}
cout << res;
return 0;
} | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M;
cin >> N >> M;
long long res = 0;
int a[M + 7][N + 7];
for (int i = 0; i < M; i++) {
int k;
cin >> k;
a[i][0] = k;
for (int j = 1; j <= k; j++) {
cin >> a[i][j];
}
}
int b[M + 1];
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int i = 0; i < pow(2, N); i++) {
int bulbs = 0;
for (int j = 0; j < M; j++) {
int t = a[j][0];
int switches = 0;
for (int p = 1; p <= t; p++) {
int o = 1 << (N - a[j][p]);
int l = o & i;
if (l > 0)
switches++;
}
if (switches % 2 == b[j])
bulbs++;
}
if (bulbs == M)
res++;
}
cout << res;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"expression.operation.binary.change"
] | 841,410 | 841,409 | u466568754 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define INF (1ll << 60)
typedef long long lint;
const lint MOD = 1000000007;
int main() {
lint N, M, ans = 0;
cin >> N >> M;
lint k[M], p[M], s[M][N];
bool x[N];
rep(i, M) {
cin >> k[i];
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) { cin >> p[i]; }
rep(i, 1 << N) {
lint count = 0;
lint count1 = 0;
rep(j, N) {
if (i & 1 << j)
x[j] = true;
else
x[j] = false;
}
rep(c, M) {
rep(l, k[c]) {
if (x[s[c][l] - 1] == true)
count++;
}
if (count % 2 == p[c])
count1++;
}
if (count1 == M)
ans++;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define INF (1ll << 60)
typedef long long lint;
const lint MOD = 1000000007;
int main() {
lint N, M, ans = 0;
cin >> N >> M;
lint k[M], p[M], s[M][N];
bool x[N];
rep(i, M) {
cin >> k[i];
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) { cin >> p[i]; }
rep(i, 1 << N) {
lint count = 0;
lint count1 = 0;
rep(j, N) {
if (i & 1 << j)
x[j] = true;
else
x[j] = false;
}
rep(c, M) {
rep(l, k[c]) {
if (x[s[c][l] - 1] == true)
count++;
}
if (count % 2 == p[c])
count1++;
count = 0;
}
if (count1 == M)
ans++;
}
cout << ans;
} | [
"assignment.add"
] | 841,411 | 841,412 | u768204022 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<ll> switches(M);
rep(i, M) {
int L;
cin >> L;
ll b = 0;
rep(j, L) {
int s;
cin >> s;
b |= 1ll << (s - 1);
}
switches[i] = b;
}
vector<int> p(M);
rep(i, M) { cin >> p[i]; }
ll ans = 0;
for (ll i = 1; i < (1ll << N); i++) {
int on_count = 0;
rep(j, M) {
ll bi = switches[j] & i;
int count = 0;
while (bi > 0) {
if (bi & 1) {
count++;
}
bi >>= 1;
}
if (count % 2 == p[j]) {
on_count++;
}
}
if (on_count == M) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<ll> switches(M);
rep(i, M) {
int L;
cin >> L;
ll b = 0;
rep(j, L) {
int s;
cin >> s;
b |= 1ll << (s - 1);
}
switches[i] = b;
}
vector<int> p(M);
rep(i, M) { cin >> p[i]; }
ll ans = 0;
for (ll i = 0; i < (1ll << N); i++) {
int on_count = 0;
rep(j, M) {
ll bi = switches[j] & i;
int count = 0;
while (bi > 0) {
if (bi & 1) {
count++;
}
bi >>= 1;
}
if (count % 2 == p[j]) {
on_count++;
}
}
if (on_count == M) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,427 | 841,428 | u979920726 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 99999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(20) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, R) vector<vector<L>> K(N, vector<L>(M, R))
#define pint pair<lli, lli>
#define Lower(v, X) lower_bound(v.begin(), v.end(), X) - v.begin();
#define mod 1000000007
#define MAX 5100000
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
lli A, B, C, D, E, L, R, X, Y, W, H, N, M, K, sum = 0, num = 0, flag = 0;
string S, T;
cin >> N >> M;
DV(P, int, M, 0, 0);
Vec(Q, int, M, 0);
rep(i, 0, M) {
cin >> A;
rep(j, 0, A) {
cin >> B;
P[i].pb(B);
}
}
rep(i, 0, M) cin >> Q[i];
for (int bit = 0; bit < (1 << N); bit++) {
flag = true;
rep(i, 0, M) {
for (int q : P[i])
if (bit & (1 << q))
num++;
if (num % 2 != Q[i])
flag = false;
num = 0;
}
if (flag)
sum++;
}
Out(sum);
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 99999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(20) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, R) vector<vector<L>> K(N, vector<L>(M, R))
#define pint pair<lli, lli>
#define Lower(v, X) lower_bound(v.begin(), v.end(), X) - v.begin();
#define mod 1000000007
#define MAX 5100000
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
lli A, B, C, D, E, L, R, X, Y, W, H, N, M, K, sum = 0, num = 0, flag = 0;
string S, T;
cin >> N >> M;
DV(P, int, M, 0, 0);
Vec(Q, int, M, 0);
rep(i, 0, M) {
cin >> A;
rep(j, 0, A) {
cin >> B;
P[i].pb(B - 1);
}
}
rep(i, 0, M) cin >> Q[i];
for (int bit = 0; bit < (1 << N); bit++) {
flag = true;
rep(i, 0, M) {
for (int q : P[i])
if (bit & (1 << q))
num++;
if (num % 2 != Q[i])
flag = false;
num = 0;
}
if (flag)
sum++;
}
Out(sum);
}
| [] | 841,431 | 841,432 | u618604643 | cpp |
p03031 | #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| ||||||||||
AHMED;HASSAN;SAEED;
*/
using namespace std;
int n, m;
vector<vector<int>> schs(11);
vector<int> sns;
int ans = 0;
void sch(vector<int> v, int k, int c = 0, int ls = 0) {
if (c == k) {
int cnt2 = 0;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < schs[i].size(); j++) {
if (find(v.begin(), v.end(), schs[i][j]) != v.end()) {
cnt++;
}
}
if (cnt % 2 == sns[i]) {
cnt2++;
}
}
if (cnt2 == m) {
ans++;
}
return;
}
for (int i = ls + 1; i <= n; i++) {
v.push_back(i);
sch(v, k, c + 1, i);
v.pop_back();
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int t;
cin >> t;
schs[i].push_back(t);
}
}
for (int i = 0; i < m; i++) {
int sn;
cin >> sn;
sns.push_back(sn);
}
vector<int> v;
for (int i = 1; i <= n; i++)
sch(v, i);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| ||||||||||
AHMED;HASSAN;SAEED;
*/
using namespace std;
int n, m;
vector<vector<int>> schs(11);
vector<int> sns;
int ans = 0;
void sch(vector<int> v, int k, int c = 0, int ls = 0) {
if (c == k) {
int cnt2 = 0;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < schs[i].size(); j++) {
if (find(v.begin(), v.end(), schs[i][j]) != v.end()) {
cnt++;
}
}
if (cnt % 2 == sns[i]) {
cnt2++;
}
}
if (cnt2 == m) {
ans++;
}
return;
}
for (int i = ls + 1; i <= n; i++) {
v.push_back(i);
sch(v, k, c + 1, i);
v.pop_back();
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int t;
cin >> t;
schs[i].push_back(t);
}
}
for (int i = 0; i < m; i++) {
int sn;
cin >> sn;
sns.push_back(sn);
}
vector<int> v;
for (int i = 0; i <= n; i++)
sch(v, i);
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,437 | 841,438 | u129611452 | cpp |
p03031 | #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| ||||||||||
AHMED;HASSAN;SAEED;
*/
using namespace std;
int n, m;
vector<vector<int>> schs(11);
vector<int> sns;
int ans = 0;
void sch(vector<int> v, int k, int c = 0, int ls = 0) {
if (c == k) {
int cnt2 = 0;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < schs[i].size(); j++) {
if (find(v.begin(), v.end(), schs[i][j]) != v.end()) {
cnt++;
}
}
if (cnt % 2 == sns[i]) {
cnt2++;
}
}
if (cnt2 == m) {
ans++;
}
}
for (int i = ls + 1; i <= n; i++) {
v.push_back(i);
sch(v, k, c + 1, i);
v.pop_back();
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int t;
cin >> t;
schs[i].push_back(t);
}
}
for (int i = 0; i < m; i++) {
int sn;
cin >> sn;
sns.push_back(sn);
}
vector<int> v;
for (int i = 1; i <= n; i++)
sch(v, i);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| ||||||||||
AHMED;HASSAN;SAEED;
*/
using namespace std;
int n, m;
vector<vector<int>> schs(11);
vector<int> sns;
int ans = 0;
void sch(vector<int> v, int k, int c = 0, int ls = 0) {
if (c == k) {
int cnt2 = 0;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < schs[i].size(); j++) {
if (find(v.begin(), v.end(), schs[i][j]) != v.end()) {
cnt++;
}
}
if (cnt % 2 == sns[i]) {
cnt2++;
}
}
if (cnt2 == m) {
ans++;
}
return;
}
for (int i = ls + 1; i <= n; i++) {
v.push_back(i);
sch(v, k, c + 1, i);
v.pop_back();
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int t;
cin >> t;
schs[i].push_back(t);
}
}
for (int i = 0; i < m; i++) {
int sn;
cin >> sn;
sns.push_back(sn);
}
vector<int> v;
for (int i = 0; i <= n; i++)
sch(v, i);
cout << ans << endl;
return 0;
}
| [
"control_flow.return.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,439 | 841,438 | u129611452 | cpp |
p03031 | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), rend()
#define PB pushback
#define SORT(c) sort((c).begin(), (c).end())
const LL INF = 1LL << 60;
// priority_queue<int> p;
int i, j, k, l, tmp, cnt, N, M, cnt2;
LL ans;
// scanf("%d",&N);
// printf("%d", ans);
// cout << << endl;
int main(void) {
vector<vector<int>> s;
vector<int> p;
scanf("%d %d", &N, &M);
REP(i, M) {
scanf("%d", &k);
vector<int> t;
REP(j, k) {
scanf("%d", &tmp);
t.push_back(tmp - 1);
}
s.push_back(t);
}
REP(i, M) {
scanf("%d", &tmp);
p.push_back(tmp);
}
int bit;
FOR(bit, 1, (1 << N)) {
cnt2 = 0;
REP(k, M) { //縦方向
cnt = 0;
REP(l, s.at(k).size()) { //横方向
if (((1 << s.at(k).at(l)) & bit) > 0) {
cnt++;
}
}
if ((cnt % 2) == p.at(k)) {
cnt2++;
}
}
if (cnt2 == M) {
ans++;
}
}
printf("%lld", ans);
return 0;
} | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), rend()
#define PB pushback
#define SORT(c) sort((c).begin(), (c).end())
const LL INF = 1LL << 60;
// priority_queue<int> p;
int i, j, k, l, tmp, cnt, N, M, cnt2;
LL ans;
// scanf("%d",&N);
// printf("%d", ans);
// cout << << endl;
int main(void) {
vector<vector<int>> s;
vector<int> p;
scanf("%d %d", &N, &M);
REP(i, M) {
scanf("%d", &k);
vector<int> t;
REP(j, k) {
scanf("%d", &tmp);
t.push_back(tmp - 1);
}
s.push_back(t);
}
REP(i, M) {
scanf("%d", &tmp);
p.push_back(tmp);
}
int bit;
FOR(bit, 0, (1 << N)) {
cnt2 = 0;
REP(k, M) { //縦方向
cnt = 0;
REP(l, s.at(k).size()) { //横方向
if (((1 << s.at(k).at(l)) & bit) > 0) {
cnt++;
}
}
if ((cnt % 2) == p.at(k)) {
cnt2++;
}
}
if (cnt2 == M) {
ans++;
}
}
printf("%lld", ans);
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 841,449 | 841,450 | u475546258 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
vector<int> binaryConvert(int x, int digit) {
vector<int> binary(1);
while (x > 0) {
binary.insert(binary.begin(), x % 2);
x = x / 2;
}
binary.pop_back();
while (binary.size() < digit) {
binary.insert(binary.begin(), 0);
}
return binary;
}
int main() {
int n, m;
cin >> n >> m;
int *k = new int[m];
int s[10][10] = {-1};
int *p = new int[m];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
// printf("--------\n");
// for (int i = 0; i < m; i++){
// printf("%d ", k[i]);
// for (int j = 0; j < k[i]; j++){
// printf("%d ", s[i][j]);
// }
// printf("\n");
// }
int ans = 0;
bool flag = true;
int swichOnSum = 0;
for (int i = 1; i < 1 << n; i++) {
flag = true;
vector<int> swichStatus = binaryConvert(i, n);
for (int j = 0; j < m; j++) {
for (int h = 0; h < k[j]; h++) {
swichOnSum += swichStatus[s[j][h] - 1];
}
if (swichOnSum % 2 != p[j]) {
flag = false;
// break;
}
swichOnSum = 0;
}
if (flag) {
ans += 1;
}
// for(int g=0;g<n;g++){
// printf("%d",swichStatus[g]);
// }
// printf(":%d\n", flag);
}
cout << ans << endl;
// vector<int> bina = binaryConvert(3, 5);
// for(int i=0;i<bina.size();i++){
// printf("%d",bina[i]);
// }
} | #include <iostream>
#include <vector>
using namespace std;
vector<int> binaryConvert(int x, int digit) {
vector<int> binary(1);
while (x > 0) {
binary.insert(binary.begin(), x % 2);
x = x / 2;
}
binary.pop_back();
while (binary.size() < digit) {
binary.insert(binary.begin(), 0);
}
return binary;
}
int main() {
int n, m;
cin >> n >> m;
int *k = new int[m];
int s[10][10] = {-1};
int *p = new int[m];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
// printf("--------\n");
// for (int i = 0; i < m; i++){
// printf("%d ", k[i]);
// for (int j = 0; j < k[i]; j++){
// printf("%d ", s[i][j]);
// }
// printf("\n");
// }
int ans = 0;
int count = 0;
bool flag = true;
int swichOnSum = 0;
for (int i = 0; i < 1 << n; i++) {
flag = true;
vector<int> swichStatus = binaryConvert(i, n);
for (int j = 0; j < m; j++) {
for (int h = 0; h < k[j]; h++) {
swichOnSum += swichStatus[s[j][h] - 1];
}
if (swichOnSum % 2 != p[j]) {
flag = false;
}
swichOnSum = 0;
}
if (flag) {
ans += 1;
}
}
cout << ans << endl;
// vector<int> bina = binaryConvert(3, 5);
// for(int i=0;i<bina.size();i++){
// printf("%d",bina[i]);
// }
} | [
"variable_declaration.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,458 | 841,459 | u580631296 | cpp |
p03031 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define INF 1e9
#define MOD 1000000007
#define All(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
REP(i, M) {
int k;
cin >> k;
REP(j, k) {
int a;
cin >> a;
a--;
s[i].push_back(a);
}
}
vector<int> p(M);
REP(i, M) cin >> p[i];
ll res = 0;
for (int bit = 0; bit < (1 << N); bit++) {
bool ok = true;
for (int i = 0; i < M; i++) {
int con = 0;
for (auto v : s[i]) {
if (bit & (1 << v))
con++;
}
if (con % 2 != p[i])
ok = false;
}
if (ok)
res++;
cout << res << endl;
}
} | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define INF 1e9
#define MOD 1000000007
#define All(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
REP(i, M) {
int k;
cin >> k;
REP(j, k) {
int a;
cin >> a;
a--;
s[i].push_back(a);
}
}
vector<int> p(M);
REP(i, M) cin >> p[i];
ll res = 0;
for (int bit = 0; bit < (1 << N); bit++) {
bool ok = true;
for (int i = 0; i < M; i++) {
int con = 0;
for (auto v : s[i]) {
if (bit & (1 << v))
con++;
}
if (con % 2 != p[i])
ok = false;
}
if (ok)
res++;
}
cout << res << endl;
} | [] | 841,471 | 841,472 | u144980750 | cpp |
p03031 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cerr << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl
/*----------------------------------------------------------------*/
// int MOD = 998244353;
int MOD = 1000000007;
vector<pair<int, int>> p;
set<pair<int, int>> q;
/*----------------------------------------------------------------*/
signed main() {
int n, m;
cin >> n >> m;
int k[11];
int s[11][11];
int p[11];
rep(i, m) {
cin >> k[i];
rep(j, k[i]) cin >> s[i][j];
}
rep(i, m) cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1LL << n); bit++) {
int f = 1;
rep(i, m) {
int cnt = 0;
rep(j, k[i]) {
if (bit & (1LL << s[i][j]))
cnt++;
}
if (cnt % 2 != p[i]) {
f = 0;
break;
}
}
if (f)
ans++;
}
cout << ans << endl;
return 0;
}
/*----------------------------------------------------------------*/
// g++ -std=c++14 code1.cpp
// sudo pip3 install --upgrade online-judge-tools
// rm -r -f test;oj dl
// https://code-festival-2018-quala.contest.atcoder.jp/tasks/code_festival_2018_quala_c
// rm -r -f test;oj dl
// https://pakencamp-2019-day3.contest.atcoder.jp/tasks/pakencamp_2019_day3_c rm
// -r -f test;oj dl https://sumitrust2019.contest.atcoder.jp/tasks/sumitb2019_d | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cerr << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl
/*----------------------------------------------------------------*/
// int MOD = 998244353;
int MOD = 1000000007;
vector<pair<int, int>> p;
set<pair<int, int>> q;
/*----------------------------------------------------------------*/
signed main() {
int n, m;
cin >> n >> m;
int k[11];
int s[11][11];
int p[11];
rep(i, m) {
cin >> k[i];
rep(j, k[i]) cin >> s[i][j];
}
rep(i, m) cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1LL << n); bit++) {
int f = 1;
rep(i, m) {
int cnt = 0;
rep(j, k[i]) {
if (bit & (1LL << (s[i][j] - 1)))
cnt++;
}
if (cnt % 2 != p[i]) {
f = 0;
break;
}
}
if (f)
ans++;
}
cout << ans << endl;
return 0;
}
/*----------------------------------------------------------------*/
// g++ -std=c++14 code1.cpp
// sudo pip3 install --upgrade online-judge-tools
// rm -r -f test;oj dl
// https://code-festival-2018-quala.contest.atcoder.jp/tasks/code_festival_2018_quala_c
// rm -r -f test;oj dl
// https://pakencamp-2019-day3.contest.atcoder.jp/tasks/pakencamp_2019_day3_c rm
// -r -f test;oj dl https://sumitrust2019.contest.atcoder.jp/tasks/sumitb2019_d | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 841,484 | 841,485 | u548768105 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, m, s = 0;
cin >> n >> m;
vector<vector<int>> v(m);
vector<int> p(m);
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int r;
cin >> r;
v[i].push_back(r);
}
}
rep(i, m) cin >> p[i];
rep(i, 1 << n) {
bool b = 1;
rep(j, m) {
int a = 0;
rep(l, v[j].size()) if (i & 1 << v[j][l])++ a;
if (a % 2 != p[j])
b = 0;
}
if (b)
++s;
}
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, m, s = 0;
cin >> n >> m;
vector<vector<int>> v(m);
vector<int> p(m);
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int r;
cin >> r;
v[i].push_back(r - 1);
}
}
rep(i, m) cin >> p[i];
rep(i, 1 << n) {
bool b = 1;
rep(j, m) {
int a = 0;
rep(l, v[j].size()) if (i & 1 << v[j][l])++ a;
if (a % 2 != p[j])
b = 0;
}
if (b)
++s;
}
cout << s << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 841,488 | 841,489 | u757584836 | cpp |
p03031 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
#define P pair<int, int>
#define ll long long
#define cat(p) cout << p << endl
#define catA(p, n) \
for (int i = 0; i < n; i++) \
cout << p[i] << ((i == n - 1) ? "\n" : " ")
int n, m;
vector<int> s[100];
int k[100];
int p[100];
int main() {
cin >> n >> m;
rep(i, m) {
cin >> k[i];
rep(j, k[i]) {
int tmp;
cin >> tmp;
s[i].pb(tmp);
}
}
rep(i, m) cin >> p[i];
int ans = 0;
rep(i, 1 << n) {
bool on[1111];
int cnt = 0;
rep(j, n) on[j] = 0;
rep(j, n) if (i & (1 << j)) on[j] = 1;
// rep(j,n)cout<<on[j]<<" ";
// cout<<endl;
rep(j, m) {
int hoge = 0;
rep(k, s[j].size()) {
if (on[s[j][k]])
hoge++;
}
if (hoge % 2 == p[j])
cnt++;
}
if (cnt == m)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
#define P pair<int, int>
#define ll long long
#define cat(p) cout << p << endl
#define catA(p, n) \
for (int i = 0; i < n; i++) \
cout << p[i] << ((i == n - 1) ? "\n" : " ")
int n, m;
vector<int> s[100];
int k[100];
int p[100];
int main() {
cin >> n >> m;
rep(i, m) {
cin >> k[i];
rep(j, k[i]) {
int tmp;
cin >> tmp;
s[i].pb(tmp);
}
}
rep(i, m) cin >> p[i];
int ans = 0;
rep(i, 1 << n) {
bool on[1111];
int cnt = 0;
rep(j, n) on[j] = 0;
rep(j, n) if (i & (1 << j)) on[j] = 1;
// rep(j,n)cout<<on[j]<<" ";
// cout<<endl;
rep(j, m) {
int hoge = 0;
rep(k, s[j].size()) {
if (on[s[j][k] - 1])
hoge++;
}
if (hoge % 2 == p[j])
cnt++;
}
if (cnt == m)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 841,490 | 841,491 | u341406884 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <typename T> void view(T cont) { std::cout << cont << std::endl; }
template <typename T> void view(T *cont, ll sz) {
rep(i, sz) std::cout << cont[i] << " ";
std::cout << std::endl;
}
template <typename T> void view(const std::vector<T> &v) {
for (const auto &f : v)
std::cout << f << " ";
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N, M;
cin >> N >> M;
int k[10];
vector<vector<int>> s;
rep(i, M) {
cin >> k[i];
s.push_back(vector<int>{});
rep(j, k[i]) {
int temp;
cin >> temp;
s[i].push_back(temp);
}
}
vector<int> p;
rep(i, M) {
int temp;
cin >> temp;
p.push_back(temp);
}
// view(s);
// view(p);
bool switch_on;
int count = 0;
for (int bit = 0; bit < (1 << N); ++bit) {
// cout << bitset<10>(bit) << endl;
switch_on = true;
for (int i = 0; i < M; i++) {
// cout << bitset<10>(bit) << endl;
// cout << bitset<10>(accumulate(s[i].begin(), s[i].end(), 0)) << endl;
// cout << bitset<10>(bit & accumulate(s[i].begin(), s[i].end(), 0)) <<
// endl; int on_num = __builtin_popcount(bit & accumulate(s[i].begin(),
// s[i].end(), 0));
int bit_num = 0;
for (int j : s[i]) {
if (bit & (1 << j)) {
// if ((i >> j) & 1) {
bit_num++;
}
}
if (bit_num % 2 != p[i]) {
switch_on = false;
// break;
}
}
if (switch_on)
count++;
// switch_on = true;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <typename T> void view(T cont) { std::cout << cont << std::endl; }
template <typename T> void view(T *cont, ll sz) {
rep(i, sz) std::cout << cont[i] << " ";
std::cout << std::endl;
}
template <typename T> void view(const std::vector<T> &v) {
for (const auto &f : v)
std::cout << f << " ";
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N, M;
cin >> N >> M;
int k[10];
vector<vector<int>> s;
rep(i, M) {
cin >> k[i];
s.push_back(vector<int>{});
rep(j, k[i]) {
int temp;
cin >> temp;
s[i].push_back(temp);
}
}
vector<int> p;
rep(i, M) {
int temp;
cin >> temp;
p.push_back(temp);
}
// view(s);
// view(p);
bool switch_on;
int count = 0;
for (int bit = 0; bit < (1 << N); ++bit) {
// cout << bitset<10>(bit) << endl;
switch_on = true;
for (int i = 0; i < M; i++) {
// cout << bitset<10>(bit) << endl;
// cout << bitset<10>(accumulate(s[i].begin(), s[i].end(), 0)) << endl;
// cout << bitset<10>(bit & accumulate(s[i].begin(), s[i].end(), 0)) <<
// endl; int on_num = __builtin_popcount(bit & accumulate(s[i].begin(),
// s[i].end(), 0));
int bit_num = 0;
for (int j : s[i]) {
if (bit & (1 << (j - 1))) {
// if ((i >> j) & 1) {
bit_num++;
}
}
if (bit_num % 2 != p[i]) {
switch_on = false;
// break;
}
}
if (switch_on)
count++;
// switch_on = true;
}
cout << count << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 841,496 | 841,497 | u998880072 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9 + 7;
static const ll INF = 1LL << 50;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>(10));
vector<int> p(m), k(m);
for (int i = 0; i < m; ++i) {
cin >> k[i];
for (int j = 0; j < k[i]; ++j) {
cin >> s[i][j];
}
}
int ans2 = 0;
for (int i = 0; i < m; ++i)
cin >> p[i];
for (int bit = 0; bit < (1 << n); ++bit) {
int ans = 0;
for (int j = 0; j < m; ++j) {
int count = 0;
for (int i = 0; i < k[j]; ++i) {
if (bit & (1 << s[j][i] + 1)) {
++count;
}
}
if (count % 2 == p[j])
++ans;
}
if (ans == m)
++ans2;
}
cout << ans2 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9 + 7;
static const ll INF = 1LL << 50;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>(10));
vector<int> p(m), k(m);
for (int i = 0; i < m; ++i) {
cin >> k[i];
for (int j = 0; j < k[i]; ++j) {
cin >> s[i][j];
}
}
int ans2 = 0;
for (int i = 0; i < m; ++i)
cin >> p[i];
for (int bit = 0; bit < (1 << n); ++bit) {
int ans = 0;
for (int j = 0; j < m; ++j) {
int count = 0;
for (int i = 0; i < k[j]; ++i) {
if (bit & (1 << s[j][i] - 1)) {
++count;
}
}
if (count % 2 == p[j])
++ans;
}
if (ans == m)
++ans2;
}
cout << ans2 << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 841,500 | 841,501 | u698883164 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9 + 7;
static const ll INF = 1LL << 50;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>(10));
vector<int> p(m), k(m);
for (int i = 0; i < m; ++i) {
cin >> k[i];
for (int j = 0; j < k[i]; ++j) {
cin >> s[i][j];
}
}
int ans2 = 0;
for (int i = 0; i < m; ++i)
cin >> p[i];
for (int bit = 0; bit < (1 << n); ++bit) {
int ans = 0;
for (int j = 0; j < m; ++j) {
int count = 0;
for (int i = 0; i < k[j]; ++i) {
if (bit & (1 << s[j][i])) {
++count;
}
}
if (count % 2 == p[j])
++ans;
}
if (ans == m)
++ans2;
}
cout << ans2 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9 + 7;
static const ll INF = 1LL << 50;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>(10));
vector<int> p(m), k(m);
for (int i = 0; i < m; ++i) {
cin >> k[i];
for (int j = 0; j < k[i]; ++j) {
cin >> s[i][j];
}
}
int ans2 = 0;
for (int i = 0; i < m; ++i)
cin >> p[i];
for (int bit = 0; bit < (1 << n); ++bit) {
int ans = 0;
for (int j = 0; j < m; ++j) {
int count = 0;
for (int i = 0; i < k[j]; ++i) {
if (bit & (1 << s[j][i] - 1)) {
++count;
}
}
if (count % 2 == p[j])
++ans;
}
if (ans == m)
++ans2;
}
cout << ans2 << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 841,502 | 841,501 | u698883164 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m, k;
cin >> n >> m;
vector<bitset<10>> a(m);
vector<int> c(m);
rep(i, m) {
cin >> k;
int b;
bitset<10> bs;
rep(j, k) {
cin >> b;
bs.set(b);
}
a[i] = bs;
}
rep(i, m) { cin >> c[i]; }
int sum = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
rep(i, m) {
if (c[i] != (int)(a[i] & (bitset<10>)bit).count() % 2) {
sum--;
break;
}
}
sum++;
}
cout << sum;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m, k;
cin >> n >> m;
vector<bitset<10>> a(m);
vector<int> c(m);
rep(i, m) {
cin >> k;
int b;
bitset<10> bs;
rep(j, k) {
cin >> b;
bs.set(b - 1);
}
a[i] = bs;
}
rep(i, m) { cin >> c[i]; }
int sum = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
rep(i, m) {
if (c[i] != (int)(a[i] & (bitset<10>)bit).count() % 2) {
sum--;
break;
}
}
sum++;
}
cout << sum;
} | [
"expression.operation.binary.add"
] | 841,505 | 841,506 | u983711104 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int const INF = 1001001001;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
// 電球iにつながれているスイッチの番号を１次元配列S[i]に入れる
vvi S(M);
rep(i, M) {
int k;
cin >> k;
rep(i, k) {
int s;
cin >> s;
// 0-index化忘れんなし！
--s;
S[i].push_back(s);
}
}
//電球iのp値を１次元配列Pに入れる
vi P(M);
rep(i, M) cin >> P[i];
//答え
int ans = 0;
// bit全探索する
//「j番目のフラグが1⇔スイッチjがon」という対応を考えている
for (int bit = 0; bit << (1 << N); ++bit) {
// okは点灯しない電球があればfalseにする
bool ok = true;
//各電球が点灯するか見ていく
rep(i, M) {
// onになっているスイッチの個数を数える
int cnt = 0;
//各電球につながれているスイッチがonかどうか見ていく
for (auto s : S[i]) {
if (bit & (1 << s))
cnt++;
}
if (cnt % 2 != P[i])
ok = false;
}
if (ok)
++ans;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int const INF = 1001001001;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
// 電球iにつながれているスイッチの番号を１次元配列S[i]に入れる
vvi S(M);
rep(i, M) {
int k;
cin >> k;
rep(j, k) {
int s;
cin >> s;
// 0-index化忘れんなし！
--s;
S[i].push_back(s);
}
}
//電球iのp値を１次元配列Pに入れる
vi P(M);
rep(i, M) cin >> P[i];
//答え
ll ans = 0;
// bit全探索する
//「j番目のフラグが1⇔スイッチjがon」という対応を考えている
for (int bit = 0; bit < (1 << N); ++bit) {
// okは点灯しない電球があればfalseにする
bool ok = true;
//各電球が点灯するか見ていく
rep(i, M) {
// onになっているスイッチの個数を数える
int cnt = 0;
//各電球につながれているスイッチがonかどうか見ていく
for (auto v : S[i]) {
if (bit & (1 << v))
cnt++;
}
if (cnt % 2 != P[i])
ok = false;
}
if (ok)
++ans;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change",
"misc.typo",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 841,511 | 841,512 | u115838990 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(M);
vector<int> P(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
S[i].push_back(s);
}
}
for (int i = 0; i < M; i++) {
cin >> P[i];
}
// 組み合わせが何通りあるか
int ans = 0;
for (int i = 1; i < (1 << N); i++) {
// bit(i)の時いくつの電球が点灯しているか
int cnt = 0;
bitset<10> bit(i);
for (int j = 0; j < M; j++) {
// 繋がっているスイッチのうちonになっているものの個数
int tmp = 0;
for (int x : S[j]) {
if (bit.test(--x)) {
tmp++;
}
}
// onになっているスイッチの個数を2で割ったあまりがpjに等しいときj番目の電球を点灯しているとしてカウント
if (tmp % 2 == P[j]) {
cnt++;
}
}
// 全ての電球が点灯している時カウント
if (cnt == M) {
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S(M);
vector<int> P(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
S[i].push_back(s);
}
}
for (int i = 0; i < M; i++) {
cin >> P[i];
}
// 組み合わせが何通りあるか
int ans = 0;
for (int i = 0; i < (1 << N); i++) {
// bit(i)の時いくつの電球が点灯しているか
int cnt = 0;
bitset<10> bit(i);
for (int j = 0; j < M; j++) {
// 繋がっているスイッチのうちonになっているものの個数
int tmp = 0;
for (int x : S[j]) {
if (bit.test(--x)) {
tmp++;
}
}
// onになっているスイッチの個数を2で割ったあまりがpjに等しいときj番目の電球を点灯しているとしてカウント
if (tmp % 2 == P[j]) {
cnt++;
}
}
// 全ての電球が点灯している時カウント
if (cnt == M) {
ans++;
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,517 | 841,518 | u278057806 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
a--;
s[i].emplace_back(a);
}
}
vector<int> p(m);
for (int i = 0; i < m; ++i) {
cin >> p[i];
}
auto ans = 0L;
for (unsigned int bit = 0; bit < (1U << n); ++bit) {
bool isOK = true;
//電球iがついているかどうか
for (int i = 0; i < n; ++i) {
int cnt = 0;
for (unsigned int v : s[i]) {
if (bit & (1U << v))
++cnt;
}
if (cnt % 2 != p[i])
isOK = false;
}
if (isOK)
++ans;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
a--;
s[i].emplace_back(a);
}
}
vector<int> p(m);
for (int i = 0; i < m; ++i) {
cin >> p[i];
}
auto ans = 0L;
for (unsigned int bit = 0; bit < (1U << n); ++bit) {
bool isOK = true;
//電球iがついているかどうか
for (int i = 0; i < m; ++i) {
int cnt = 0;
for (unsigned int v : s[i]) {
if (bit & (1U << v))
++cnt;
}
if (cnt % 2 != p[i])
isOK = false;
}
if (isOK)
++ans;
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,523 | 841,524 | u519194615 | cpp |
p03031 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
vector<int> p(M);
vector<int> k(M);
rep(i, M) {
cin >> k[i];
s[i].resize(k[i]);
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) cin >> p[i];
ll pattern = pow(2, N);
vector<int> tmp_s(N, 0);
int ans = 0;
rep(i, pattern + 1) {
bool ok = true;
rep(j, N) {
if (i & 1 << (j + 1)) {
tmp_s[j] = 1;
} else {
tmp_s[j] = 0;
}
}
rep(j, M) {
int cnt = 0;
rep(l, k[j]) {
if (tmp_s[s[j][l] - 1]) {
cnt++;
}
}
if (cnt % 2 != p[j]) {
ok = false;
break;
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
// system("pause");
return 0;
} | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
vector<int> p(M);
vector<int> k(M);
rep(i, M) {
cin >> k[i];
s[i].resize(k[i]);
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) cin >> p[i];
ll pattern = pow(2, N);
vector<int> tmp_s(N, 0);
int ans = 0;
rep(i, pattern) {
bool ok = true;
rep(j, N) {
if (i & 1 << j) {
tmp_s[j] = 1;
} else {
tmp_s[j] = 0;
}
}
rep(j, M) {
int cnt = 0;
rep(l, k[j]) {
if (tmp_s[s[j][l] - 1]) {
cnt++;
}
}
if (cnt % 2 != p[j]) {
ok = false;
break;
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
// system("pause");
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 841,529 | 841,530 | u438265890 | cpp |
p03031 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
vector<int> p(M);
vector<int> k(M);
rep(i, M) {
cin >> k[i];
s[i].resize(k[i]);
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) cin >> p[i];
ll pattern = pow(2, N);
vector<int> tmp_s(N, 0);
int ans = 0;
rep(i, pattern + 1) {
bool ok = true;
rep(j, N + 1) {
if (i & 1 << j) {
tmp_s[j] = 1;
} else {
tmp_s[j] = 0;
}
}
rep(j, M) {
int cnt = 0;
rep(l, k[j]) {
if (tmp_s[s[j][l] - 1]) {
cnt++;
}
}
if (cnt % 2 != p[j]) {
ok = false;
break;
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
// system("pause");
return 0;
} | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
vector<int> p(M);
vector<int> k(M);
rep(i, M) {
cin >> k[i];
s[i].resize(k[i]);
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) cin >> p[i];
ll pattern = pow(2, N);
vector<int> tmp_s(N, 0);
int ans = 0;
rep(i, pattern) {
bool ok = true;
rep(j, N) {
if (i & 1 << j) {
tmp_s[j] = 1;
} else {
tmp_s[j] = 0;
}
}
rep(j, M) {
int cnt = 0;
rep(l, k[j]) {
if (tmp_s[s[j][l] - 1]) {
cnt++;
}
}
if (cnt % 2 != p[j]) {
ok = false;
break;
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
// system("pause");
return 0;
} | [
"expression.operation.binary.remove"
] | 841,531 | 841,530 | u438265890 | cpp |
p03031 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
vector<int> p(M);
vector<int> k(M);
rep(i, M) {
cin >> k[i];
s[i].resize(k[i]);
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) cin >> p[i];
ll pattern = pow(2, N);
vector<int> tmp_s(N, 0);
int ans = 0;
rep(i, pattern + 1) {
bool ok = true;
rep(j, N) {
if (i & 1 << j) {
tmp_s[j] = 1;
} else {
tmp_s[j] = 0;
}
}
rep(j, M) {
int cnt = 0;
rep(l, k[j]) {
if (tmp_s[s[j][l] - 1]) {
cnt++;
}
}
if (cnt % 2 != p[j]) {
ok = false;
break;
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
// system("pause");
return 0;
} | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
vector<int> p(M);
vector<int> k(M);
rep(i, M) {
cin >> k[i];
s[i].resize(k[i]);
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) cin >> p[i];
ll pattern = pow(2, N);
vector<int> tmp_s(N, 0);
int ans = 0;
rep(i, pattern) {
bool ok = true;
rep(j, N) {
if (i & 1 << j) {
tmp_s[j] = 1;
} else {
tmp_s[j] = 0;
}
}
rep(j, M) {
int cnt = 0;
rep(l, k[j]) {
if (tmp_s[s[j][l] - 1]) {
cnt++;
}
}
if (cnt % 2 != p[j]) {
ok = false;
break;
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
// system("pause");
return 0;
} | [
"expression.operation.binary.remove"
] | 841,532 | 841,530 | u438265890 | cpp |
p03031 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> s(N);
vector<int> p(M);
vector<int> k(M);
rep(i, M) {
cin >> k[i];
s[i].resize(k[i]);
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) cin >> p[i];
ll pattern = pow(2, N);
vector<int> tmp_s(N, 0);
int ans = 0;
rep(i, pattern + 1) {
bool ok = true;
rep(j, N) {
if (i & 1 << j) {
tmp_s[j] = 1;
} else {
tmp_s[j] = 0;
}
}
rep(j, M) {
int cnt = 0;
rep(l, k[j]) {
if (tmp_s[s[j][l] - 1]) {
cnt++;
}
}
if (cnt % 2 != p[j]) {
ok = false;
break;
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
// system("pause");
return 0;
} | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
vector<int> p(M);
vector<int> k(M);
rep(i, M) {
cin >> k[i];
s[i].resize(k[i]);
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) cin >> p[i];
ll pattern = pow(2, N);
vector<int> tmp_s(N, 0);
int ans = 0;
rep(i, pattern) {
bool ok = true;
rep(j, N) {
if (i & 1 << j) {
tmp_s[j] = 1;
} else {
tmp_s[j] = 0;
}
}
rep(j, M) {
int cnt = 0;
rep(l, k[j]) {
if (tmp_s[s[j][l] - 1]) {
cnt++;
}
}
if (cnt % 2 != p[j]) {
ok = false;
break;
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
// system("pause");
return 0;
} | [
"expression.operation.binary.remove"
] | 841,533 | 841,530 | u438265890 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> sw(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
vector<int> s(k);
for (int j = 0; j < k; j++)
cin >> s[j];
sw[i] = s;
}
vector<int> p(m);
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int i = 0; i <= pow(2, n); i++) {
bool flag = true;
for (int j = 0; j < m; j++) {
int count = 0;
for (int k = 0; k < sw.size(); k++) {
count += bitset<10>(i)[sw[j][k] - 1];
}
if (count % 2 != p[j]) {
flag = false;
break;
}
}
if (flag)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> sw(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
vector<int> s(k);
for (int j = 0; j < k; j++)
cin >> s[j];
sw[i] = s;
}
vector<int> p(m);
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int i = 0; i < pow(2, n); i++) {
bool flag = true;
for (int j = 0; j < m; j++) {
int count = 0;
for (int k = 0; k < sw[j].size(); k++) {
count += bitset<10>(i)[sw[j][k] - 1];
}
if (count % 2 != p[j]) {
flag = false;
break;
}
}
if (flag)
ans++;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,538 | 841,537 | u331197998 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define rd(x) scanf("%d", &x)
#define rd2(x, y) scanf("%d %d", &x, &y)
#define rd3(x, y, z) scanf("%d %d %d", &x, &y, &z)
#define rl(x) scanf("%lld", &x)
#define rl2(x, y) scanf("%lld %lld", &x, &y)
#define rl3(x, y, z) scanf("%lld %lld %lld", &x, &y, &z)
#define wd(x) printf("%d", x)
#define wd2(x, y) printf("%d %d", x, y)
#define wl(x) printf("%lld", x)
#define wl2(x, y) printf("%lld %lld", x, y)
#define PC(x) putchar(x)
#define GC() getchar()
#define NL printf("\n")
#define SP printf(" ")
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define ITER(it, a) \
for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define fr(i, s, e) for (int i = s; i < e; i++)
#define frl(i, s, e) for (ll i = s; i < e; i++)
#define frr(i, s, e) for (int i = s - 1; i >= e; i--)
#define frv(i, a) for (int i = 0; i < (int)a.size(); i++)
#define frvr(i, a) for (int i = a.size() - 1; i >= 0; i--)
#define tr(i, a) for (typeof(a.begin()) i = a.begin(); i != a.end(); i++)
#define inf 10000000000000
#define mod 1000000007
#define maxn 100009
#define maxr 100009
map<ll, VL> mp;
void solve() {
ll n, m;
rl2(n, m);
fr(i, 0, m) {
ll k;
rl(k);
fr(j, 0, k) {
ll s;
rl(s);
mp[s - 1].PB(j);
}
}
VL p(m);
fr(i, 0, m) rl(p[i]);
ll pset = pow(2, n);
ll ct = 0;
fr(i, 0, pset) {
VL b(m, 0);
fr(j, 0, n) {
if (i & (1 << j)) {
VL tmp = mp[j];
fr(x, 0, SZ(tmp)) { b[tmp[x]]++; }
}
}
ll flag = 1;
fr(j, 0, m) {
if (p[j] != (b[j] % 2))
flag = 0;
}
if (flag)
ct++;
}
wl(ct);
NL;
return;
}
int main() {
// sstd::ios::sync_with_stdio(false); cin.tie(NULL);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define rd(x) scanf("%d", &x)
#define rd2(x, y) scanf("%d %d", &x, &y)
#define rd3(x, y, z) scanf("%d %d %d", &x, &y, &z)
#define rl(x) scanf("%lld", &x)
#define rl2(x, y) scanf("%lld %lld", &x, &y)
#define rl3(x, y, z) scanf("%lld %lld %lld", &x, &y, &z)
#define wd(x) printf("%d", x)
#define wd2(x, y) printf("%d %d", x, y)
#define wl(x) printf("%lld", x)
#define wl2(x, y) printf("%lld %lld", x, y)
#define PC(x) putchar(x)
#define GC() getchar()
#define NL printf("\n")
#define SP printf(" ")
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define ITER(it, a) \
for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define fr(i, s, e) for (int i = s; i < e; i++)
#define frl(i, s, e) for (ll i = s; i < e; i++)
#define frr(i, s, e) for (int i = s - 1; i >= e; i--)
#define frv(i, a) for (int i = 0; i < (int)a.size(); i++)
#define frvr(i, a) for (int i = a.size() - 1; i >= 0; i--)
#define tr(i, a) for (typeof(a.begin()) i = a.begin(); i != a.end(); i++)
#define inf 10000000000000
#define mod 1000000007
#define maxn 100009
#define maxr 100009
map<ll, VL> mp;
void solve() {
ll n, m;
rl2(n, m);
fr(i, 0, m) {
ll k;
rl(k);
fr(j, 0, k) {
ll s;
rl(s);
mp[s - 1].PB(i);
}
}
VL p(m);
fr(i, 0, m) rl(p[i]);
ll pset = pow(2, n);
ll ct = 0;
fr(i, 0, pset) {
VL b(m, 0);
fr(j, 0, n) {
if (i & (1 << j)) {
VL tmp = mp[j];
fr(x, 0, SZ(tmp)) { b[tmp[x]]++; }
}
}
ll flag = 1;
fr(j, 0, m) {
if (p[j] != (b[j] % 2))
flag = 0;
}
if (flag)
ct++;
}
wl(ct);
NL;
return;
}
int main() {
// sstd::ios::sync_with_stdio(false); cin.tie(NULL);
solve();
return 0;
} | [
"identifier.change",
"call.arguments.change"
] | 841,544 | 841,545 | u431615124 | cpp |
p03031 | #include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> light(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
light[i].push_back(a);
}
}
vector<int> P(N);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
int ans = 0;
for (int bit = 0; bit < (1 << N - 1); ++bit) {
int on = 0;
for (int i = 0; i < M; ++i) {
int cnt = 0;
for (auto p : light[i]) {
if (bit & (1 << p - 1))
++cnt;
}
if (cnt % 2 == P[i])
++on;
}
if (on == M)
++ans;
}
cout << ans << "\n";
return 0;
} | #include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> light(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
light[i].push_back(a);
}
}
vector<int> P(M);
for (int i = 0; i < M; ++i) {
cin >> P[i];
}
int ans = 0;
for (int bit = 0; bit < (1 << N); ++bit) {
int on = 0;
for (int i = 0; i < M; ++i) {
int cnt = 0;
for (auto p : light[i]) {
if (bit & (1 << p - 1))
++cnt;
}
if (cnt % 2 == P[i])
++on;
}
if (on == M)
++ans;
}
cout << ans << "\n";
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 841,555 | 841,556 | u813559924 | cpp |
p03031 | #include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> light(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
light[i].push_back(a);
}
}
vector<int> P(N);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
int ans = 0;
for (int bit = 0; bit < (1 << N); ++bit) {
int on = 0;
for (int i = 0; i < M; ++i) {
int cnt = 0;
for (auto p : light[i]) {
if (bit & (1 << p - 1))
++cnt;
}
if (cnt % 2 == P[i])
++on;
}
if (on == M)
++ans;
}
cout << ans << "\n";
return 0;
} | #include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> light(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
light[i].push_back(a);
}
}
vector<int> P(M);
for (int i = 0; i < M; ++i) {
cin >> P[i];
}
int ans = 0;
for (int bit = 0; bit < (1 << N); ++bit) {
int on = 0;
for (int i = 0; i < M; ++i) {
int cnt = 0;
for (auto p : light[i]) {
if (bit & (1 << p - 1))
++cnt;
}
if (cnt % 2 == P[i])
++on;
}
if (on == M)
++ans;
}
cout << ans << "\n";
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,557 | 841,556 | u813559924 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cout << #a << " = " << a << endl;
template <typename T> void setmax(T &x, T y) { x = max(x, y); }
template <typename T> void setmin(T &x, T y) { x = min(x, y); }
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> mask(m, 0);
FOR(i, 0, m) {
int k, x;
cin >> k;
while (k--) {
cin >> x;
x--;
mask[i] |= 1 << x;
}
}
vector<int> p(m);
FOR(i, 0, m) cin >> p[i];
int ans = 0;
FOR(i, 0, 1 << n) {
bool ok = true;
FOR(j, 0, m) ok &= __builtin_popcount(mask[j] & i) & 1 == p[j];
ans += ok;
}
cout << ans << endl;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cout << #a << " = " << a << endl;
template <typename T> void setmax(T &x, T y) { x = max(x, y); }
template <typename T> void setmin(T &x, T y) { x = min(x, y); }
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> mask(m, 0);
FOR(i, 0, m) {
int k, x;
cin >> k;
while (k--) {
cin >> x;
x--;
mask[i] |= 1 << x;
}
}
vector<int> p(m);
FOR(i, 0, m) cin >> p[i];
int ans = 0;
FOR(i, 0, 1 << n) {
bool ok = true;
FOR(j, 0, m) ok &= (__builtin_popcount(mask[j] & i) & 1) == p[j];
ans += ok;
}
cout << ans << endl;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
| [] | 841,558 | 841,559 | u761582382 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m), p(m);
vector<vector<int>> s(m, vector<int>(n));
rep(i, m) {
cin >> k[i];
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, m) cin >> p[i];
int cnt2 = 0;
for (int bit = 0; bit < (1 << n); bit++) {
bitset<10> sw(bit);
bool ok = true;
rep(i, m) {
int cnt = 0;
rep(j, k[i]) {
if (sw[s[i][j]] == 1)
cnt++;
}
if (cnt % 2 != p[i])
ok = false;
}
if (ok)
cnt2++;
}
cout << cnt2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m), p(m);
vector<vector<int>> s(m, vector<int>(n));
rep(i, m) {
cin >> k[i];
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, m) cin >> p[i];
int cnt2 = 0;
for (int bit = 0; bit < (1 << n); bit++) {
bitset<10> sw(bit);
bool ok = true;
rep(i, m) {
int cnt = 0;
rep(j, k[i]) {
if (sw[s[i][j] - 1] == 1)
cnt++;
}
if (cnt % 2 != p[i])
ok = false;
}
if (ok)
cnt2++;
}
cout << cnt2 << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 841,560 | 841,561 | u928712536 | cpp |
p03031 | #include <assert.h>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <limits>
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P1;
typedef pair<int, int> Pi;
typedef pair<double, Pi> Pdi;
typedef pair<ll, int> Pli;
typedef pair<P1, ll> P2;
typedef pair<ll, Pi> P1i;
const ll INF = 10000000000000000001;
struct edge {
int to, cost;
};
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
struct Road {
double cost;
int a, b;
};
struct pos {
int x, y, sx, sy, total;
};
int k[11], s[11][11];
int p[11];
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
cin >> k[i];
rep(j, k[i]) { cin >> s[j][i]; }
}
int total = 0;
rep(i, m) cin >> p[i];
for (int i = 0; i <= (1 << n); i++) {
int f = 0;
rep(l, m) {
int t = 0;
rep(j, k[l]) {
if (i & (1 << (s[j][l] - 1)))
t++;
}
if (t % 2 != p[l]) {
f = 1;
break;
}
}
if (f == 0)
total++;
}
cout << total << endl;
return 0;
}
| #include <assert.h>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <limits>
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P1;
typedef pair<int, int> Pi;
typedef pair<double, Pi> Pdi;
typedef pair<ll, int> Pli;
typedef pair<P1, ll> P2;
typedef pair<ll, Pi> P1i;
const ll INF = 10000000000000000001;
struct edge {
int to, cost;
};
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
struct Road {
double cost;
int a, b;
};
struct pos {
int x, y, sx, sy, total;
};
int k[11], s[11][11];
int p[11];
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
cin >> k[i];
rep(j, k[i]) { cin >> s[j][i]; }
}
int total = 0;
rep(i, m) cin >> p[i];
for (int i = 0; i < (1 << n); i++) {
int f = 0;
rep(l, m) {
int t = 0;
rep(j, k[l]) {
if (i & (1 << (s[j][l] - 1)))
t++;
}
if (t % 2 != p[l]) {
f = 1;
break;
}
}
if (f == 0)
total++;
}
cout << total << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,564 | 841,565 | u591824072 | cpp |
p03031 | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define deb(x) cout << #x << " = " << x << "\n";
#define F first
#define S second
signed main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
/************************************/
int s, b;
cin >> s >> b;
vector<int> bulb[b];
for (int i = 0; i < b; i++) {
int k;
cin >> k;
while (k--) {
int x;
cin >> x;
x--;
bulb[i].push_back(x);
}
}
vector<int> p(s);
for (int &i : p)
cin >> i;
int nos = 1 << s;
int ans = 0;
for (int i = 0; i < nos; i++) {
vector<int> state(s, 0), bulb_ON(b, 0);
int temp = i, j = 0;
for (int j = 0; j < s; j++) {
if (1 << j & i)
state[j] = 1;
}
int cnt = 0;
for (int j = 0; j < b; j++) {
int on = 0;
for (int swich : bulb[j])
on += state[swich];
cnt += (on % 2 == p[j]);
}
ans += cnt == b;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define deb(x) cout << #x << " = " << x << "\n";
#define F first
#define S second
signed main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
/************************************/
int s, b;
cin >> s >> b;
vector<int> bulb[b];
for (int i = 0; i < b; i++) {
int k;
cin >> k;
while (k--) {
int x;
cin >> x;
x--;
bulb[i].push_back(x);
}
}
vector<int> p(b);
for (int &i : p)
cin >> i;
int nos = 1 << s;
int ans = 0;
for (int i = 0; i < nos; i++) {
vector<int> state(s, 0), bulb_ON(b, 0);
int temp = i, j = 0;
for (int j = 0; j < s; j++) {
if (1 << j & i)
state[j] = 1;
}
int cnt = 0;
for (int j = 0; j < b; j++) {
int on = 0;
for (int swich : bulb[j])
on += state[swich];
cnt += (on % 2 == p[j]);
}
ans += (cnt == b);
}
cout << ans << "\n";
} | [] | 841,566 | 841,567 | u193862001 | cpp |
p03031 | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define deb(x) cout << #x << " = " << x << "\n";
#define F first
#define S second
signed main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
/************************************/
int s, b;
cin >> s >> b;
vector<int> bulb[b];
for (int i = 0; i < b; i++) {
int k;
cin >> k;
while (k--) {
int x;
cin >> x;
x--;
bulb[i].push_back(x);
}
}
vector<int> p(s);
for (int &i : p)
cin >> i;
int nos = 1 << s;
int ans = 0;
for (int i = 0; i < nos; i++) {
vector<int> state(s, 0), bulb_ON(b, 0);
int temp = i, j = 0;
for (int j = 0; j < s; j++) {
if (1 << j & i)
state[j] = 1;
}
int cnt = 0;
for (int j = 0; j < b; j++) {
int on = 0;
for (int swich : bulb[j])
on += state[swich];
cnt += (on % 2 == p[j]);
}
ans += cnt == b;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define deb(x) cout << #x << " = " << x << "\n";
#define F first
#define S second
signed main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
/************************************/
int s, b;
cin >> s >> b;
vector<int> bulb[b];
for (int i = 0; i < b; i++) {
int k;
cin >> k;
while (k--) {
int x;
cin >> x;
x--;
bulb[i].push_back(x);
}
}
vector<int> p(b);
for (int &i : p)
cin >> i;
int nos = 1 << s;
int ans = 0;
for (int i = 0; i < nos; i++) {
vector<int> state(s, 0), bulb_ON(b, 0);
int temp = i, j = 0;
for (int j = 0; j < s; j++) {
if (1 << j & i)
state[j] = 1;
}
int cnt = 0;
for (int j = 0; j < b; j++) {
int on = 0;
for (int swich : bulb[j])
on += state[swich];
cnt += (on % 2 == p[j]);
}
ans += cnt == b;
}
cout << ans << "\n";
}
| [] | 841,566 | 841,568 | u193862001 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m);
int ss;
vector<int> p(m);
int bit = 0;
int i, j;
for (i = 0; i < m; i++) {
cin >> k[i];
for (j = 0; j < k[i]; j++) {
cin >> ss;
s[i].push_back(ss);
}
}
for (i = 0; i < m; i++) {
cin >> p[i];
}
int tmp = 0;
int light = 0;
int ans = 0;
for (bit = 0; bit < 1 << n; bit++) {
light = 0;
for (i = 0; i < m; i++) {
tmp = 0;
for (j = 0; j < k[i]; j++) {
if (bit & 1 << (s[i][j] - 1))
tmp++;
}
if (tmp % 2 == p[i])
light++;
}
if (light == n)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m);
int ss;
vector<int> p(m);
int bit = 0;
int i, j;
for (i = 0; i < m; i++) {
cin >> k[i];
for (j = 0; j < k[i]; j++) {
cin >> ss;
s[i].push_back(ss);
}
}
for (i = 0; i < m; i++) {
cin >> p[i];
}
int tmp = 0;
int light = 0;
int ans = 0;
for (bit = 0; bit < 1 << n; bit++) {
light = 0;
for (i = 0; i < m; i++) {
tmp = 0;
for (j = 0; j < k[i]; j++) {
if (bit & 1 << (s[i][j] - 1))
tmp++;
}
if (tmp % 2 == p[i])
light++;
}
if (light == m)
ans++;
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 841,575 | 841,576 | u523698212 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int N, M;
int main() {
cin >> N >> M;
vector<int> lst[M];
rep(i, M) {
int k;
cin >> k;
rep(j, k) {
int s;
cin >> s;
lst[i].push_back(s);
}
}
vector<int> P(N, 0);
rep(i, N) cin >> P[i];
// bitで全通り試す.
int ans = 0;
rep(i, pow(2, N)) {
bool flg = 0;
rep(j, M) {
//電球jがついているか否かを調べる.
int cnt = 0;
rep(k, lst[j].size()) {
if ((i >> (lst[j][k] - 1)) & 1) {
cnt++;
}
}
if (cnt % 2 != P[j])
flg = 1;
}
if (flg == 1)
continue;
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int N, M;
int main() {
cin >> N >> M;
vector<int> lst[M];
rep(i, M) {
int k;
cin >> k;
rep(j, k) {
int s;
cin >> s;
lst[i].push_back(s);
}
}
vector<int> P(M, 0);
rep(i, M) cin >> P[i];
// bitで全通り試す.
int ans = 0;
rep(i, pow(2, N)) {
bool flg = 0;
rep(j, M) {
//電球jがついているか否かを調べる.
int cnt = 0;
rep(k, lst[j].size()) {
if ((i >> (lst[j][k] - 1)) & 1) {
cnt++;
}
}
if (cnt % 2 != P[j])
flg = 1;
}
if (flg == 1)
continue;
ans++;
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"call.arguments.change"
] | 841,579 | 841,580 | u480887263 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
rep(i, m) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
s[i].push_back(a - 1);
}
}
vector<int> p(m);
rep(i, m) cin >> p[i];
////////////////
int ans = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
bool ok = true;
for (int j = 0; j < m; ++j) { /////////////電球について
int count = 0;
for (int k; k < s[j].size(); k++) {
int num = s[j][k];
if ((bit >> num) & 1)
count++; /////電球iに繋がっているスイッチ
}
if (count % 2 != p[j]) {
ok = false;
break;
}
}
if (ok)
ans += 1;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
rep(i, m) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int a;
cin >> a;
s[i].push_back(a - 1);
}
}
vector<int> p(m);
rep(i, m) cin >> p[i];
////////////////
int ans = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
bool ok = true;
for (int j = 0; j < m; ++j) { /////////////電球について
int count = 0;
for (int k = 0; k < s[j].size(); k++) {
int num = s[j][k];
if ((bit >> num) & 1)
count++; /////電球iに繋がっているスイッチ
}
if (count % 2 != p[j]) {
ok = false;
break;
}
}
if (ok)
ans += 1;
}
cout << ans << endl;
} | [
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change"
] | 841,593 | 841,594 | u981304949 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll n, m, a, b;
in2(n, m);
vector<vector<ll>> c(m, vector<ll>(0));
vector<ll> d(m);
rep(i, m) {
in(a);
rep(j, a) {
in(b);
c[i].pb(b - 1);
}
}
a = 0;
bool h;
rep(i, m) in(d[i]);
rep(te, 1 << 10) {
bitset<10> s(te);
h = true;
rep(i, m) {
b = 0;
rep(j, c[i].size()) {
if (s.test(c[i][j]))
b++;
}
if (b % 2 != d[i])
h = false;
}
if (h)
a++;
}
out(a);
memi;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll n, m, a, b;
in2(n, m);
vector<vector<ll>> c(m, vector<ll>(0));
vector<ll> d(m);
rep(i, m) {
in(a);
rep(j, a) {
in(b);
c[i].pb(b - 1);
}
}
a = 0;
bool h;
rep(i, m) in(d[i]);
rep(te, 1 << n) {
bitset<10> s(te);
h = true;
rep(i, m) {
b = 0;
rep(j, c[i].size()) {
if (s.test(c[i][j]))
b++;
}
if (b % 2 != d[i])
h = false;
}
if (h)
a++;
}
out(a);
memi;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 841,599 | 841,600 | u917049698 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> adj[m + 5];
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
adj[i].push_back(a);
}
}
int frr[m + 5];
for (int i = 0; i < m; i++)
cin >> frr[i];
int flag = 0;
for (int i = 0; i <= pow(2, n); i++) {
map<int, int> mp;
for (int j = 0; j < n; j++) {
if (i & (1 << j)) {
mp[j + 1]++;
}
}
int kp = 0;
for (int j = 0; j < m; j++) {
int fl = 0;
for (int k = 0; k < adj[j].size(); k++) {
if (mp[adj[j][k]] > 0)
fl++;
}
if (fl % 2 == frr[j]) {
kp++;
}
// cout<<fl<<endl;
}
if (kp == m)
flag++;
}
cout << flag << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> adj[m + 5];
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
adj[i].push_back(a);
}
}
int frr[m + 5];
for (int i = 0; i < m; i++)
cin >> frr[i];
int flag = 0;
for (int i = 1; i <= pow(2, n); i++) {
map<int, int> mp;
for (int j = 0; j < n; j++) {
if (i & (1 << j)) {
mp[j + 1]++;
}
}
int kp = 0;
for (int j = 0; j < m; j++) {
int fl = 0;
for (int k = 0; k < adj[j].size(); k++) {
if (mp[adj[j][k]] > 0)
fl++;
}
if (fl % 2 == frr[j]) {
kp++;
}
// cout<<fl<<endl;
}
if (kp == m)
flag++;
}
cout << flag << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,605 | 841,606 | u837843177 | cpp |
p03031 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<int, int> P;
int A(int x) {
if (x >= 0)
return x;
else
return -x;
}
ll inv(ll x) {
ll res = 1;
ll k = N - 2;
ll y = x % N;
while (k) {
if (k & 1)
res = (res * y) % N;
y = (y % N) * (y % N) % N;
k /= 2;
}
return res;
}
unsigned long long popCount64bitB(unsigned long long x) {
x = ((x & 0xaaaaaaaaaaaaaaaaUL) >> 1) + (x & 0x5555555555555555UL);
x = ((x & 0xccccccccccccccccUL) >> 2) + (x & 0x3333333333333333UL);
x = ((x & 0xf0f0f0f0f0f0f0f0UL) >> 4) + (x & 0x0f0f0f0f0f0f0f0fUL);
x = ((x & 0xff00ff00ff00ff00UL) >> 8) + (x & 0x00ff00ff00ff00ffUL);
x = ((x & 0xffff0000ffff0000UL) >> 16) + (x & 0x0000ffff0000ffffUL);
x = ((x & 0xffffffff00000000UL) >> 32) + (x & 0x00000000ffffffffUL);
return x;
}
int main(void) {
int n, m;
cin >> n >> m;
vector<int> light(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
light[i] = 0;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
light[i] += (1 << (s - 1));
}
}
vector<int> p(m);
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < (1 << n); i++) {
bool flag = true;
;
for (int j = 0; j < m; j++) {
int digit = i & light[j];
int num = popCount64bitB(digit);
// cout<<num<<endl;
if (num % 2 != p[j])
flag = false;
}
if (flag)
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<int, int> P;
int A(int x) {
if (x >= 0)
return x;
else
return -x;
}
ll inv(ll x) {
ll res = 1;
ll k = N - 2;
ll y = x % N;
while (k) {
if (k & 1)
res = (res * y) % N;
y = (y % N) * (y % N) % N;
k /= 2;
}
return res;
}
unsigned long long popCount64bitB(unsigned long long x) {
x = ((x & 0xaaaaaaaaaaaaaaaaUL) >> 1) + (x & 0x5555555555555555UL);
x = ((x & 0xccccccccccccccccUL) >> 2) + (x & 0x3333333333333333UL);
x = ((x & 0xf0f0f0f0f0f0f0f0UL) >> 4) + (x & 0x0f0f0f0f0f0f0f0fUL);
x = ((x & 0xff00ff00ff00ff00UL) >> 8) + (x & 0x00ff00ff00ff00ffUL);
x = ((x & 0xffff0000ffff0000UL) >> 16) + (x & 0x0000ffff0000ffffUL);
x = ((x & 0xffffffff00000000UL) >> 32) + (x & 0x00000000ffffffffUL);
return x;
}
int main(void) {
int n, m;
cin >> n >> m;
vector<int> light(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
light[i] = 0;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
light[i] += (1 << (s - 1));
}
}
vector<int> p(m);
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int i = 0; i < (1 << n); i++) {
bool flag = true;
for (int j = 0; j < m; j++) {
int digit = i & light[j];
int num = popCount64bitB(digit);
// cout<<num<<endl;
if (num % 2 != p[j])
flag = false;
}
if (flag)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,613 | 841,614 | u744305661 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
cin >> a >> b;
int y = 0;
vector<vector<int>> d(b);
for (int i = 0; i < b; i++) {
int z;
cin >> z;
int k = 0;
for (int j = 0; j < z; j++) {
int rrr;
cin >> rrr;
d.at(i).push_back(rrr);
}
}
vector<int> p(b);
for (int i = 0; i < b; i++) {
cin >> p.at(i);
}
for (int bit = 0; bit < (1 << a); ++bit) {
int t = 1;
for (int i = 0; i < b; i++) {
int k = 0;
for (int j = 0; j < d.at(i).size(); j++) {
if (bit & (1 << d.at(i).at(j))) {
k++;
}
}
if (k % 2 != p.at(i)) {
t = 0;
}
}
if (t == 1) {
y++;
}
}
cout << y << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
cin >> a >> b;
int y = 0;
vector<vector<int>> d(b);
for (int i = 0; i < b; i++) {
int z;
cin >> z;
int k = 0;
for (int j = 0; j < z; j++) {
int rrr;
cin >> rrr;
d.at(i).push_back(rrr - 1);
}
}
vector<int> p(b);
for (int i = 0; i < b; i++) {
cin >> p.at(i);
}
for (int bit = 0; bit < (1 << a); ++bit) {
int t = 1;
for (int i = 0; i < b; i++) {
int k = 0;
for (int j = 0; j < d.at(i).size(); j++) {
if (bit & (1 << d.at(i).at(j))) {
k++;
}
}
if (k % 2 != p.at(i)) {
t = 0;
}
}
if (t == 1) {
y++;
}
}
cout << y << endl;
} | [
"expression.operation.binary.add"
] | 841,618 | 841,619 | u577774192 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const int INF = -100100100;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>(n));
vector<int> ks(m);
rep(i, m) {
int k;
cin >> k;
ks[i] = k;
rep(j, k) cin >> s[i][j];
}
vector<int> p(m);
rep(i, m) cin >> p[i];
int rel = 0;
rrep(i, n) {
vector<int> a(n, 4);
rep(k, i) a[k] = 1;
do {
bool ans = true;
rep(j, m) {
int chk = 0;
rep(l, ks[j]) {
if (a[s[j][l] - 1] == 1)
++chk;
}
if (chk % 2 != p[j])
ans = false;
}
if (ans)
rel++;
} while (next_permutation(a.begin(), a.end()));
}
cout << rel << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const int INF = -100100100;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m, vector<int>(n));
vector<int> ks(m);
rep(i, m) {
int k;
cin >> k;
ks[i] = k;
rep(j, k) cin >> s[i][j];
}
vector<int> p(m);
rep(i, m) cin >> p[i];
int rel = 0;
rep(i, n + 1) {
vector<int> a(n, 4);
rep(k, i) a[k] = 1;
do {
bool ans = true;
rep(j, m) {
int chk = 0;
rep(l, ks[j]) {
if (a[s[j][l] - 1] == 1)
++chk;
}
if (chk % 2 != p[j])
ans = false;
}
if (ans)
rel++;
} while (next_permutation(a.begin(), a.end()));
}
cout << rel << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 841,629 | 841,630 | u412659798 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int count_bit(int chk_bit, int bit_num) {
int count = 0;
for (int i = 0; i < bit_num; i++) {
if (chk_bit & (1 << i))
count++;
}
return count;
}
int main(void) {
int N, M = 0;
int pattern = 0;
/* 標準入力 */
cin >> N >> M;
std::vector<int> light_flag(M);
std::vector<int> p_i(M);
int k = 0; //条件数
int tmp_sij_bit = 0; //接続するスイッチビット
/* 標準入力 */
for (int light_i = 0; light_i < M; light_i++) {
cin >> k;
light_flag[light_i] = 0;
for (int j = 0; j < k; j++) {
cin >> tmp_sij_bit;
light_flag[light_i] |= (1 << (tmp_sij_bit - 1));
}
}
/* 標準入力 */
for (int i = 0; i < M; i++) {
cin >> p_i[i];
}
// debug
// for(int light_i=0; light_i<M; light_i++)
// {
// cout << "light_flag[" << light_i << "]" << light_flag[light_i] << endl;
// }
//スイッチN個の組み合わせを全探索
// Nの範囲は1～10なので、計算量の目安はO(2^10)
for (int chk_sij_bit = 1; chk_sij_bit < pow(2, N); chk_sij_bit++) {
//フラグリセット
int flag = 0;
// debug
// cout << "chk_sij_bit" << chk_sij_bit << endl;
//点灯するかの確認
// p_iの値が0->ONするスイッチ数が偶数なら点灯
// p_iの値が1->ONするスイッチ数が奇数なら点灯
for (int light_i = 0; light_i < M; light_i++) {
// debug
// cout << "count_bit:" << count_bit( (light_flag[light_i] & chk_sij_bit),
// N) << endl;
if ((count_bit((light_flag[light_i] & chk_sij_bit), N)) % 2 ==
p_i[light_i]) {
//点灯するならフラグインクリ
flag++;
} else {
//点灯しないならブレークで次のパターンに以降
break;
}
}
//全点灯するのでパターン数に追加
if (flag == M) {
// debug
// cout << "OK:chk_sij_bit:" << chk_sij_bit << endl;
pattern++;
}
}
cout << pattern << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int count_bit(int chk_bit, int bit_num) {
int count = 0;
for (int i = 0; i < bit_num; i++) {
if (chk_bit & (1 << i))
count++;
}
return count;
}
int main(void) {
int N, M = 0;
int pattern = 0;
/* 標準入力 */
cin >> N >> M;
std::vector<int> light_flag(M);
std::vector<int> p_i(M);
int k = 0; //条件数
int tmp_sij_bit = 0; //接続するスイッチビット
/* 標準入力 */
for (int light_i = 0; light_i < M; light_i++) {
cin >> k;
light_flag[light_i] = 0;
for (int j = 0; j < k; j++) {
cin >> tmp_sij_bit;
light_flag[light_i] |= (1 << (tmp_sij_bit - 1));
}
}
/* 標準入力 */
for (int i = 0; i < M; i++) {
cin >> p_i[i];
}
// debug
// for(int light_i=0; light_i<M; light_i++)
// {
// cout << "light_flag[" << light_i << "]" << light_flag[light_i] << endl;
// }
//スイッチN個の組み合わせを全探索
// Nの範囲は1～10なので、計算量の目安はO(2^10)
for (int chk_sij_bit = 0; chk_sij_bit < pow(2, N); chk_sij_bit++) {
//フラグリセット
int flag = 0;
// debug
// cout << "chk_sij_bit" << chk_sij_bit << endl;
//点灯するかの確認
// p_iの値が0->ONするスイッチ数が偶数なら点灯
// p_iの値が1->ONするスイッチ数が奇数なら点灯
for (int light_i = 0; light_i < M; light_i++) {
// debug
// cout << "count_bit:" << count_bit( (light_flag[light_i] & chk_sij_bit),
// N) << endl;
if ((count_bit((light_flag[light_i] & chk_sij_bit), N)) % 2 ==
p_i[light_i]) {
//点灯するならフラグインクリ
flag++;
} else {
//点灯しないならブレークで次のパターンに以降
break;
}
}
//全点灯するのでパターン数に追加
if (flag == M) {
// debug
// cout << "OK:chk_sij_bit:" << chk_sij_bit << endl;
pattern++;
}
}
cout << pattern << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,631 | 841,632 | u942653486 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> b(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int i = 0; i < k; i++) {
int s;
cin >> s;
b[i].push_back(s);
}
}
vector<int> p(m);
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int sw = 0; sw < (int)pow(2, n); sw++) {
bool all_on = true;
for (int i = 0; i < m; i++) {
int on = 0;
for (int s : b[i]) {
on += (sw >> (s - 1)) % 2;
}
all_on &= (on % 2 == p[i]);
}
if (all_on)
ans += 1;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> b(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
b[i].push_back(s);
}
}
vector<int> p(m);
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int sw = 0; sw < (int)pow(2, n); sw++) {
bool all_on = true;
for (int i = 0; i < m; i++) {
int on = 0;
for (int s : b[i]) {
on += (sw >> (s - 1)) % 2;
}
all_on &= (on % 2 == p[i]);
}
if (all_on)
ans += 1;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,635 | 841,636 | u185967517 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int to[12][12];
int p[12];
bool switch1[12];
int connect[12];
int cnt = 0;
int N, M;
void count() { // switchの状態の数をすべて試したとき、いくつの電球がついているのかをしらべる
for (int i = 1; i <= M; i++) {
connect[i] = 0;
}
// connectを初期化
for (int i = 1; i <= M; i++) {
for (int X = 1; X <= N; X++) {
if (to[i][X] > 0 && switch1[X] == true) {
connect[i]++;
}
}
}
bool flag = true;
for (int j = 1; j <= M; j++) {
if (connect[j] % 2 != p[j]) {
flag = false;
}
}
if (flag) {
cnt++;
}
}
void dfs(int depth) {
if (depth == N + 1) {
count();
return;
}
switch1[depth] = true;
dfs(depth + 1);
switch1[depth] = false;
dfs(depth + 1);
}
int main() {
cin >> N >> M;
for (int i = 1; i <= M; i++) {
int c;
cin >> c;
for (int j = 1; j <= c; j++) {
int s;
cin >> s;
to[i][s]++;
}
}
// to[i][s] > 0 means 電球 i is connnected to switch s
for (int i = 1; i <= M; i++) {
cin >> p[i];
}
cout << cnt << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int to[12][12];
int p[12];
bool switch1[12];
int connect[12];
int cnt = 0;
int N, M;
void count() { // switchの状態の数をすべて試したとき、いくつの電球がついているのかをしらべる
for (int i = 1; i <= M; i++) {
connect[i] = 0;
}
// connectを初期化
for (int i = 1; i <= M; i++) {
for (int X = 1; X <= N; X++) {
if (to[i][X] > 0 && switch1[X] == true) {
connect[i]++;
}
}
}
bool flag = true;
for (int j = 1; j <= M; j++) {
if (connect[j] % 2 != p[j]) {
flag = false;
}
}
if (flag) {
cnt++;
}
}
void dfs(int depth) {
if (depth == N + 1) {
count();
return;
}
switch1[depth] = true;
dfs(depth + 1);
switch1[depth] = false;
dfs(depth + 1);
}
int main() {
cin >> N >> M;
for (int i = 1; i <= M; i++) {
int c;
cin >> c;
for (int j = 1; j <= c; j++) {
int s;
cin >> s;
to[i][s]++;
}
}
// to[i][s] > 0 means 電球 i is connnected to switch s
for (int i = 1; i <= M; i++) {
cin >> p[i];
}
dfs(1);
cout << cnt << endl;
return 0;
}
| [
"call.add"
] | 841,644 | 841,645 | u904123392 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define INIT(a, n, x) \
; \
REP(i, (n)) { (a)[i] = (x); }
#define CINA(a, n) \
; \
REP(i, (n)) { cin >> (a)[i]; }
#define INIT2(a, n, m, x) \
; \
REP(i, (n)) { \
REP(j, (m)) { (a)[i][j] = (x); } \
}
#define CINA2(a, n, m) \
; \
REP(i, (n)) { \
REP(j, (m)) { cin >> (a)[i][j]; } \
}
#define LINY "YES\n"
#define Liny "Yes\n"
#define LINN "NO\n"
#define Linn "No\n"
#define umap unordered_map
// cout << setfill('0') << right << setw(4) << 12; // "0012"
ll min(ll x, ll y) { return (x < y ? x : y); }
ll max(ll x, ll y) { return (x > y ? x : y); }
int keta(ll x) {
if (x < 10) {
return 1;
} else {
return keta(x / 10) + 1;
}
}
int keta_wa(ll x) {
if (x < 10) {
return x;
} else {
return keta_wa(x / 10) + x % 10;
}
}
int ctoi(char c) { return ((c >= '0' && c <= '9') ? c - '0' : 0); }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
if (a < b) {
swap(a, b);
}
return a * b / gcd(a, b);
}
int main() {
ll N, M;
cin >> N >> M;
ll k[M];
ll p[M];
vector<ll> v[M];
REP(i, M) {
cin >> k[i];
REP(j, k[i]) {
ll s;
cin >> s;
v[i].push_back(s);
}
}
REP(i, M) { cin >> p[i]; }
ll count = 0;
for (ll tane = 0; tane < pow(2, N); tane++) {
ll temp = tane;
ll sw[N];
REP(i, N) {
sw[i] = temp % 2;
temp /= 2;
}
ll denkyu[M];
INIT(denkyu, M, 0);
REP(i, M) {
for (ll x : v[i]) {
denkyu[i] += sw[x];
}
}
ll on_count = 0;
REP(i, M) { on_count += (denkyu[i] % 2 == p[i]); }
if (on_count == M)
count++;
}
cout << count;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define INIT(a, n, x) \
; \
REP(i, (n)) { (a)[i] = (x); }
#define CINA(a, n) \
; \
REP(i, (n)) { cin >> (a)[i]; }
#define INIT2(a, n, m, x) \
; \
REP(i, (n)) { \
REP(j, (m)) { (a)[i][j] = (x); } \
}
#define CINA2(a, n, m) \
; \
REP(i, (n)) { \
REP(j, (m)) { cin >> (a)[i][j]; } \
}
#define LINY "YES\n"
#define Liny "Yes\n"
#define LINN "NO\n"
#define Linn "No\n"
#define umap unordered_map
// cout << setfill('0') << right << setw(4) << 12; // "0012"
ll min(ll x, ll y) { return (x < y ? x : y); }
ll max(ll x, ll y) { return (x > y ? x : y); }
int keta(ll x) {
if (x < 10) {
return 1;
} else {
return keta(x / 10) + 1;
}
}
int keta_wa(ll x) {
if (x < 10) {
return x;
} else {
return keta_wa(x / 10) + x % 10;
}
}
int ctoi(char c) { return ((c >= '0' && c <= '9') ? c - '0' : 0); }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
if (a < b) {
swap(a, b);
}
return a * b / gcd(a, b);
}
int main() {
ll N, M;
cin >> N >> M;
ll k[M];
ll p[M];
vector<ll> v[M];
REP(i, M) {
cin >> k[i];
REP(j, k[i]) {
ll s;
cin >> s;
--s;
v[i].push_back(s);
}
}
REP(i, M) { cin >> p[i]; }
ll count = 0;
for (ll tane = 0; tane < pow(2, N); tane++) {
ll temp = tane;
ll sw[N];
REP(i, N) {
sw[i] = temp % 2;
temp /= 2;
}
ll denkyu[M];
INIT(denkyu, M, 0);
REP(i, M) {
for (ll x : v[i]) {
denkyu[i] += sw[x];
}
}
ll on_count = 0;
REP(i, M) { on_count += (denkyu[i] % 2 == p[i]); }
if (on_count == M)
count++;
}
cout << count;
} | [
"expression.unary.arithmetic.add"
] | 841,649 | 841,650 | u168017191 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int>> S;
vector<int> P;
vector<bool> isOn;
int rec(int n) {
if (n == 0) { // すべて条件を満たしているか判定を行う
int ok = 1;
for (int i = 0; i < M; i++) {
int cnt = 0;
for (int j : S[i]) {
if (isOn[j])
cnt++;
}
if (cnt % 2 != P[i])
ok = 0;
}
return ok;
}
int res = 0;
// スイッチをつけない
res += rec(n - 1);
// スイッチをつける
isOn[n - 1] = true;
res += rec(n - 1);
isOn[n - 1] = false;
return res;
}
int main() {
cin >> N >> M;
S.resize(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
S[i].push_back(x);
}
}
P.resize(M);
for (int i = 0; i < M; i++) {
cin >> P[i];
}
isOn.resize(N, false);
cout << rec(N) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int>> S;
vector<int> P;
vector<bool> isOn;
int rec(int n) {
if (n == 0) { // すべて条件を満たしているか判定を行う
int ok = 1;
for (int i = 0; i < M; i++) {
int cnt = 0;
for (int j : S[i]) {
if (isOn[j])
cnt++;
}
if (cnt % 2 != P[i])
ok = 0;
}
return ok;
}
int res = 0;
// スイッチをつけない
res += rec(n - 1);
// スイッチをつける
isOn[n - 1] = true;
res += rec(n - 1);
isOn[n - 1] = false;
return res;
}
int main() {
cin >> N >> M;
S.resize(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
S[i].push_back(x - 1);
}
}
P.resize(M);
for (int i = 0; i < M; i++) {
cin >> P[i];
}
isOn.resize(N, false);
cout << rec(N) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 841,651 | 841,652 | u271063202 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define INF (1LL << 50)
#define MOD 1000000007
int k[11];
int p[11];
int s[11][11];
int N[11];
// 数字をスイッチに変換(Nbit) N[0]は使わない
void num2switch(int i) {
int j = 1;
while (i) {
if (i % 2 == 1) {
N[j] = 1;
} else {
N[j] = 0;
}
j++;
i /= 2;
}
}
int main() {
int n, M, cnt = 0;
cin >> n >> M;
// 入力
rep(i, M) {
cin >> k[i];
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) { cin >> p[i]; }
//全てのスイッチの組み合わせを総当たりする(2^N)
for (int num = 1; num < pow(2, n); num++) {
num2switch(num);
bool flag = false;
rep(i, M) {
if (flag) {
break;
}
int tmp = 0;
rep(j, k[i]) {
tmp += N[s[i][j]]; // S(i,j)のスイッチが押されていたら+1
tmp %= 2;
}
if (tmp != p[i]) { // 1つでも電球がつかなかったらフラグをたててbreak
flag = true;
}
}
if (!flag)
cnt++; // すべての電球がついたらcnt++
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define INF (1LL << 50)
#define MOD 1000000007
int k[11];
int p[11];
int s[11][11];
int N[11];
// 数字をスイッチに変換(Nbit) N[0]は使わない
void num2switch(int i) {
int j = 1;
while (i) {
if (i % 2 == 1) {
N[j] = 1;
} else {
N[j] = 0;
}
j++;
i /= 2;
}
}
int main() {
int n, M, cnt = 0;
cin >> n >> M;
// 入力
rep(i, M) {
cin >> k[i];
rep(j, k[i]) { cin >> s[i][j]; }
}
rep(i, M) { cin >> p[i]; }
//全てのスイッチの組み合わせを総当たりする(2^N)
for (int num = 0; num < pow(2, n); num++) {
num2switch(num);
bool flag = false;
rep(i, M) {
if (flag) {
break;
}
int tmp = 0;
rep(j, k[i]) {
tmp += N[s[i][j]]; // S(i,j)のスイッチが押されていたら+1
tmp %= 2;
}
if (tmp != p[i]) { // 1つでも電球がつかなかったらフラグをたててbreak
flag = true;
}
}
if (!flag)
cnt++; // すべての電球がついたらcnt++
}
cout << cnt << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,659 | 841,660 | u870092796 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
const int inf = 1e9;
int n, m, a[N], k, q, u, v, x, y, tc, c, l, r, ans, sz[N], b[N];
char s[N];
vector<int> g[10];
int main() {
// #ifndef ONLINE_JUDGE
// freopen("test.txt","r",stdin);
// #endif
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d", &x);
while (x--) {
scanf("%d", &y);
g[i].push_back(--y);
}
}
for (int i = 0; i < m; i++)
scanf("%d", &b[i]);
for (int msk = 1; msk < (1 << n); msk++) {
bool ok = true;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (auto j : g[i]) {
if ((msk & (1 << j))) {
cnt++;
}
}
if ((cnt % 2) != b[i])
ok = false;
}
if (ok)
ans++;
}
printf("%d", ans);
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
const int inf = 1e9;
int n, m, a[N], k, q, u, v, x, y, tc, c, l, r, ans, sz[N], b[N];
char s[N];
vector<int> g[10];
int main() {
// #ifndef ONLINE_JUDGE
// freopen("test.txt","r",stdin);
// #endif
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d", &x);
while (x--) {
scanf("%d", &y);
g[i].push_back(--y);
}
}
for (int i = 0; i < m; i++)
scanf("%d", &b[i]);
for (int msk = 0; msk < (1 << n); msk++) {
bool ok = true;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (auto j : g[i]) {
if ((msk & (1 << j))) {
cnt++;
}
}
if ((cnt % 2) != b[i])
ok = false;
}
if (ok)
ans++;
}
printf("%d", ans);
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,675 | 841,676 | u318875010 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> a(m);
for (int i = 0; i < m; i++) {
int s;
cin >> s;
a[i].resize(s);
for (int j = 0; j < s; j++)
cin >> a[i][j];
}
vector<int> p(m);
vector<int> s(n);
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i <= pow(2, n) - 1; i++) {
int k = 0;
for (int j = 0; j < m; j++) {
int so = 0;
for (auto u : a[j]) {
so += (i & (1 << (u - 1))) ? 1 : 0;
}
if ((so % 2) != p[j]) {
k = 1;
break;
}
}
if (!k)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> a(m);
for (int i = 0; i < m; i++) {
int s;
cin >> s;
a[i].resize(s);
for (int j = 0; j < s; j++)
cin >> a[i][j];
}
vector<int> p(m);
vector<int> s(n);
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int i = 0; i <= pow(2, n) - 1; i++) {
int k = 0;
for (int j = 0; j < m; j++) {
int so = 0;
for (auto u : a[j]) {
so += (i & (1 << (u - 1))) ? 1 : 0;
}
if ((so % 2) != p[j]) {
k = 1;
break;
}
}
if (!k)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,688 | 841,689 | u161616073 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define rep2(i, N) for (int i = 1; i <= N; i++)
using namespace std;
long long INF = 1e18;
long long mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> light(m);
rep(l, m) {
int k;
cin >> k;
rep(i, k) {
int sw;
cin >> sw;
light[l].emplace_back(sw - 1);
}
}
int p[m];
rep(i, m) cin >> p[i];
int switches[n];
switches[0] = 1;
rep(i, n - 1) switches[i + 1] = switches[i] * 2;
int ans = 0;
for (int i = 0; i <= (1 << n); i++) {
bool on[n] = {};
bool all_on = true;
rep(k, n) if (i & switches[k]) on[k] = true;
rep(l, m) {
int now = 0;
for (auto sw : light[l]) {
if (on[sw])
now++;
}
if (now % 2 != p[l]) {
all_on = false;
break;
}
}
if (all_on)
ans++;
}
cout << ans << endl;
return 0;
}
/*
*/
| #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define rep2(i, N) for (int i = 1; i <= N; i++)
using namespace std;
long long INF = 1e18;
long long mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> light(m);
rep(l, m) {
int k;
cin >> k;
rep(i, k) {
int sw;
cin >> sw;
light[l].emplace_back(sw - 1);
}
}
int p[m];
rep(i, m) cin >> p[i];
int switches[n];
switches[0] = 1;
rep(i, n - 1) switches[i + 1] = switches[i] * 2;
int ans = 0;
for (int i = 0; i < (1 << n); i++) {
bool on[n] = {};
bool all_on = true;
rep(k, n) if (i & switches[k]) on[k] = true;
rep(l, m) {
int now = 0;
for (auto sw : light[l]) {
if (on[sw])
now++;
}
if (now % 2 != p[l]) {
all_on = false;
break;
}
}
if (all_on)
ans++;
}
cout << ans << endl;
return 0;
}
/*
*/
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,692 | 841,693 | u120564432 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int n, m;
cin >> n >> m;
vector<vl> a(m);
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int s;
cin >> s;
a[i].push_back(s);
}
}
vl p(m);
rep(i, m) cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
bool f = true;
rep(i, m) {
int count = 0;
for (auto v : a[i]) {
if (bit & (1 << v))
count++;
}
if (count % 2 != p[i])
f = false;
}
if (f)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int n, m;
cin >> n >> m;
vector<vl> a(m);
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int s;
cin >> s;
s--;
a[i].push_back(s);
}
}
vl p(m);
rep(i, m) cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
bool f = true;
rep(i, m) {
int count = 0;
for (auto v : a[i]) {
if (bit & (1 << v))
count++;
}
if (count % 2 != p[i])
f = false;
}
if (f)
ans++;
}
cout << ans << endl;
} | [
"expression.unary.arithmetic.add"
] | 841,694 | 841,695 | u495881622 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int n, m;
cin >> n >> m;
vector<vl> a(m);
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int s;
cin >> s;
a[n].push_back(s);
}
}
vl p(m);
rep(i, m) cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
bool f = true;
rep(i, m) {
int count = 0;
for (auto v : a[i]) {
if (bit & (1 << v))
count++;
}
if (count % 2 != p[i])
f = false;
}
if (f)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int n, m;
cin >> n >> m;
vector<vl> a(m);
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int s;
cin >> s;
s--;
a[i].push_back(s);
}
}
vl p(m);
rep(i, m) cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
bool f = true;
rep(i, m) {
int count = 0;
for (auto v : a[i]) {
if (bit & (1 << v))
count++;
}
if (count % 2 != p[i])
f = false;
}
if (f)
ans++;
}
cout << ans << endl;
} | [
"expression.unary.arithmetic.add",
"identifier.change",
"variable_access.subscript.index.change"
] | 841,696 | 841,695 | u495881622 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
using ll = long long;
using vll = vector<ll>;
int main() {
//入力
ll N, M;
cin >> N >> M;
vector<vector<ll>> s(M);
rep(i, M) {
ll k;
cin >> k;
rep(j, k) {
ll a;
cin >> a;
s[i].push_back(a);
}
}
vll p(M);
rep(i, M) cin >> p[i];
ll ans = 0;
for (ll bit = 0; bit < (1 << N); bit++) {
bool ok = true;
rep(i, M) {
ll con = 0;
for (auto v : s[i]) {
if (bit & (1 << v))
++con;
}
if (con % 2 != p[i])
ok = false;
}
if (ok)
ans++;
}
//出力
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
using ll = long long;
using vll = vector<ll>;
int main() {
//入力
ll N, M;
cin >> N >> M;
vector<vector<ll>> s(M);
rep(i, M) {
ll k;
cin >> k;
rep(j, k) {
ll a;
cin >> a;
a--;
s[i].push_back(a);
}
}
vll p(M);
rep(i, M) cin >> p[i];
ll ans = 0;
for (ll bit = 0; bit < (1 << N); bit++) {
bool ok = true;
rep(i, M) {
ll con = 0;
for (auto v : s[i]) {
if (bit & (1 << v))
++con;
}
if (con % 2 != p[i])
ok = false;
}
if (ok)
ans++;
}
//出力
cout << ans << endl;
}
| [
"expression.unary.arithmetic.add"
] | 841,697 | 841,698 | u615178274 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Welcome to my source code!
int main() {
int n, m;
cin >> n >> m;
int k[m], s[m][10], p[m];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++)
cin >> s[i][j];
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
bool flag = true;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < k[i]; j++) {
if (bit & (1 << s[i][j]))
cnt++;
}
if (cnt % 2 != p[i]) {
flag = false;
break;
}
}
if (flag)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Welcome to my source code!
int main() {
int n, m;
cin >> n >> m;
int k[m], s[m][10], p[m];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++)
cin >> s[i][j];
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
bool flag = true;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < k[i]; j++) {
if (bit & (1 << (s[i][j] - 1)))
cnt++;
}
if (cnt % 2 != p[i]) {
flag = false;
break;
}
}
if (flag)
ans++;
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 841,699 | 841,700 | u440217234 | cpp |
p03031 | #include "bits/stdc++.h"
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define int ll
// #define double long double
//#define slld(t) scanf("%lld",&t)
//#define sd(t) scanf("%d",&t)
//#define pd(t) printf("%d\n",t)
//#define plld(t) printf("%lld\n",t)
#define vec vector<int>
#define vecp vector<pair<int, int>>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << x << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define debug(x) cerr << #x << ": " << x << endl
#define mod 1000000007
#define N 100005
#define MAX 300005
#define mod1 1000000007
#define mod2 998244353
#define bitcnt __builtin_popcountll
#define PI acos(-1)
//#define endl "\n"
#define inf 1e+15
int light[20] = {0}, a[20];
vector<int> v[20];
signed main() {
fast;
int n, m, ans = 0, k, x;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> x;
v[x - 1].pb(i);
}
}
for (int i = 1; i <= m; i++)
cin >> a[i];
for (int mask = 1; mask < (1 << n); mask++) {
memset(light, 0, sizeof(light));
for (int i = 0; i < n; i++) {
if ((mask & (1 << i))) {
for (int j = 0; j < v[i].size(); j++) {
light[v[i][j]]++;
}
}
}
int f = 1;
for (int i = 1; i <= m; i++) {
if (light[i] % 2 == a[i])
continue;
else {
f = 0;
break;
}
}
ans += f;
}
cout << ans << endl;
}
| #include "bits/stdc++.h"
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define int ll
// #define double long double
//#define slld(t) scanf("%lld",&t)
//#define sd(t) scanf("%d",&t)
//#define pd(t) printf("%d\n",t)
//#define plld(t) printf("%lld\n",t)
#define vec vector<int>
#define vecp vector<pair<int, int>>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << x << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define debug(x) cerr << #x << ": " << x << endl
#define mod 1000000007
#define N 100005
#define MAX 300005
#define mod1 1000000007
#define mod2 998244353
#define bitcnt __builtin_popcountll
#define PI acos(-1)
//#define endl "\n"
#define inf 1e+15
int light[20] = {0}, a[20];
vector<int> v[20];
signed main() {
fast;
int n, m, ans = 0, k, x;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> x;
v[x - 1].pb(i);
}
}
for (int i = 1; i <= m; i++)
cin >> a[i];
for (int mask = 0; mask < (1 << n); mask++) {
memset(light, 0, sizeof(light));
for (int i = 0; i < n; i++) {
if ((mask & (1 << i))) {
for (int j = 0; j < v[i].size(); j++) {
light[v[i][j]]++;
}
}
}
int f = 1;
for (int i = 1; i <= m; i++) {
if (light[i] % 2 == a[i])
continue;
else {
f = 0;
break;
}
}
ans += f;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,714 | 841,715 | u564412651 | cpp |
p03031 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 2019;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
int N, M;
cin >> N >> M;
int k[M];
vector<int> s[M];
int p[M];
rep(i, M) {
int a;
cin >> a;
k[i] = a;
rep(j, k[i]) {
int b;
cin >> b;
s[i].push_back(b);
}
}
rep(i, M) {
int c;
cin >> c;
p[i] = c;
}
int D[M + 1];
rep(i, M + 1) { D[i] = 0; } // syokika
int count = 0;
for (int bit = 0; bit < (1 << N); bit++) {
rep(i, N) {
if (bit & (1 << i)) {
D[i + 1] = 1;
}
}
bool ok = true;
rep(i, M) {
int judge = 0;
rep(j, k[i]) { judge += D[s[i][j]]; }
if (judge % 2 != p[i])
ok = false;
}
if (ok)
count++;
rep1(i, N) { D[i] = 0; }
}
cout << count << endl;
}
| #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 2019;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
int N, M;
cin >> N >> M;
int k[M];
vector<int> s[M];
int p[M];
rep(i, M) {
int a;
cin >> a;
k[i] = a;
rep(j, k[i]) {
int b;
cin >> b;
s[i].push_back(b);
}
}
rep(i, M) {
int c;
cin >> c;
p[i] = c;
}
int D[N + 1];
rep(i, N + 1) { D[i] = 0; } // syokika
int count = 0;
for (int bit = 0; bit < (1 << N); bit++) {
rep(i, N) {
if (bit & (1 << i)) {
D[i + 1] = 1;
}
}
bool ok = true;
rep(i, M) {
int judge = 0;
rep(j, k[i]) { judge += D[s[i][j]]; }
if (judge % 2 != p[i])
ok = false;
}
if (ok)
count++;
rep1(i, N) { D[i] = 0; }
}
cout << count << endl;
}
| [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 841,726 | 841,727 | u726501606 | cpp |
p03031 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 2019;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
int N, M;
cin >> N >> M;
int k[M];
vector<int> s[M];
int p[M];
rep(i, M) {
int a;
cin >> a;
k[i] = a;
rep(j, k[i]) {
int b;
cin >> b;
s[i].push_back(b);
}
}
rep(i, M) {
int c;
cin >> c;
p[i] = c;
}
int D[M + 1];
rep(i, M + 1) { D[i] = 0; } // syokika
int count = 0;
for (int bit = 0; bit < (1 << N); bit++) {
rep(i, N) {
if (bit & (1 << i)) {
D[i + 1] = 1;
}
}
bool ok = true;
rep(i, M) {
int judge = 0;
rep(j, k[i]) { judge += D[s[i][j]]; }
if (judge % 2 != p[i])
ok = false;
}
if (ok)
count++;
rep1(i, M) { D[i] = 0; }
}
cout << count << endl;
}
| #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 2019;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
int N, M;
cin >> N >> M;
int k[M];
vector<int> s[M];
int p[M];
rep(i, M) {
int a;
cin >> a;
k[i] = a;
rep(j, k[i]) {
int b;
cin >> b;
s[i].push_back(b);
}
}
rep(i, M) {
int c;
cin >> c;
p[i] = c;
}
int D[N + 1];
rep(i, N + 1) { D[i] = 0; } // syokika
int count = 0;
for (int bit = 0; bit < (1 << N); bit++) {
rep(i, N) {
if (bit & (1 << i)) {
D[i + 1] = 1;
}
}
bool ok = true;
rep(i, M) {
int judge = 0;
rep(j, k[i]) { judge += D[s[i][j]]; }
if (judge % 2 != p[i])
ok = false;
}
if (ok)
count++;
rep1(i, N) { D[i] = 0; }
}
cout << count << endl;
}
| [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 841,728 | 841,727 | u726501606 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(V, v) for (auto &&V : v)
#define all(x) (x).begin(), (x).end()
const int INF = 1 << 30;
const long long INFL = 1LL << 62;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
using lint = long long;
using namespace std;
int count_bit(unsigned long long data) {
data = (data & 0x5555555555555555) + ((data & 0xAAAAAAAAAAAAAAAA) >> 1);
data = (data & 0x3333333333333333) + ((data & 0xCCCCCCCCCCCCCCCC) >> 2);
data = (data & 0x0F0F0F0F0F0F0F0F) + ((data & 0xF0F0F0F0F0F0F0F0) >> 4);
data = (data & 0x00FF00FF00FF00FF) + ((data & 0xFF00FF00FF00FF00) >> 8);
data = (data & 0x0000FFFF0000FFFF) + ((data & 0xFFFF0000FFFF0000) >> 16);
data = (data & 0x00000000FFFFFFFF) + ((data & 0xFFFFFFFF00000000) >> 32);
return data;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> light(m);
vector<int> light_bit(m);
rep(i, m) {
int k;
cin >> k;
light[i].resize(k);
int bit = 0;
rep(j, k) {
int s;
cin >> s;
--s;
light[i][j] = s;
bit |= (1 << s);
}
light_bit[i] = bit;
}
vector<int> p(m);
rep(i, m) cin >> p[i];
int count = 0;
for (int bit = 1; bit < (1 << n); ++bit) {
bool flag = true;
rep(j, m) {
if ((count_bit(bit & light_bit[j]) % 2) != p[j]) {
flag = false;
break;
}
}
if (flag)
++count;
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(V, v) for (auto &&V : v)
#define all(x) (x).begin(), (x).end()
const int INF = 1 << 30;
const long long INFL = 1LL << 62;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
using lint = long long;
using namespace std;
int count_bit(unsigned long long data) {
data = (data & 0x5555555555555555) + ((data & 0xAAAAAAAAAAAAAAAA) >> 1);
data = (data & 0x3333333333333333) + ((data & 0xCCCCCCCCCCCCCCCC) >> 2);
data = (data & 0x0F0F0F0F0F0F0F0F) + ((data & 0xF0F0F0F0F0F0F0F0) >> 4);
data = (data & 0x00FF00FF00FF00FF) + ((data & 0xFF00FF00FF00FF00) >> 8);
data = (data & 0x0000FFFF0000FFFF) + ((data & 0xFFFF0000FFFF0000) >> 16);
data = (data & 0x00000000FFFFFFFF) + ((data & 0xFFFFFFFF00000000) >> 32);
return data;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> light(m);
vector<int> light_bit(m);
rep(i, m) {
int k;
cin >> k;
light[i].resize(k);
int bit = 0;
rep(j, k) {
int s;
cin >> s;
--s;
light[i][j] = s;
bit |= (1 << s);
}
light_bit[i] = bit;
}
vector<int> p(m);
rep(i, m) cin >> p[i];
int count = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
bool flag = true;
rep(j, m) {
if ((count_bit(bit & light_bit[j]) % 2) != p[j]) {
flag = false;
break;
}
}
if (flag)
++count;
}
cout << count << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,736 | 841,737 | u020746846 | cpp |
p03031 | #include <bits/stdc++.h>
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define INF 1145141919
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define Flag(x) (1 << (x))
#define Flagcount(x) __builtin_popcount(bit)
using namespace std;
int main(void) {
int N, M, count = 0, check = 0, ans = 0;
cin >> N >> M;
int k[M];
int s, p[M];
int bit[M] = {};
rep(i, M) {
cin >> k[i];
rep(j, k[i]) {
cin >> s;
bit[i] += Flag(s - 1);
}
}
rep(i, M) cin >> p[i];
for (int i = 0; i < Flag(N); i++) {
count = 0, check = 0;
for (int j = 0; j < M; j++) {
for (int k = 0; k < N; k++) {
if (i & bit[j] & Flag(k))
count++;
}
if (count % 2 != p[j]) {
check = 1;
break;
}
}
if (check == 0)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define INF 1145141919
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define Flag(x) (1 << (x))
#define Flagcount(x) __builtin_popcount(bit)
using namespace std;
int main(void) {
int N, M, count = 0, check = 0, ans = 0;
cin >> N >> M;
int k[M];
int s, p[M];
int bit[M] = {};
rep(i, M) {
cin >> k[i];
rep(j, k[i]) {
cin >> s;
bit[i] += Flag(s - 1);
}
}
rep(i, M) cin >> p[i];
for (int i = 0; i < Flag(N); i++) {
count = 0, check = 0;
for (int j = 0; j < M; j++) {
count = 0;
for (int k = 0; k < N; k++) {
if (i & bit[j] & Flag(k))
count++;
}
if (count % 2 != p[j]) {
check = 1;
break;
}
}
if (check == 0)
ans++;
}
cout << ans << endl;
} | [
"assignment.add"
] | 841,740 | 841,741 | u601444374 | cpp |
p03031 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> vec[i][j];
--vec[i][j];
}
}
vector<int> p(M);
for (int i = 0; i < M; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1 << N); bit++) {
bool ok = true;
for (int i = 0; i < M; i++) {
int con = 0;
for (int id : vec[i]) {
if (bit & (1 << id))
con++;
}
if (con & 2 != p[i])
ok = false;
}
if (ok)
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> vec[i][j];
--vec[i][j];
}
}
vector<int> p(M);
for (int i = 0; i < M; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1 << N); bit++) {
bool ok = true;
for (int i = 0; i < M; i++) {
int con = 0;
for (int id : vec[i]) {
if (bit & (1 << id))
con++;
}
if (con % 2 != p[i])
ok = false;
}
if (ok)
ans++;
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 841,742 | 841,743 | u835561357 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 10;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
/// cin/cout overloading
template <typename T> ostream &operator<<(ostream &out, vector<T> &vec) {
for (auto it = vec.begin(); it != vec.end(); ++it) {
out << *it << " ";
}
return out;
}
template <typename T> ostream &operator<<(ostream &out, pair<T, T> &P) {
out << P.first << " " << P.second;
return out;
}
template <typename T> istream &operator>>(istream &in, vector<T> &vec) {
for (auto it = vec.begin(); it != vec.end(); ++it) {
in >> *it;
}
return in;
}
template <typename T> istream &operator>>(istream &in, pair<T, T> &P) {
in >> P.first >> P.second;
return in;
}
/// 图相关
ll N, M;
struct Edge {
int to;
ll weight;
int next;
bool operator<(const Edge &rhs) { return weight < rhs.weight; }
};
struct Edge2 {
ll u, v, w;
Edge2(ll u_, ll v_, ll w_) : u(u_), v(v_), w(w_) {}
Edge2() : u(0ll), v(0ll), w(0ll) {}
bool operator<(const Edge2 &rhs) { return w < rhs.w; }
};
// vector<Edge> edges(MAXN << 1);
// vi head(MAXN, -1);
// vector<int> matchingx(MAXN, -1);
// vector<int> matchingy(MAXN, -1);
// vector<bool> check(MAXN);
// vector<ll> dis(MAXN);
// vector<bool> vis(MAXN, false);
// int cnt = 1;
// void addEdge(int from, int to, ll weight) {
// edges[cnt].to = to;
// edges[cnt].weight = weight;
// edges[cnt].next = head[from];
// head[from] = cnt++;
// }
//
// bool dfs(int u) {
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (!check[v]) {
// check[v] = true;
// if (matchingy[v] == -1 || dfs(matchingy[v])) {
// matchingy[v] = u;
// matchingx[u] = v;
// return true;
// }
// }
// }
// return false;
//}
//
// int hungarian() {
// int ans = 0;
// fill(matchingx.begin(), matchingx.end(), -1);
// fill(matchingy.begin(), matchingy.end(), -1);
// for (int u = 1; u <= N; ++u) {
//// if (matchingx[u] == -1) {
// {
// fill(check.begin(), check.end(), false);
// if (dfs(u)) {
// ++ans;
// }
// }
// }
// return ans;
//}
//
// void dijkstra(const ll s) {
// priority_queue<P, vector<P>, greater<P>> que;
// fill(dis.begin(), dis.end(), INF);
// dis[s] = 0;
// que.push(P(0, s));
//////multiple sources
//// for (auto& x : shops) {
//// dis[x] = 0;
//// que.push(P(0, x));
//// }
// while (!que.empty()) {
// P p = que.top();
// que.pop();
//// cout << "pop " << p.second << endl;
// int u = p.second;
// if (dis[u] < p.first) continue;
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (dis[v] > dis[u] + edges[i].weight) {
// dis[v] = dis[u] + edges[i].weight;
//// cout << "push " << v << endl;
// que.push(P(dis[v], v));
// }
// }
// }
//}
// void zeroOneBFS(const int s) {
// deque<P> que;
// fill(dis.begin(), dis.end(), INF);
// dis[s] = 0;
// que.push_front(P(0, s));
// while (!que.empty()) {
// P p = que.front();
// que.pop_front();
// int u = p.second;
// if (dis[u] < p.first) continue;
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (dis[v] > dis[u] + edges[i].weight) {
// dis[v] = dis[u] + edges[i].weight;
// if (edges[i].weight) {
// que.push_back(P(dis[v], v));
// } else {
// que.push_front(P(dis[v], v));
// }
// }
// }
// }
//}
// Union-Find 并查集
class UnionFind {
vector<ll> par;
public:
explicit UnionFind(ll n) : par(n, -1) {}
ll root(ll a) {
if (par[a] < 0) {
return a;
}
return par[a] = root(par[a]);
}
ll size(ll a) { return -par[root(a)]; }
void unite(ll a, ll b) {
a = root(a);
b = root(b);
if (a != b) {
if (size(a) < size(b)) {
swap(a, b);
}
par[a] += par[b];
par[b] = a;
}
}
};
ll kruskal(vector<Edge2> &edges2, const ll V) {
sort(edges2.begin(), edges2.end());
UnionFind uf(V + 10);
ll res = 0;
Edge2 e;
for (int i = 0; i < edges2.size(); ++i) {
e = edges2[i];
if (uf.root(e.u) != uf.root(e.v)) {
uf.unite(e.u, e.v);
res += e.w;
}
}
return res;
}
// 线段树
struct SegmentTreeNode {
ll maxVal;
ll minVal;
ll sum;
ll len;
ll lazy;
ll left, right;
SegmentTreeNode() {}
};
class SegmentTree {
public:
explicit SegmentTree(size_t size, const vll &nums)
: tree(size << 2), nums(nums) {}
void build(ll root, ll left, ll right) {
tree[root].lazy = 0;
tree[root].left = left;
tree[root].right = right;
tree[root].len = right - left + 1;
if (left == right) {
tree[root].maxVal = nums[left];
tree[root].minVal = nums[left];
tree[root].sum = nums[left];
} else {
ll mid = (right - left) / 2 + left;
build(root * 2, left, mid);
build(root * 2 + 1, mid + 1, right);
tree[root].minVal = min(tree[root * 2].minVal, tree[root * 2 + 1].minVal);
tree[root].maxVal = max(tree[root * 2].maxVal, tree[root * 2 + 1].maxVal);
tree[root].sum = tree[root * 2].sum + tree[root * 2 + 1].sum;
}
}
void pushup(ll root) {
tree[root].minVal = min(tree[root * 2].minVal, tree[root * 2 + 1].minVal);
tree[root].maxVal = max(tree[root * 2].maxVal, tree[root * 2 + 1].maxVal);
tree[root].sum = tree[root * 2].sum + tree[root * 2 + 1].sum;
}
//// add single node val
void add(ll root, ll id, ll addVal) {
if (tree[root].left == tree[root].right) {
tree[root].maxVal += addVal;
tree[root].minVal += addVal;
tree[root].sum += addVal;
return;
}
ll mid = (tree[root].right - tree[root].left) / 2 + tree[root].left;
if (id <= mid) {
add(root * 2, id, addVal);
} else {
add(root * 2 + 1, id, addVal);
}
pushup(root);
}
void pushdown(ll root) {
if (tree[root].lazy) {
tree[root * 2].lazy += tree[root].lazy;
tree[root * 2 + 1].lazy += tree[root].lazy;
tree[root * 2].sum += tree[root * 2].len * tree[root].lazy;
tree[root * 2 + 1].sum += tree[root * 2 + 1].len * tree[root].lazy;
tree[root * 2].maxVal += tree[root].lazy;
tree[root * 2 + 1].maxVal += tree[root].lazy;
tree[root * 2].minVal += tree[root].lazy;
tree[root * 2 + 1].minVal += tree[root].lazy;
tree[root].lazy = 0;
}
}
//// query range sum
ll querySum(ll root, ll left, ll right) {
if (tree[root].left >= left && tree[root].right <= right) {
return tree[root].sum;
}
if (tree[root].left > right || tree[root].right < left) {
return 0;
}
if (tree[root].lazy) {
pushdown(root);
}
return querySum(root * 2, left, right) +
querySum(root * 2 + 1, left, right);
}
//// query range max/min
ll queryMax(ll root, ll left, ll right) {
if (tree[root].left >= left && tree[root].right <= right) {
return tree[root].maxVal;
}
if (tree[root].left > right || tree[root].right < left) {
return -INF;
}
if (tree[root].lazy) {
pushdown(root);
}
return max(queryMax(root * 2, left, right),
queryMax(root * 2 + 1, left, right));
}
ll queryMin(ll root, ll left, ll right) {
if (tree[root].left >= left && tree[root].right <= right) {
return tree[root].minVal;
}
if (tree[root].left > right || tree[root].right < left) {
return INF;
}
if (tree[root].lazy) {
pushdown(root);
}
return min(queryMin(root * 2, left, right),
queryMin(root * 2 + 1, left, right));
}
//// add range val
void update(ll root, ll left, ll right, ll addVal) {
if (tree[root].left >= left && tree[root].right <= right) {
tree[root].lazy += addVal;
tree[root].sum += tree[root].len * addVal;
tree[root].maxVal += addVal;
tree[root].minVal += addVal;
return;
}
if (tree[root].left > right || tree[root].right < left) {
return;
}
if (tree[root].lazy) {
pushdown(root);
}
update(root * 2, left, right, addVal);
update(root * 2 + 1, left, right, addVal);
pushup(root);
}
private:
vector<SegmentTreeNode> tree;
const vll &nums;
};
/// 组合数
////約数求める //約数
// void divisor(ll n, vector<ll> &ret) {
// for (ll i = 1; i * i <= n; i++) {
// if (n % i == 0) {
// ret.push_back(i);
// if (i * i != n) ret.push_back(n / i);
// }
// }
// sort(ret.begin(), ret.end());
//}
////階乗
ll factorial(ll n) {
ll ret = 1;
for (ll i = 1; i <= n; ++i) {
ret = (ret * i) % MOD;
}
return ret;
}
////モジュラ逆数
ll inv_mod(ll n) {
ll a = n % MOD, b = MOD - 2, ret = 1;
while (b > 0) {
if (b & 1)
ret = (ret * a) % MOD;
a = (a * a) % MOD;
b >>= 1;
}
return ret;
}
ll nPr(ll n, ll r) {
ll ret = 1;
for (ll i = n; i >= n - r + 1; --i) {
ret = ret * (i % MOD) % MOD;
}
return ret;
}
ll nCr(ll n, ll r) { return nPr(n, r) * inv_mod(factorial(r)) % MOD; }
//
// vll F(MAXN), Finv(MAXN), inv(MAXN);
//
// ll pow_mod(ll a, ll b, ll p) {
// ll ret = 1;
// while (b) {
// if (b & 1) ret = (ret * a) % p;
// a = (a * a) % p;
// b >>= 1;
// }
// return ret;
//}
//
// void comb_init() {
// inv[1] = 1;
// for (int i = 2; i < MAXN; ++i) {
// inv[i] = (MOD - MOD / i) * 1ll * inv[MOD % i] % MOD;
// }
// F[0] = Finv[0] = 1;
// for (int i = 1; i < MAXN; ++i) {
// F[i] = F[i-1] * 1ll * i % MOD;
// Finv[i] = Finv[i-1] * 1ll * inv[i] % MOD;
// }
//}
//
// inline ll comb(ll n, ll m) {
// if (m < 0 || m > n) return 0;
// return F[n] * 1ll * Finv[n - m] % MOD * Finv[m] % MOD;
// }
//
inline ll add_mod(ll a, ll b) { return (a + b) % MOD; }
inline ll mul_mod(ll a, ll b) { return a * b % MOD; }
inline ll sub_mod(ll a, ll b) { return (a + MOD - b) % MOD; }
void dfs(int pos, vi &swit, vector<vi> &S, vi &P, int &res) {
if (pos >= P.size()) {
for (int i = 0; i < S.size(); ++i) {
int sum = 0;
for (auto &x : S[i]) {
sum += swit[x - 1];
}
if (sum % 2 != P[i]) {
return;
}
}
++res;
return;
}
dfs(pos + 1, swit, S, P, res);
swit[pos] = 1;
dfs(pos + 1, swit, S, P, res);
swit[pos] = 0;
}
/// main函数
int main() {
int N, M;
cin >> N >> M;
vector<vi> S(M);
vi P(M);
int ki;
int sii;
for (int i = 0; i < M; ++i) {
cin >> ki;
for (int j = 0; j < ki; ++j) {
cin >> sii;
S[i].push_back(sii);
}
}
cin >> P;
vi swit(N);
int res = 0;
dfs(0, swit, S, P, res);
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 10;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
/// cin/cout overloading
template <typename T> ostream &operator<<(ostream &out, vector<T> &vec) {
for (auto it = vec.begin(); it != vec.end(); ++it) {
out << *it << " ";
}
return out;
}
template <typename T> ostream &operator<<(ostream &out, pair<T, T> &P) {
out << P.first << " " << P.second;
return out;
}
template <typename T> istream &operator>>(istream &in, vector<T> &vec) {
for (auto it = vec.begin(); it != vec.end(); ++it) {
in >> *it;
}
return in;
}
template <typename T> istream &operator>>(istream &in, pair<T, T> &P) {
in >> P.first >> P.second;
return in;
}
/// 图相关
ll N, M;
struct Edge {
int to;
ll weight;
int next;
bool operator<(const Edge &rhs) { return weight < rhs.weight; }
};
struct Edge2 {
ll u, v, w;
Edge2(ll u_, ll v_, ll w_) : u(u_), v(v_), w(w_) {}
Edge2() : u(0ll), v(0ll), w(0ll) {}
bool operator<(const Edge2 &rhs) { return w < rhs.w; }
};
// vector<Edge> edges(MAXN << 1);
// vi head(MAXN, -1);
// vector<int> matchingx(MAXN, -1);
// vector<int> matchingy(MAXN, -1);
// vector<bool> check(MAXN);
// vector<ll> dis(MAXN);
// vector<bool> vis(MAXN, false);
// int cnt = 1;
// void addEdge(int from, int to, ll weight) {
// edges[cnt].to = to;
// edges[cnt].weight = weight;
// edges[cnt].next = head[from];
// head[from] = cnt++;
// }
//
// bool dfs(int u) {
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (!check[v]) {
// check[v] = true;
// if (matchingy[v] == -1 || dfs(matchingy[v])) {
// matchingy[v] = u;
// matchingx[u] = v;
// return true;
// }
// }
// }
// return false;
//}
//
// int hungarian() {
// int ans = 0;
// fill(matchingx.begin(), matchingx.end(), -1);
// fill(matchingy.begin(), matchingy.end(), -1);
// for (int u = 1; u <= N; ++u) {
//// if (matchingx[u] == -1) {
// {
// fill(check.begin(), check.end(), false);
// if (dfs(u)) {
// ++ans;
// }
// }
// }
// return ans;
//}
//
// void dijkstra(const ll s) {
// priority_queue<P, vector<P>, greater<P>> que;
// fill(dis.begin(), dis.end(), INF);
// dis[s] = 0;
// que.push(P(0, s));
//////multiple sources
//// for (auto& x : shops) {
//// dis[x] = 0;
//// que.push(P(0, x));
//// }
// while (!que.empty()) {
// P p = que.top();
// que.pop();
//// cout << "pop " << p.second << endl;
// int u = p.second;
// if (dis[u] < p.first) continue;
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (dis[v] > dis[u] + edges[i].weight) {
// dis[v] = dis[u] + edges[i].weight;
//// cout << "push " << v << endl;
// que.push(P(dis[v], v));
// }
// }
// }
//}
// void zeroOneBFS(const int s) {
// deque<P> que;
// fill(dis.begin(), dis.end(), INF);
// dis[s] = 0;
// que.push_front(P(0, s));
// while (!que.empty()) {
// P p = que.front();
// que.pop_front();
// int u = p.second;
// if (dis[u] < p.first) continue;
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (dis[v] > dis[u] + edges[i].weight) {
// dis[v] = dis[u] + edges[i].weight;
// if (edges[i].weight) {
// que.push_back(P(dis[v], v));
// } else {
// que.push_front(P(dis[v], v));
// }
// }
// }
// }
//}
// Union-Find 并查集
class UnionFind {
vector<ll> par;
public:
explicit UnionFind(ll n) : par(n, -1) {}
ll root(ll a) {
if (par[a] < 0) {
return a;
}
return par[a] = root(par[a]);
}
ll size(ll a) { return -par[root(a)]; }
void unite(ll a, ll b) {
a = root(a);
b = root(b);
if (a != b) {
if (size(a) < size(b)) {
swap(a, b);
}
par[a] += par[b];
par[b] = a;
}
}
};
ll kruskal(vector<Edge2> &edges2, const ll V) {
sort(edges2.begin(), edges2.end());
UnionFind uf(V + 10);
ll res = 0;
Edge2 e;
for (int i = 0; i < edges2.size(); ++i) {
e = edges2[i];
if (uf.root(e.u) != uf.root(e.v)) {
uf.unite(e.u, e.v);
res += e.w;
}
}
return res;
}
// 线段树
struct SegmentTreeNode {
ll maxVal;
ll minVal;
ll sum;
ll len;
ll lazy;
ll left, right;
SegmentTreeNode() {}
};
class SegmentTree {
public:
explicit SegmentTree(size_t size, const vll &nums)
: tree(size << 2), nums(nums) {}
void build(ll root, ll left, ll right) {
tree[root].lazy = 0;
tree[root].left = left;
tree[root].right = right;
tree[root].len = right - left + 1;
if (left == right) {
tree[root].maxVal = nums[left];
tree[root].minVal = nums[left];
tree[root].sum = nums[left];
} else {
ll mid = (right - left) / 2 + left;
build(root * 2, left, mid);
build(root * 2 + 1, mid + 1, right);
tree[root].minVal = min(tree[root * 2].minVal, tree[root * 2 + 1].minVal);
tree[root].maxVal = max(tree[root * 2].maxVal, tree[root * 2 + 1].maxVal);
tree[root].sum = tree[root * 2].sum + tree[root * 2 + 1].sum;
}
}
void pushup(ll root) {
tree[root].minVal = min(tree[root * 2].minVal, tree[root * 2 + 1].minVal);
tree[root].maxVal = max(tree[root * 2].maxVal, tree[root * 2 + 1].maxVal);
tree[root].sum = tree[root * 2].sum + tree[root * 2 + 1].sum;
}
//// add single node val
void add(ll root, ll id, ll addVal) {
if (tree[root].left == tree[root].right) {
tree[root].maxVal += addVal;
tree[root].minVal += addVal;
tree[root].sum += addVal;
return;
}
ll mid = (tree[root].right - tree[root].left) / 2 + tree[root].left;
if (id <= mid) {
add(root * 2, id, addVal);
} else {
add(root * 2 + 1, id, addVal);
}
pushup(root);
}
void pushdown(ll root) {
if (tree[root].lazy) {
tree[root * 2].lazy += tree[root].lazy;
tree[root * 2 + 1].lazy += tree[root].lazy;
tree[root * 2].sum += tree[root * 2].len * tree[root].lazy;
tree[root * 2 + 1].sum += tree[root * 2 + 1].len * tree[root].lazy;
tree[root * 2].maxVal += tree[root].lazy;
tree[root * 2 + 1].maxVal += tree[root].lazy;
tree[root * 2].minVal += tree[root].lazy;
tree[root * 2 + 1].minVal += tree[root].lazy;
tree[root].lazy = 0;
}
}
//// query range sum
ll querySum(ll root, ll left, ll right) {
if (tree[root].left >= left && tree[root].right <= right) {
return tree[root].sum;
}
if (tree[root].left > right || tree[root].right < left) {
return 0;
}
if (tree[root].lazy) {
pushdown(root);
}
return querySum(root * 2, left, right) +
querySum(root * 2 + 1, left, right);
}
//// query range max/min
ll queryMax(ll root, ll left, ll right) {
if (tree[root].left >= left && tree[root].right <= right) {
return tree[root].maxVal;
}
if (tree[root].left > right || tree[root].right < left) {
return -INF;
}
if (tree[root].lazy) {
pushdown(root);
}
return max(queryMax(root * 2, left, right),
queryMax(root * 2 + 1, left, right));
}
ll queryMin(ll root, ll left, ll right) {
if (tree[root].left >= left && tree[root].right <= right) {
return tree[root].minVal;
}
if (tree[root].left > right || tree[root].right < left) {
return INF;
}
if (tree[root].lazy) {
pushdown(root);
}
return min(queryMin(root * 2, left, right),
queryMin(root * 2 + 1, left, right));
}
//// add range val
void update(ll root, ll left, ll right, ll addVal) {
if (tree[root].left >= left && tree[root].right <= right) {
tree[root].lazy += addVal;
tree[root].sum += tree[root].len * addVal;
tree[root].maxVal += addVal;
tree[root].minVal += addVal;
return;
}
if (tree[root].left > right || tree[root].right < left) {
return;
}
if (tree[root].lazy) {
pushdown(root);
}
update(root * 2, left, right, addVal);
update(root * 2 + 1, left, right, addVal);
pushup(root);
}
private:
vector<SegmentTreeNode> tree;
const vll &nums;
};
/// 组合数
////約数求める //約数
// void divisor(ll n, vector<ll> &ret) {
// for (ll i = 1; i * i <= n; i++) {
// if (n % i == 0) {
// ret.push_back(i);
// if (i * i != n) ret.push_back(n / i);
// }
// }
// sort(ret.begin(), ret.end());
//}
////階乗
ll factorial(ll n) {
ll ret = 1;
for (ll i = 1; i <= n; ++i) {
ret = (ret * i) % MOD;
}
return ret;
}
////モジュラ逆数
ll inv_mod(ll n) {
ll a = n % MOD, b = MOD - 2, ret = 1;
while (b > 0) {
if (b & 1)
ret = (ret * a) % MOD;
a = (a * a) % MOD;
b >>= 1;
}
return ret;
}
ll nPr(ll n, ll r) {
ll ret = 1;
for (ll i = n; i >= n - r + 1; --i) {
ret = ret * (i % MOD) % MOD;
}
return ret;
}
ll nCr(ll n, ll r) { return nPr(n, r) * inv_mod(factorial(r)) % MOD; }
//
// vll F(MAXN), Finv(MAXN), inv(MAXN);
//
// ll pow_mod(ll a, ll b, ll p) {
// ll ret = 1;
// while (b) {
// if (b & 1) ret = (ret * a) % p;
// a = (a * a) % p;
// b >>= 1;
// }
// return ret;
//}
//
// void comb_init() {
// inv[1] = 1;
// for (int i = 2; i < MAXN; ++i) {
// inv[i] = (MOD - MOD / i) * 1ll * inv[MOD % i] % MOD;
// }
// F[0] = Finv[0] = 1;
// for (int i = 1; i < MAXN; ++i) {
// F[i] = F[i-1] * 1ll * i % MOD;
// Finv[i] = Finv[i-1] * 1ll * inv[i] % MOD;
// }
//}
//
// inline ll comb(ll n, ll m) {
// if (m < 0 || m > n) return 0;
// return F[n] * 1ll * Finv[n - m] % MOD * Finv[m] % MOD;
// }
//
inline ll add_mod(ll a, ll b) { return (a + b) % MOD; }
inline ll mul_mod(ll a, ll b) { return a * b % MOD; }
inline ll sub_mod(ll a, ll b) { return (a + MOD - b) % MOD; }
void dfs(int pos, vi &swit, vector<vi> &S, vi &P, int &res) {
if (pos >= swit.size()) {
for (int i = 0; i < S.size(); ++i) {
int sum = 0;
for (auto &x : S[i]) {
sum += swit[x - 1];
}
if (sum % 2 != P[i]) {
return;
}
}
++res;
return;
}
dfs(pos + 1, swit, S, P, res);
swit[pos] = 1;
dfs(pos + 1, swit, S, P, res);
swit[pos] = 0;
}
/// main函数
int main() {
int N, M;
cin >> N >> M;
vector<vi> S(M);
vi P(M);
int ki;
int sii;
for (int i = 0; i < M; ++i) {
cin >> ki;
for (int j = 0; j < ki; ++j) {
cin >> sii;
S[i].push_back(sii);
}
}
cin >> P;
vi swit(N);
int res = 0;
dfs(0, swit, S, P, res);
cout << res << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 841,760 | 841,761 | u666721654 | cpp |
p03031 | #include <bits/stdc++.h>
#define endl '\n'
#define INF (1 << 21)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
const int MOD = 1000000009;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
int k[15];
int s[15][15];
int p[15];
int sw[15];
bool jud;
int ans = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
for (int i = 0; i <= (1 << n); i++) {
int temp = i;
jud = true;
for (int j = 0; j < n; j++) {
sw[j] = temp % 2;
temp /= 2;
}
for (int j = 0; j < m && jud; j++) {
int cnt = 0;
for (int f = 0; f < k[j]; f++) {
cnt += sw[s[j][f] - 1];
}
if (cnt % 2 != p[j]) {
jud = false;
}
}
if (jud)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define endl '\n'
#define INF (1 << 21)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
const int MOD = 1000000009;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
int k[15];
int s[15][15];
int p[15];
int sw[15];
bool jud;
int ans = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
for (int i = 0; i < (1 << n); i++) {
int temp = i;
jud = true;
for (int j = 0; j < n; j++) {
sw[j] = temp % 2;
temp /= 2;
}
for (int j = 0; j < m && jud; j++) {
int cnt = 0;
for (int f = 0; f < k[j]; f++) {
cnt += sw[s[j][f] - 1];
}
if (cnt % 2 != p[j]) {
jud = false;
}
}
if (jud)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,770 | 841,771 | u188534680 | cpp |
p03031 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M, vector<int>(N));
vector<int> p(M);
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < M; i++) {
cin >> p[i];
}
int ans = 0;
for (long long int i = 0; i <= pow(2, N); i++) {
bitset<10> b(i);
string B = b.to_string();
int chk = 0;
for (int j = 0; j < M; j++) {
int sum = 0;
for (int l = 0; l < k[j]; l++) {
if (B[s[j][l] + 9 - N] == '1') {
sum++;
}
}
if (sum % 2 != p[j]) {
break;
}
chk++;
}
if (chk == M) {
ans++;
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M, vector<int>(N));
vector<int> p(M);
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < M; i++) {
cin >> p[i];
}
int ans = 0;
for (long long int i = 0; i < pow(2, N); i++) {
bitset<10> b(i);
string B = b.to_string();
int chk = 0;
for (int j = 0; j < M; j++) {
int sum = 0;
for (int l = 0; l < k[j]; l++) {
if (B[s[j][l] + 9 - N] == '1') {
sum++;
}
}
if (sum % 2 != p[j]) {
break;
}
chk++;
}
if (chk == M) {
ans++;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,785 | 841,786 | u096717230 | cpp |
p03031 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M, vector<int>(N));
vector<int> p(M);
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < M; i++) {
cin >> p[i];
}
int ans = 0;
for (long long int i = 0; i <= pow(2, N); i++) {
bitset<10> b(i);
string B = b.to_string();
int chk = 0;
for (int j = 0; j < M; j++) {
int sum = 0;
for (int l = 0; l < k[j]; l++) {
if (B[s[j][l] + 9 - N] == '1') {
sum++;
}
}
if (sum % 2 != p[j]) {
break;
}
chk++;
}
if (chk == M) {
ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M, vector<int>(N));
vector<int> p(M);
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < M; i++) {
cin >> p[i];
}
int ans = 0;
for (long long int i = 0; i < pow(2, N); i++) {
bitset<10> b(i);
string B = b.to_string();
int chk = 0;
for (int j = 0; j < M; j++) {
int sum = 0;
for (int l = 0; l < k[j]; l++) {
if (B[s[j][l] + 9 - N] == '1') {
sum++;
}
}
if (sum % 2 != p[j]) {
break;
}
chk++;
}
if (chk == M) {
ans++;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,787 | 841,786 | u096717230 | cpp |
p03031 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define N 100005
#define mid ((l + r) / 2)
#define dbg(x) (cerr << #x << " : " << x << endl)
#define endl "\n"
#define MOD 100000009
using namespace std;
typedef long long int lli;
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> ar(100, vector<int>());
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
ar[i].pb(x);
}
}
vector<int> p(100);
for (int i = 0; i < m; i++)
cin >> p[i];
int res = 0;
// bitmask
for (int i = 0; i <= (1 << n); i++) {
bool ok = true;
for (int j = 0; j < m; j++) {
int sum = 0;
for (int x : ar[j]) {
if (i & (1 << (x - 1)))
sum++;
}
if (sum % 2 != p[j]) {
ok = false;
break;
}
}
if (ok) {
res++;
}
}
cout << res;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define N 100005
#define mid ((l + r) / 2)
#define dbg(x) (cerr << #x << " : " << x << endl)
#define endl "\n"
#define MOD 100000009
using namespace std;
typedef long long int lli;
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> ar(100, vector<int>());
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
ar[i].pb(x);
}
}
vector<int> p(100);
for (int i = 0; i < m; i++)
cin >> p[i];
int res = 0;
// bitmask
for (int i = 0; i < (1 << n); i++) {
bool ok = true;
for (int j = 0; j < m; j++) {
int sum = 0;
for (int x : ar[j]) {
if (i & (1 << (x - 1)))
sum++;
}
if (sum % 2 != p[j]) {
ok = false;
break;
}
}
if (ok) {
res++;
}
}
cout << res;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,788 | 841,789 | u724515098 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(n);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int tmp;
cin >> tmp;
s[i].push_back(--tmp);
}
}
vector<int> p;
for (int i = 0; i < m; i++) {
int tmp;
cin >> tmp;
p.push_back(tmp);
}
int okCount = 0;
for (int state = 0; state < pow(2, n); state++) {
// 各電球について，条件を満たすかを確認する
bool ngFlag = true;
for (int denki = 0; denki < n; denki++) {
int count = 0;
for (int sw = 0; sw < s[denki].size(); sw++) {
if (state & (1 << (s[denki][sw] - 1))) {
count++;
}
}
if (p[denki] != count % 2) {
ngFlag = false;
break;
}
}
if (ngFlag) {
okCount++;
}
}
cout << okCount << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int tmp;
cin >> tmp;
s[i].push_back(--tmp);
}
}
vector<int> p;
for (int i = 0; i < m; i++) {
int tmp;
cin >> tmp;
p.push_back(tmp);
}
int okCount = 0;
for (int state = 0; state < pow(2, n); state++) {
// 各電球について，条件を満たすかを確認する
bool ngFlag = true;
for (int denki = 0; denki < m; denki++) {
int count = 0;
for (int sw = 0; sw < s[denki].size(); sw++) {
if (state & (1 << (s[denki][sw]))) {
count++;
}
}
if (p[denki] != count % 2) {
ngFlag = false;
break;
}
}
if (ngFlag) {
okCount++;
}
}
cout << okCount << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 841,792 | 841,793 | u231458241 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(n);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int tmp;
cin >> tmp;
s[i].push_back(--tmp);
}
}
vector<int> p;
for (int i = 0; i < m; i++) {
int tmp;
cin >> tmp;
p.push_back(tmp);
}
int okCount = 0;
for (int state = 0; state < pow(2, n); state++) {
// 各電球について，条件を満たすかを確認する
bool ngFlag = true;
for (int denki = 0; denki < n; denki++) {
int count = 0;
for (int sw = 0; sw < s[denki].size(); sw++) {
if (state & (1 << s[denki][sw])) {
count++;
}
}
if (p[denki] != count % 2) {
ngFlag = false;
break;
}
}
if (ngFlag) {
okCount++;
}
}
cout << okCount << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int tmp;
cin >> tmp;
s[i].push_back(--tmp);
}
}
vector<int> p;
for (int i = 0; i < m; i++) {
int tmp;
cin >> tmp;
p.push_back(tmp);
}
int okCount = 0;
for (int state = 0; state < pow(2, n); state++) {
// 各電球について，条件を満たすかを確認する
bool ngFlag = true;
for (int denki = 0; denki < m; denki++) {
int count = 0;
for (int sw = 0; sw < s[denki].size(); sw++) {
if (state & (1 << (s[denki][sw]))) {
count++;
}
}
if (p[denki] != count % 2) {
ngFlag = false;
break;
}
}
if (ngFlag) {
okCount++;
}
}
cout << okCount << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 841,794 | 841,793 | u231458241 | cpp |
p03031 | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;
int n, m;
vvi v;
bitset<11> p;
void read() {
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
vector<int> temp;
for (int j = 0; j < k; ++j) {
int s;
cin >> s;
temp.pb(s);
}
v.pb(temp);
}
for (int i = 0; i < m; ++i) {
bool x;
cin >> x;
if (x)
p[i] = 1;
else
p[i] = 0;
}
}
void solve() {
int sol = 0, l = (1 << n);
for (int i = 1; i < l; ++i) {
bitset<11> activated;
for (int j = 0; j < n; ++j)
if ((1 << j) & i) {
// bulb[j] = !bulb[j];
activated[j] = true;
}
vector<int> bulb(m);
for (int j = 0; j < n; ++j)
if (activated[j])
for (int k = 0; k < m; ++k)
for (auto x : v[k])
if (x == j + 1)
++bulb[k];
bool good = 1;
for (int j = 0; j < m && good; ++j)
if (bulb[j] % 2 != p[j])
good = 0;
if (good)
++sol;
}
cout << sol;
}
int main() {
ios ::sync_with_stdio(false);
cin.tie(nullptr);
read();
solve();
return 0;
}
| #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;
int n, m;
vvi v;
bitset<11> p;
void read() {
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
vector<int> temp;
for (int j = 0; j < k; ++j) {
int s;
cin >> s;
temp.pb(s);
}
v.pb(temp);
}
for (int i = 0; i < m; ++i) {
bool x;
cin >> x;
if (x)
p[i] = 1;
else
p[i] = 0;
}
}
void solve() {
int sol = 0, l = (1 << n);
for (int i = 0; i < l; ++i) {
bitset<11> activated;
for (int j = 0; j < n; ++j)
if ((1 << j) & i) {
// bulb[j] = !bulb[j];
activated[j] = true;
}
vector<int> bulb(m);
for (int j = 0; j < n; ++j)
if (activated[j])
for (int k = 0; k < m; ++k)
for (auto x : v[k])
if (x == j + 1)
++bulb[k];
bool good = 1;
for (int j = 0; j < m && good; ++j)
if (bulb[j] % 2 != p[j])
good = 0;
if (good)
++sol;
}
cout << sol;
}
int main() {
ios ::sync_with_stdio(false);
cin.tie(nullptr);
read();
solve();
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,802 | 841,803 | u519883882 | cpp |
p03031 | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;
int n, m;
vvi v;
bitset<11> p;
void read() {
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
vector<int> temp;
for (int j = 0; j < k; ++j) {
int s;
cin >> s;
temp.pb(s);
}
v.pb(temp);
}
for (int i = 0; i < m; ++i) {
bool x;
cin >> x;
if (x)
p[i] = 1;
else
p[i] = 0;
}
}
void solve() {
int sol = 0, l = (1 << n);
for (int i = 1; i < l; ++i) {
bitset<11> activated;
for (int j = 0; j < n; ++j)
if ((1 << j) & i) {
// bulb[j] = !bulb[j];
activated[j] = true;
}
vector<int> bulb(m);
for (int j = 0; j < n; ++j)
if (activated[j])
for (int k = 0; k < m; ++k)
for (auto x : v[k])
if (x == j + 1)
++bulb[k];
bool good = 1;
for (int j = 0; j < m && good; ++j)
if (bulb[j] % 2 != p[j])
good = 0;
if (good)
++sol;
}
cout << sol;
}
int main() {
ios ::sync_with_stdio(false);
cin.tie(nullptr);
read();
solve();
return 0;
}
| #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;
int n, m;
vvi v;
bitset<11> p;
void read() {
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
vector<int> temp;
for (int j = 0; j < k; ++j) {
int s;
cin >> s;
temp.pb(s);
}
v.pb(temp);
}
for (int i = 0; i < m; ++i) {
bool x;
cin >> x;
if (x)
p[i] = 1;
else
p[i] = 0;
}
}
void solve() {
int sol = 0, l = (1 << n);
for (int i = 1; i <= l; ++i) {
bitset<11> activated;
for (int j = 0; j < n; ++j)
if ((1 << j) & i) {
// bulb[j] = !bulb[j];
activated[j] = true;
}
vector<int> bulb(m);
for (int j = 0; j < n; ++j)
if (activated[j])
for (int k = 0; k < m; ++k)
for (auto x : v[k])
if (x == j + 1)
++bulb[k];
bool good = 1;
for (int j = 0; j < m && good; ++j)
if (bulb[j] % 2 != p[j])
good = 0;
if (good)
++sol;
}
cout << sol;
}
int main() {
ios ::sync_with_stdio(false);
cin.tie(nullptr);
read();
solve();
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,802 | 841,804 | u519883882 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
int k[M];
int s[M][N];
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
s[i][j] = 0;
}
}
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int S;
cin >> S;
s[i][S - 1] = 1;
}
}
int p[M];
for (int i = 0; i < M; i++) {
cin >> p[i];
}
int ans = 0;
int sw[N];
int sum;
for (int i = 0; i < (1 << M); i++) {
for (int n = 0; n < N; n++) {
sw[n] = (i >> n) & 1;
}
bool good = true;
for (int m = 0; m < M; m++) {
sum = 0;
for (int n = 0; n < N; n++) {
sum += s[m][n] * sw[n];
}
if (sum % 2 != p[m]) {
good = false;
break;
}
}
if (good)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
int k[M];
int s[M][N];
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
s[i][j] = 0;
}
}
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int S;
cin >> S;
s[i][S - 1] = 1;
}
}
int p[M];
for (int i = 0; i < M; i++) {
cin >> p[i];
}
int ans = 0;
int sw[N];
int sum;
for (int i = 0; i < (1 << N); i++) {
for (int n = 0; n < N; n++) {
sw[n] = (i >> n) & 1;
}
bool good = true;
for (int m = 0; m < M; m++) {
sum = 0;
for (int n = 0; n < N; n++) {
sum += s[m][n] * sw[n];
}
if (sum % 2 != p[m]) {
good = false;
break;
}
}
if (good)
ans++;
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,805 | 841,806 | u995725911 | cpp |
p03031 | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = (a), i##Len_ = (b); i < i##Len_; i++)
//参考
// http://drken1215.hatenablog.com/entry/2019/06/15/135300
int main() {
ll N, M, res;
cin >> N >> M;
vector<vector<ll>> s(M);
REP(i, M) {
ll K;
cin >> K;
REP(j, K) {
ll a;
cin >> a;
a--;
s[i].push_back(a);
}
}
vector<ll> p(M);
REP(i, M) { cin >> p[i]; }
res = 0;
// bit全探索
// bit 0b0101 → 4個のスイッチ
for (ll bit = 0; bit < (1 << N); ++bit) {
bool isOK = true;
REP(i, M) {
ll con = 0;
//スイッチ s[i][0],s[i][2],…, のうち on になっている個数を
// 2 で割った余りが p[i] に等しい時に点灯
for (auto v : s[i]) {
// s[i]について、ONを数え上げ
if (bit & (1 << v))
++con;
}
if (con % 2 == p[i])
isOK = false;
}
//すべての電球で成立すれば足す
if (isOK)
res++;
}
cout << res << endl;
} | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = (a), i##Len_ = (b); i < i##Len_; i++)
//参考
// http://drken1215.hatenablog.com/entry/2019/06/15/135300
int main() {
ll N, M, res;
cin >> N >> M;
vector<vector<ll>> s(M);
REP(i, M) {
ll K;
cin >> K;
REP(j, K) {
ll a;
cin >> a;
a--;
s[i].push_back(a);
}
}
vector<ll> p(M);
REP(i, M) { cin >> p[i]; }
res = 0;
// bit全探索
// bit 0b0101 → 4個のスイッチ
for (ll bit = 0; bit < (1 << N); ++bit) {
bool isOK = true;
REP(i, M) {
ll con = 0;
//スイッチ s[i][0],s[i][2],…, のうち on になっている個数を
// 2 で割った余りが p[i] に等しい時に点灯
for (auto v : s[i]) {
// s[i]について、ONを数え上げ
if (bit & (1 << v))
++con;
}
//すべての電球で成立する必要がある
if (con % 2 != p[i])
isOK = false;
}
if (isOK)
res++;
}
cout << res << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 841,811 | 841,812 | u485731913 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> vec[i][j];
vec[i][j]--;
}
}
vector<int> p(M);
for (int i = 0; i < M; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < (1 << N); i++) {
bool on = true;
for (int j = 0; j < M; j++) {
int c = 0;
for (auto x : vec[j]) {
if ((i >> x) & 1) {
c++;
}
}
c %= 2;
if (c != p[j])
on = false;
}
if (on)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> vec[i][j];
vec[i][j]--;
}
}
vector<int> p(M);
for (int i = 0; i < M; i++)
cin >> p[i];
int ans = 0;
for (int i = 0; i < (1 << N); i++) {
bool on = true;
for (int j = 0; j < M; j++) {
int c = 0;
for (auto x : vec[j]) {
if ((i >> x) & 1)
c++;
}
c %= 2;
if (c != p[j])
on = false;
}
if (on)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,813 | 841,814 | u633402865 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
auto k = vector<int>(m);
auto s = vector<vector<int>>(m);
auto p = vector<int>(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int tmp;
cin >> tmp;
s[i].push_back(tmp);
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int ans = 0;
int ok;
for (int i = 0; i < (int)pow(2, n); i++) {
ok = 1;
for (int j = 0; j < m; j++) {
int sum = 0;
for (int l = 0; l < k[j]; l++) {
sum = (sum + ((i / (int)pow(2, s[j][l])) % 2)) % 2;
}
if (sum != p[j]) {
ok = 0;
break;
}
}
if (ok == 1)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
auto k = vector<int>(m);
auto s = vector<vector<int>>(m);
auto p = vector<int>(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int tmp;
cin >> tmp;
s[i].push_back(tmp);
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int ans = 0;
int ok;
for (int i = 0; i < (int)pow(2, n); i++) {
ok = 1;
for (int j = 0; j < m; j++) {
int sum = 0;
for (int l = 0; l < k[j]; l++) {
sum = (sum + ((i / (int)pow(2, s[j][l] - 1)) % 2)) % 2;
}
if (sum != p[j]) {
ok = 0;
break;
}
}
if (ok == 1)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 841,819 | 841,820 | u855985627 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.