Submission #16328

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
16328	2015-08-21T11:41:15 Z	comet	Cave (IOI13_cave)	C++	25 / 100	349 ms	512 KB

cave

#include <stdio.h>
#include <stdlib.h>
#include <cstring>
#include "cave.h"
int a[5000],b[5000],p,n;
void flip(int L,int R){
	for(int i=L;i<=R;i++){
		if(b[i]<0)a[i]=!a[i];
	}
}
void finish(){
	for(int i=0;i<n;i++){
		if(b[i]<0){
			a[i]=!a[i];
			b[i]=tryCombination(a);
			a[i]=!a[i];
		}
	}
	answer(a,b);
	exit(0);
}
void f(int L,int R,int v){
	if(L==R){
		b[L]=v;
		if(p==v)a[L]=!a[L];
		return;
	}
	int mid=(L+R)/2;
	flip(L,mid);
	int t=tryCombination(a);
	if(t<0)finish();
	flip(L,mid);
	if(p==t)f(mid+1,R,v);
	else f(L,mid,v);
}
void exploreCave(int N){
	n=N;
	memset(b,-1,sizeof(b));
	for(int i=0;i<N;i++){
		p=tryCombination(a);
		if(p<0)finish();
		f(0,N-1,i);
	}
	answer(a,b);
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	137 ms	472 KB	Output is correct
2	Correct	175 ms	384 KB	Output is correct
3	Correct	253 ms	472 KB	Output is correct
4	Correct	210 ms	384 KB	Output is correct
5	Correct	17 ms	384 KB	Output is correct
6	Correct	236 ms	384 KB	Output is correct
7	Correct	338 ms	512 KB	Output is correct
8	Correct	5 ms	512 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	512 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	263 ms	512 KB	Output is correct
13	Correct	226 ms	468 KB	Output is correct
14	Correct	296 ms	512 KB	Output is correct

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	432 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	28 ms	384 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	19 ms	512 KB	Output is correct
7	Correct	27 ms	512 KB	Output is correct
8	Correct	18 ms	384 KB	Output is correct
9	Correct	21 ms	408 KB	Output is correct
10	Correct	17 ms	384 KB	Output is correct
11	Correct	27 ms	384 KB	Output is correct

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	512 KB	Output is correct
2	Correct	6 ms	512 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	460 KB	Output is correct
5	Incorrect	6 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	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	396 KB	Output is correct
4	Correct	5 ms	512 KB	Output is correct
5	Incorrect	6 ms	512 KB	Answer is wrong
6	Halted	0 ms	0 KB	-

Subtask #5

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	157 ms	472 KB	Output is correct
2	Correct	178 ms	472 KB	Output is correct
3	Correct	349 ms	384 KB	Output is correct
4	Correct	190 ms	472 KB	Output is correct
5	Correct	17 ms	384 KB	Output is correct
6	Correct	248 ms	464 KB	Output is correct
7	Correct	346 ms	464 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	512 KB	Output is correct
10	Correct	237 ms	472 KB	Output is correct
11	Correct	250 ms	468 KB	Output is correct
12	Correct	240 ms	512 KB	Output is correct
13	Correct	19 ms	484 KB	Output is correct
14	Correct	6 ms	384 KB	Output is correct
15	Correct	5 ms	460 KB	Output is correct
16	Correct	18 ms	384 KB	Output is correct
17	Correct	16 ms	476 KB	Output is correct
18	Correct	18 ms	384 KB	Output is correct
19	Correct	18 ms	384 KB	Output is correct
20	Correct	19 ms	384 KB	Output is correct
21	Correct	18 ms	384 KB	Output is correct
22	Incorrect	5 ms	384 KB	Answer is wrong
23	Halted	0 ms	0 KB	-