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"
#define max_N 5005
int kul[max_N], S[max_N], D[max_N];
void degis(int sol, int orta) {
for(int i = sol; i <= orta; i++)
if(!kul[i])
S[i] = (S[i]+1) %2;
}
void exploreCave(int N) {
for(int i = 0; i < N; i++) {
int sol = 0, sag = N-1;
int kapi = tryCombination(S);
int acik = kapi > i || kapi == -1 ? 0: 1;
while(sol != sag) {
int orta = (sol + sag) / 2;
degis(sol, orta);
kapi = tryCombination(S);
int sonra = kapi > i || kapi == -1 ? 0: 1;
degis(sol, orta);
if(sonra != acik)
sag = orta;
else
sol = orta+1;
}
kul[sol] = 0;
S[sol] = acik;
D[sol] = i;
}
answer(S, D);
}
# | 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... |