# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701152 | mychecksedad | Cave (IOI13_cave) | C++17 | 443 ms | 424 KiB |
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;
void exploreCave(int N) {
int s[N], a[N], b[N];
vector<bool> vis(N, 0);
for(int i = 0; i < N; ++i){
for(int j = 0; j < N; ++j) if(!vis[j]) s[j] = 0;
int f = tryCombination(s);
if(f > i){
a[i] = 0;
}else{
a[i] = 1;
}
int l = 0, r = N - i - 1;
b[i] = i;
while(l <= r){
int mid = l+r>>1;
for(int i = 0, c = 0; i < N; ++i){
if(!vis[i]){
if(c >= l && c < mid)
s[i] = !a[i];
else if(c >= mid && c <= r)
s[i] = a[i];
c++;
}
}
int f = tryCombination(s);
if(f > i){
b[i] = mid;
l = mid + 1;
}else{
r = mid - 1;
}
}
s[b[i]] = a[i];
vis[b[i]] = 1;
}
answer(a, b);
}
Compilation message (stderr)
# | 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... |