#include <bits/stdc++.h>
#include "dango3.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b){a = b; return true;}
return false;
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b){a = b; return true;}
return false;
}
template <class T>
void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
for(auto i: a) out << i << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
void Solve(int n, int m){
vector<bool> check(n*m+1);
for(int iteration = 1; iteration<=m; ++iteration){
int l = 1, r = n * m;
while(l < r){
int mid = (l + r) >> 1;
vector<int> S;
for(int i= 1; i<=mid; ++i) if (!check(i)) S.push_back(i);
if (S.size() < n || Query(S) == 0) l = mid + 1;
else r = mid;
}
int x = l;
vector<int> cur_dango, not_dango;
for(int i = 1; i<=x; ++i) if (check[i] == 0){
check[i] = 1;
vector<int> S;
for(int j = 1; j <= x; ++j) if (check[j] == 0) S.push_back(j);
if (Query(S) == 0){
check[i] = 0;
cur_dango.push_back(i);
}
else not_dango.push_back(i);
}
for(int i: not_dango) check[i] = 0;
for(int i: cur_dango) check[i] = 1;
Answer(cur_dango);
}
}
// int main(void){
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// return 0;
// }
Compilation message
dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:54:52: error: no match for call to '(std::vector<bool>) (int&)'
54 | for(int i= 1; i<=mid; ++i) if (!check(i)) S.push_back(i);
| ^
dango3.cpp:55:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
55 | if (S.size() < n || Query(S) == 0) l = mid + 1;
| ~~~~~~~~~^~~
