#include "cave.h" #include <iostream> #include <vector> #include <map> #include <algorithm> #include <limits.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<bool> vb; typedef vector<double> vd; typedef vector<string> vs; typedef vector<char> vc; typedef vector<vi> vvi; typedef pair<int,int> pii; typedef vector<pii> vii; typedef map<int, int> mii; typedef vector<vl> vvl; typedef pair<ll, ll> pll; typedef vector<pll> vpl; #define mod 1000000007 #define inf 10000000000000 #define F first #define S second #define nd '\n' #define forn(i, x, n) for (int i = x; i < int(n); i++) #define fornl(i, x, n) for(int i = x; i >= int(n); i--) #define fnd(x, y) find(x.begin(), x.end(), y) #define srt(x) sort(x.begin(), x.end()) #define debug(x) cout << #x << " = " << x << nd; #define debugv(x, s) cout << #x << " = "; forn(i, 0, s) cout << x[i] << " "; cout << nd; #define fastio ios_base::sync_with_stdio(false), cin.tie(0); #define freop(in, out) freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); #define rmod(a, b) (a % mod - b % mod + mod) % mod #define smod(a, b) (a % mod + b % mod) % mod #define mmod(a, b) (a % mod) * (b % mod) % mod #define yes cout << "YES" << nd #define no cout << "NO" << nd #define pb push_back #define all(x) x.begin(), x.end() void exploreCave(int n) { int idx[n]; int pos[n]; forn(i, 0, n) pos[i] = 0; vi b(n); forn(i, 0, n){ ll x = tryCombination(pos); if(x == -1) break; forn(j, 0, n){ if(!pos[j] && !b[j]){ pos[j] = 1; ll y = tryCombination(pos); pos[j] = 0; if(y > x || y == -1){pos[j] = 1; break;} else if(y < x) b[j] = 1 } } } forn(i, 0, n){ pos[i] = 1 - pos[i]; ll x = tryCombination(pos); pos[i] = 1 - pos[i]; idx[i] = x; } answer(pos, idx); }

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:59:40: error: expected ';' before '}' token
   59 |                 else if(y < x) b[j] = 1
      |                                        ^
      |                                        ;
   60 |             }
      |             ~