# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1749 | ainta | Cave (IOI13_cave) | C++98 | 284 ms | 896 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"
int w[14][5000],F[5000];
void exploreCave(int N)
{
int i,j,t,c,ck;
for(i=0;i<14;i++){
for(j=0;j<N;j++){
if((1<<i)&j)w[i][j]=1;
}
}
for(i=0;i<N;i++){
c=0;
t=tryCombination(w[13]);
ck=(t==i);
for(j=0;j<13;j++){
t=tryCombination(w[j]);
if(t==i && !ck)c+=1<<j;
if(t!=i && ck)c+=1<<j;
}
for(j=0;j<14;j++)
w[j][c]=ck;
F[c]=i;
}
answer(w[0],F);
}
# | 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... |