#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
//const int N = 1e6+5, inf = 1e16, mod = 1e9+7;
template <class F, class _S>
bool chmin(F &u, const _S &v){
bool flag = false;
if ( u > v ){
u = v; flag |= true;
}
return flag;
}
template <class F, class _S>
bool chmax(F &u, const _S &v){
bool flag = false;
if ( u < v ){
u = v; flag |= true;
}
return flag;
}
void solve(int n, int l){
vector<int> ord, pos(n+1), p(n+1, 0);
for(int i = 1; i < n; i++){
ord.pb(query(1, i));
}
for(int i = 0; i < n-1; i++){
pos[ord[i]] = i+1;
}
for(int i = 0; i < n-1; i++){
if(p[ord[i]])continue;
for(int k = 1; k < n-1; i++){
int v = query(ord[i], k);
if(pos[v] < pos[ord[i]]){
p[ord[i]]= v;
break;
}
else {
p[v] = ord[i];
}
}
}
for(int i = 2; i <= n; i++)answer(i, p[i]);
};
//signed main(){
//ios_base::sync_with_stdio(false);
//cin.tie(nullptr);
//cout.tie(nullptr);
//int tt = 1;
//cin >> tt;
//while(tt--){
//solve();
//}
//}
Compilation message
island.cpp: In function 'void solve(int, int)':
island.cpp:37:10: error: 'query' was not declared in this scope
37 | ord.pb(query(1, i));
| ^~~~~
island.cpp:46:12: error: 'query' was not declared in this scope
46 | int v = query(ord[i], k);
| ^~~~~
island.cpp:56:29: error: 'answer' was not declared in this scope
56 | for(int i = 2; i <= n; i++)answer(i, p[i]);
| ^~~~~~
