Submission #16331

# Submission time Handle Problem Language Result Execution time Memory
16331 2015-08-21T11:57:35 Z comet Cave (IOI13_cave) C++
100 / 100
397 ms 604 KB
#include <stdio.h>
#include <stdlib.h>
#include <cstring>
#include "cave.h"
int a[5000],b[5000],p,n;
bool flip(int L,int R){
	bool ret=0;
	for(int i=L;i<=R;i++){
		if(b[i]<0)a[i]=!a[i],ret=1;
	}
	return ret;
}
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){
	//printf("%d %d %d\n",L,R,v);
	if(L==R){
		b[L]=v;
		if(p==v)a[L]=!a[L];
		return;
	}
	int mid=(L+R)/2;
	if(!flip(L,mid)){
		f(mid+1,R,v);
		return;
	}
	int t=tryCombination(a);
	//printf("p=%d  t=%d\n",p,t);
	if(t<0){
		finish();
		return;
	}
	flip(L,mid);
	if((p!=v&&t!=v)||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++){
		/*printf("%d\n",i);
		for(int j=0;j<N;j++)printf("%d ",a[j]);puts("");
		for(int j=0;j<N;j++)printf("%d ",b[j]);puts("");*/

		p=tryCombination(a);
		if(p<0)finish();
		f(0,N-1,i);
	}
	answer(a,b);
}
# Verdict Execution time Memory Grader output
1 Correct 114 ms 468 KB Output is correct
2 Correct 108 ms 472 KB Output is correct
3 Correct 217 ms 384 KB Output is correct
4 Correct 108 ms 452 KB Output is correct
5 Correct 20 ms 512 KB Output is correct
6 Correct 166 ms 476 KB Output is correct
7 Correct 152 ms 468 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 384 KB Output is correct
11 Correct 5 ms 452 KB Output is correct
12 Correct 202 ms 384 KB Output is correct
13 Correct 176 ms 512 KB Output is correct
14 Correct 182 ms 464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 20 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 396 KB Output is correct
6 Correct 17 ms 384 KB Output is correct
7 Correct 19 ms 468 KB Output is correct
8 Correct 18 ms 384 KB Output is correct
9 Correct 28 ms 480 KB Output is correct
10 Correct 27 ms 384 KB Output is correct
11 Correct 27 ms 472 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 5 ms 452 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 460 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
# 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 420 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 51 ms 512 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 52 ms 440 KB Output is correct
10 Correct 63 ms 512 KB Output is correct
11 Correct 46 ms 444 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 35 ms 384 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 46 ms 384 KB Output is correct
17 Correct 53 ms 448 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 332 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 49 ms 384 KB Output is correct
22 Correct 57 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 116 ms 476 KB Output is correct
2 Correct 91 ms 420 KB Output is correct
3 Correct 177 ms 512 KB Output is correct
4 Correct 106 ms 512 KB Output is correct
5 Correct 21 ms 472 KB Output is correct
6 Correct 149 ms 512 KB Output is correct
7 Correct 200 ms 512 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 150 ms 384 KB Output is correct
11 Correct 158 ms 464 KB Output is correct
12 Correct 160 ms 480 KB Output is correct
13 Correct 17 ms 512 KB Output is correct
14 Correct 5 ms 452 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 25 ms 512 KB Output is correct
17 Correct 21 ms 512 KB Output is correct
18 Correct 23 ms 384 KB Output is correct
19 Correct 20 ms 604 KB Output is correct
20 Correct 29 ms 384 KB Output is correct
21 Correct 22 ms 396 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 60 ms 480 KB Output is correct
24 Correct 274 ms 472 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 72 ms 444 KB Output is correct
28 Correct 50 ms 384 KB Output is correct
29 Correct 46 ms 444 KB Output is correct
30 Correct 372 ms 476 KB Output is correct
31 Correct 373 ms 476 KB Output is correct
32 Correct 396 ms 476 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 6 ms 452 KB Output is correct
35 Correct 203 ms 512 KB Output is correct
36 Correct 30 ms 512 KB Output is correct
37 Correct 197 ms 472 KB Output is correct
38 Correct 6 ms 384 KB Output is correct
39 Correct 35 ms 384 KB Output is correct
40 Correct 63 ms 444 KB Output is correct
41 Correct 247 ms 384 KB Output is correct
42 Correct 5 ms 324 KB Output is correct
43 Correct 6 ms 512 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 45 ms 396 KB Output is correct
46 Correct 46 ms 384 KB Output is correct
47 Correct 309 ms 472 KB Output is correct
48 Correct 397 ms 472 KB Output is correct
49 Correct 5 ms 384 KB Output is correct