# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
16067 |
2015-08-15T12:39:33 Z |
ggoh |
Cave (IOI13_cave) |
C++ |
|
194 ms |
524 KB |
#include<cstdio>
#include "cave.h"
int D[5555],S[5555],s[5555];
bool C[5555];
void exploreCave(int N)
{
int i,p,q,h,back,ima;
for(i=0;i<N;i++)
{
p=0;q=N;
for(int j=0;j<N/2;j++)
{
if(C[j])s[j]=S[j];
else s[j]=0;
}
back=tryCombination(s);
if(back==-1)back=N;
while(p!=q-1)
{
h=(p+q)/2;
for(int j=p;j<h;j++)
{
if(C[j])s[j]=S[j];
else s[j]=1-s[j];
}
ima=tryCombination(s);
if(ima==-1)ima=N;
if((ima>i&&back>i)||(ima==i&&back==i))
{
back=ima;
p=h;
}
else
{
back=ima;
q=h;
}
}
if(back==i)S[p]=1-s[p];
else S[p]=s[p];
D[p]=i;
C[p]=1;
}
answer(S,D);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
173 ms |
476 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
194 ms |
524 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
396 KB |
Output is correct |
5 |
Incorrect |
5 ms |
384 KB |
Answer is wrong |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
512 KB |
Output is correct |
3 |
Correct |
5 ms |
460 KB |
Output is correct |
4 |
Correct |
5 ms |
332 KB |
Output is correct |
5 |
Incorrect |
6 ms |
384 KB |
Answer is wrong |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
127 ms |
472 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |