# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
16070 |
2015-08-15T16:42:53 Z |
ggoh |
Cave (IOI13_cave) |
C++ |
|
177 ms |
516 KB |
#include<cstdio>
#include "cave.h"
void exploreCave(int N)
{
int D[5555]={},S[5555]={},s[5555]={};
bool C[5555]={};
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 |
115 ms |
504 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
177 ms |
452 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
512 KB |
Output is correct |
2 |
Correct |
5 ms |
512 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 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 |
420 KB |
Output is correct |
3 |
Correct |
5 ms |
512 KB |
Output is correct |
4 |
Correct |
5 ms |
384 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 |
Incorrect |
138 ms |
516 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |