Language: C++

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <bitset>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
int n;
vector <vector<int>> x(n+3, vector<int> n+3), y(n+3,vector<int> n+3);
VI a(n+3);
int counter (int x) {
    if(x == 0) return 0;
    return counter(x >> 1) + (x & 1);
}
//int Counter(int x)
int main(){
    cin >> n;
     for(int i = 1; i <= n; i++) {
        cin >> a[i];
        for(int j = 1; j <= a[i]; j++) {
            cin >> x[i][j] >> y[i][j];
        }
    }
    int ans = 0;
    for(int bit = 1; bit < (1 << n); bit++) {
               // cout << bitset<8>(x) << ' ' << bitset<8>(counter(x))<< endl;;
               bool flg=true;
               if (!(bit & (1<<i-1))) continue;
               FOR(j,1,a[i]){
                   if(bit >> (x[i][j]-1 & 1) ^ y[i][j]) flg=false;
               }
               
               
        }
        if(flg==true) ans=max(ans,counter<bit>);
    }
    


Compiler output:
a.cc:70:41: error: expected primary-expression before 'n'
   70 | vector <vector<int>> x(n+3, vector<int> n+3), y(n+3,vector<int> n+3);
      |                                         ^
a.cc:70:65: error: expected primary-expression before 'n'
   70 | vector <vector<int>> x(n+3, vector<int> n+3), y(n+3,vector<int> n+3);
      |                                                                 ^
a.cc: In function 'int main()':
a.cc:89:32: error: 'i' was not declared in this scope
   89 |                if (!(bit & (1<<i-1))) continue;
      |                                ^
a.cc:90:26: error: 'i' was not declared in this scope
   90 |                FOR(j,1,a[i]){
      |                          ^
a.cc:56:37: note: in definition of macro 'FOR'
   56 | #define FOR(i,a,b) for(int i=(a);i<(b);i++)
      |                                     ^
a.cc:96:12: error: 'flg' was not declared in this scope
   96 |         if(flg==true) ans=max(ans,counter<bit>);
      |            ^~~
a.cc:96:43: error: 'bit' was not declared in this scope
   96 |         if(flg==true) ans=max(ans,counter<bit>);
      |                                           ^~~
a.cc:96:47: error: expected primary-expression before ')' token
   96 |         if(flg==true) ans=max(ans,counter<bit>);
      |                                               ^