Submission #4479

# Submission time Handle Problem Language Result Execution time Memory
4479 2013-10-08T11:39:29 Z pichulia Cave (IOI13_cave) C++
100 / 100
470 ms 520 KB
#include "cave.h"
#include<stdio.h>

static int sw[5005];
static int de[5005];
void exploreCave(int N) {
	int i, j;
	int l, r, m;
	int s[5005];
	for(i=0; i<N;i++)
	{
		sw[i] = -1;
		s[i] = 1;
		de[i] = -1;
	}
	int result1;
	int result2;
	for(i=0; i<N; i++)
	{
		l=0;r=N-1;
		for(j=0;j<N;j++)
		{
			if(sw[j]==-1)
				s[j]=1;
			else
				s[j]=sw[j];
		}
		result1 = tryCombination(s);
		if(result1 == i)
		{
		for(j=0;j<N;j++)
		{
			if(sw[j]==-1)
				s[j]=0;
			else
				s[j]=sw[j];
		}
		}
		while(l<r)
		{
			m=(l+r)/2;
			for(j=l;j<=m;j++)
			{
				if(sw[j]==-1)
					s[j]^=1;
				else
					s[j]=sw[j];
			}
			result2 = tryCombination(s);

//			for(j=l;j<=r;j++)
//				printf("%d",s[j]);
//			printf("\n");
//			printf("%d %d %d, %d %d\n",l,m,r, result1,result2);

			if(result2!=i)
			{
				l=m+1;
			}
			else
			{
				for(j=l;j<=m;j++)
				{
					if(sw[j]==-1)
						s[j]^=1;
					else
						s[j]=sw[j];
				}
				r=m;
			}
		}
//		printf("%d\n",l);
//		result1 = tryCombination(s);
//		printf("%d ",result1);
		sw[l] = s[l];
		

		de[l] = i;
	}
//	printf("%d\n",tryCombination(sw));
	answer(sw, de);
}
# Verdict Execution time Memory Grader output
1 Correct 163 ms 512 KB Output is correct
2 Correct 181 ms 504 KB Output is correct
3 Correct 345 ms 504 KB Output is correct
4 Correct 208 ms 512 KB Output is correct
5 Correct 349 ms 512 KB Output is correct
6 Correct 300 ms 488 KB Output is correct
7 Correct 319 ms 456 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 460 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 253 ms 384 KB Output is correct
13 Correct 323 ms 512 KB Output is correct
14 Correct 277 ms 496 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 293 ms 512 KB Output is correct
2 Correct 6 ms 456 KB Output is correct
3 Correct 296 ms 512 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 356 ms 496 KB Output is correct
7 Correct 292 ms 512 KB Output is correct
8 Correct 321 ms 504 KB Output is correct
9 Correct 393 ms 492 KB Output is correct
10 Correct 362 ms 492 KB Output is correct
11 Correct 284 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 396 KB Output is correct
6 Correct 6 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 5 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 400 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 47 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 352 KB Output is correct
9 Correct 51 ms 448 KB Output is correct
10 Correct 51 ms 448 KB Output is correct
11 Correct 61 ms 384 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 42 ms 332 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 62 ms 452 KB Output is correct
17 Correct 49 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 61 ms 512 KB Output is correct
22 Correct 58 ms 512 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 192 ms 520 KB Output is correct
2 Correct 146 ms 504 KB Output is correct
3 Correct 335 ms 492 KB Output is correct
4 Correct 219 ms 512 KB Output is correct
5 Correct 350 ms 508 KB Output is correct
6 Correct 287 ms 492 KB Output is correct
7 Correct 470 ms 488 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 452 KB Output is correct
10 Correct 284 ms 492 KB Output is correct
11 Correct 242 ms 492 KB Output is correct
12 Correct 214 ms 520 KB Output is correct
13 Correct 229 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 397 ms 492 KB Output is correct
17 Correct 223 ms 492 KB Output is correct
18 Correct 387 ms 488 KB Output is correct
19 Correct 338 ms 512 KB Output is correct
20 Correct 385 ms 512 KB Output is correct
21 Correct 362 ms 512 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 50 ms 512 KB Output is correct
24 Correct 315 ms 508 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 69 ms 396 KB Output is correct
28 Correct 64 ms 384 KB Output is correct
29 Correct 54 ms 448 KB Output is correct
30 Correct 354 ms 512 KB Output is correct
31 Correct 353 ms 512 KB Output is correct
32 Correct 379 ms 492 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 277 ms 488 KB Output is correct
36 Correct 45 ms 384 KB Output is correct
37 Correct 267 ms 492 KB Output is correct
38 Correct 6 ms 396 KB Output is correct
39 Correct 65 ms 384 KB Output is correct
40 Correct 49 ms 396 KB Output is correct
41 Correct 310 ms 512 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 6 ms 396 KB Output is correct
45 Correct 48 ms 452 KB Output is correct
46 Correct 49 ms 384 KB Output is correct
47 Correct 299 ms 384 KB Output is correct
48 Correct 356 ms 492 KB Output is correct
49 Correct 5 ms 512 KB Output is correct