This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).begin(), (x).end()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fv(c) for(int (a) = (1); (a) <= (c); (a)++)
#define fz(c) for(int (a) = (0); (a) < (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
#define pb push_back
#define in insert
#define ss second
#define ff first
void exploreCave(int n) {
int v[n], a[n];
set <int> s;
fp(i,0,n)
a[i] = -1, v[i] = 0, s.insert(i);
int x = 0;
fp(i,0,n){
for(auto it : s)
v[it] = x;
int y = tryCombination(v);
if(y == i)
x = (x+1)%2;
int l = 0, r = s.size();
while(l < r){
//cout << x << " ";
int m = (l+r)/2;
int d = 0;
for(auto it : s){
v[it] = (x+1)%2, d ++;
if(d == m)
break;
}
int f = tryCombination(v);
if(f > i || f == -1)
l = m + 1;
else{
for(auto it : s){
v[it] = x, d ++;
if(d == m)
break;
}
r = m;
}
//cout << l << " " << r << "//\n";
}
s.erase(r);
a[r] = i;
/*y = i;
int g;
while(y == i)
{
fp(j,0,n)
if(a[j] == -1 || a[j] == n)
v[j] = (x+1)%2;
fp(j,0,n){
if(a[j] == -1){
v[j] = x, g = j;
break;
}
}
y = tryCombination(v);
if(y == i)
a[g] = n;
}
fp(j,0,n)
if(a[j] == n)
a[j] = -1;
a[g] = i;*/
}
answer(v, a);
}
Compilation message (stderr)
cave.cpp: In function 'void exploreCave(int)':
cave.cpp:10:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
10 | #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
| ^
cave.cpp:24:2: note: in expansion of macro 'fp'
24 | fp(i,0,n)
| ^~
cave.cpp:10:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
10 | #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
| ^
cave.cpp:27:2: note: in expansion of macro 'fp'
27 | fp(i,0,n){
| ^~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |