oj.uz

Submission #7002

# Submission time Handle Problem Language Result Execution time Memory
7002 2014-07-12T09:05:17 Z gs13068 Cave (IOI13_cave) C++
0 / 100
 498 ms 512 KB 
#include "cave.h"

int S[5000];
int D[5000];
int V[5000];

void exploreCave(int N)
{
	int l,r,m;
	int i,j,k;
    for(i=0;i<N;i++)V[i]=0;
    for(i=0;i<N;i++)
	{
		for(j=0;j<N;j++)if(!V[j])S[j]=0;
        if(tryCombination(S)>i)k=0;
        else k=1;

		l=0;r=N-1;
		while(l<r)
		{
			m=(l+r)/2;
            for(j=0;j<N;j++)if(!V[j])
            {
            	if(j<=m)S[j]=k;
            	else S[j]=!k;
            }
            if(tryCombination(S)>i)r=m;
            else l=m+1;
		}
		S[l]=k;
		D[l]=i;
		V[l]=1;
	}
	answer(S,D);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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