oj.uz

Submission #16184

# Submission time Handle Problem Language Result Execution time Memory
16184 2015-08-16T05:12:28 Z ggoh Cave (IOI13_cave) C++
0 / 100
 254 ms 512 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,ch,ima;
    for(i=0;i<N;i++)
    {
        p=0;q=N;ch=0;
        for(int j=0;j<N;j++)
        {
            if(C[j])s[j]=S[j];
            else s[j]=0;
        }
        ima=tryCombination(s);
        if(ima!=i)
        {
            for(int j=0;j<N;j++)
            {
                if(C[j])s[j]=S[j];
                else s[j]=1;
            }
            ch=1;
        }
        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-ch;
            }
            ima=tryCombination(s);
            if(ima==-1)ima=N;
            if(ima==i)p=h;
            else q=h;
        }
        S[p]=1-ch;
        D[p]=i;
        C[p]=1;
    }
    answer(S,D);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 512 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 254 ms 504 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 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 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 -

Subtask #4
0 / 30.0

# 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 512 KB Output is correct
5 Incorrect 5 ms 460 KB Answer is wrong
6 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 46 ms 504 KB Answer is wrong
2 Halted 0 ms 0 KB -