#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K)
{
int query_number = H * W - 1;
vector<int>mn, sc;
for(int i = H - 1; i >= 0; --i)
{
vector<int>pz;
for(int a = i, b = 0; a < H && b < W; ++a, ++b)
pz.push_back(a * W + b);
if(i == H-1)
add_xor(pz), ++query_number;
else
add_xor({query_number, add_xor(pz)}), query_number += 2;
mn.push_back(query_number);
}
for(int i = 1; i < W; ++i)
{
vector<int>pz;
for(int a = 0, b = i; a < H && b < W; ++a, ++b)
pz.push_back(a * W + b);
add_xor({query_number, add_xor(pz)}), query_number += 2;
mn.push_back(query_number);
}
for(int i = 0; i < W; ++i)
{
vector<int>pz;
for(int a = 0, b = i; a < H && b >= 0; ++a, --b)
pz.push_back(a * W + b);
if(i == 0)
add_xor(pz), ++query_number;
else
add_xor({query_number, add_xor(pz)}), query_number += 2;
sc.push_back(query_number);
}
for(int i = 1; i < H; ++i)
{
vector<int>pz;
for(int a = i, b = W - 1; a < H && b >= 0; ++a, --b)
pz.push_back(a * W + b);
add_xor({query_number, add_xor(pz)});
query_number += 2;
sc.push_back(query_number);
}
vector<int>lst;
for(int i = K; i < mn.size(); ++i)
{
if(i + 1 < mn.size())
{
add_xor({add_and({mn[i-K], mn[i]}), add_and({mn[i-K], mn[i+1]})});
query_number += 3;
}
else
{
add_xor({add_and({mn[i-K], mn[i]})});
query_number += 2;
}
lst.push_back(query_number);
}
for(int i = K; i < sc.size(); ++i)
{
if(i+1 < sc.size())
{
add_xor({add_and({sc[i-K], sc[i]}), add_and({sc[i-K], sc[i+1]})});
query_number += 3;
}
else
{
add_xor({add_and({sc[i-K], sc[i]})});
query_number += 2;
}
lst.push_back(query_number);
}
vector<int>lst2;
++K;
for(int i = K; i < mn.size(); ++i)
{
if(i + 1 < mn.size())
{
add_xor({add_and({mn[i-K], mn[i]}), add_and({mn[i-K], mn[i+1]})});
query_number += 3;
}
else
{
add_xor({add_and({mn[i-K], mn[i]})});
query_number += 2;
}
lst2.push_back(query_number);
}
for(int i = K; i < sc.size(); ++i)
{
if(i+1 < sc.size())
{
add_xor({add_and({sc[i-K], sc[i]}), add_and({sc[i-K], sc[i+1]})});
query_number += 3;
}
else
{
add_xor({add_and({sc[i-K], sc[i]})});
query_number += 2;
}
lst2.push_back(query_number);
}
add_and({add_or(lst), add_not(add_or(lst2)));
}
Compilation message
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:48:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = K; i < mn.size(); ++i)
~~^~~~~~~~~~~
vision.cpp:50:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(i + 1 < mn.size())
~~~~~~^~~~~~~~~~~
vision.cpp:62:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = K; i < sc.size(); ++i)
~~^~~~~~~~~~~
vision.cpp:64:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(i+1 < sc.size())
~~~~^~~~~~~~~~~
vision.cpp:78:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = K; i < mn.size(); ++i)
~~^~~~~~~~~~~
vision.cpp:80:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(i + 1 < mn.size())
~~~~~~^~~~~~~~~~~
vision.cpp:92:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = K; i < sc.size(); ++i)
~~^~~~~~~~~~~
vision.cpp:94:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(i+1 < sc.size())
~~~~^~~~~~~~~~~
vision.cpp:106:48: error: expected '}' before ')' token
add_and({add_or(lst), add_not(add_or(lst2)));
^
