#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
void construct_network(int H,int W,int K) {
int i,j;
vi vv;
for (i = 0; i < H; i++) {
vi v;
for (j = 0; j < W; j++) v.pb(i*W+j);
if (i > 0) v.pb(vv.back());
vv.pb(add_xor(v));
}
for (i = 0; i < W; i++) {
vi v;
for (j = 0; j < H; j++) v.pb(j*W+i);
if (i > 0) v.pb(vv.back());
vv.pb(add_xor(v));
}
vi num;
for (i = 0; i < 9; i++) num.pb(vv.back());
for (i = 0; i < vv.size(); i++) {
int c = vv[i];
for (j = 0; j < 9; j++) {
int n = add_and({num[j],c});
num[j] = add_xor({num[j],c});
c = n;
}
}
for (i = 0; i < 9; i++) {
if (!(K & (1 << i))) num[i] = add_not(num[i]);
}
add_and(num);
}
Compilation message
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:65:15: error: 'add_xor' was not declared in this scope
vv.pb(add_xor(v));
^~~~~~~
vision.cpp:71:15: error: 'add_xor' was not declared in this scope
vv.pb(add_xor(v));
^~~~~~~
vision.cpp:75:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < vv.size(); i++) {
~~^~~~~~~~~~~
vision.cpp:78:21: error: 'add_and' was not declared in this scope
int n = add_and({num[j],c});
^~~~~~~
vision.cpp:79:22: error: 'add_xor' was not declared in this scope
num[j] = add_xor({num[j],c});
^~~~~~~
vision.cpp:84:39: error: 'add_not' was not declared in this scope
if (!(K & (1 << i))) num[i] = add_not(num[i]);
^~~~~~~
vision.cpp:86:5: error: 'add_and' was not declared in this scope
add_and(num);
^~~~~~~
