#include "voltage.h"
using namespace std;
bool checkIsLeaf(int val, int n, vector < int >& s) {
vector < int > a(n, 1), b(n, 0);
for(auto x: s) {
a[x] = 0;
}
a[val] = 0;
int tmp = query(a, b);
return (query(a, b) == 0);
}
bool solve(int N, int M) {
vector < int > s;
vector < bool > inSet(N, false);
vector < pair < int, int > > res;
vector < int > tmp;
for(int i = 0; i < N; i++) {
if(checkIsLeaf(i, N, s)) tmp.push_back(i);
}
if(tmp.size() == 0) return false;
s = tmp;
while(s.size() != N) {
vector < int > a;
for(int i = 0; i < N; i++) if(!inSet[i]) a.push_back(i);
int L = -1, R = a.size();
while(R - L > 1) {
int mid = (L + R) >> 1;
vector < int > v1(N, 0), v2(N, 0);
for(int i = 0; i < mid; i++) {
v1[i] = 1; v2[i] = 1;
}
for(int i = mid; i < N; i++) {
v1[i] = 0; v2[i] = 0;
}
for(auto x: s) {
v1[x] = 0;
v2[x] = 1;
}
if(query(v1, v2) == 0) R = mid;
else L = mid;
}
int x = R;
if(x == a.size()) return false;
if(checkIsLeaf(x, N, s)) {
vector < int > prev(N, 1);
vector < int > curr(N, 1);
for(auto x: s) {
prev[x] = 0;
curr[x] = 0;
}
prev[x] = 0; curr[x] = 0;
for(int j = s.size() - 1; j >= 0; j--) {
curr[s[j]] = 1;
if(query(curr, prev) == -1) {
res.push_back({s[j], x});
}
prev = curr;
}
s.push_back(x);
inSet[x] = true;
}
else return false;
}
for(auto x: res) answer(x.first, x.second);
return true;
}
