oj.uz

Submission #1780

# Submission time Handle Problem Language Result Execution time Memory
1780 2013-07-15T10:18:16 Z kriii Cave (IOI13_cave) C++
100 / 100
 435 ms 628 KB 
#include "cave.h"

int S[5050],D[5050],C[5050];

int norm(int x, int n){if (x < 0) x += n + 1; return x;}

void exploreCave(int N) {
	int i,j,l,r,m,prev,next;

	for (i=0;i<N;i++) S[i] = 0, C[i] = 1;

	for (i=0;i<N;i++){
		l = 0; r = N-1;
		prev = norm(tryCombination(S),N);
		while (l < r){
			m = (l + r) / 2;
			for (j=l;j<=m;j++) S[j] ^= C[j];
			next = norm(tryCombination(S),N);
			for (j=l;j<=m;j++) S[j] ^= C[j];
			if (prev > i){
				if (next > i) l = m + 1;
				else r = m;
			}
			else{
				if (next > i) r = m;
				else l = m + 1;
			}
		}
		if (prev <= i) S[l] = !S[l];
		D[l] = i; C[l] = 0;
	}

	answer(S,D);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 492 KB Output is correct
2 Correct 168 ms 456 KB Output is correct
3 Correct 319 ms 628 KB Output is correct
4 Correct 154 ms 504 KB Output is correct
5 Correct 435 ms 520 KB Output is correct
6 Correct 266 ms 384 KB Output is correct
7 Correct 305 ms 512 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 460 KB Output is correct
11 Correct 6 ms 396 KB Output is correct
12 Correct 293 ms 512 KB Output is correct
13 Correct 236 ms 484 KB Output is correct
14 Correct 233 ms 516 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 391 ms 488 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 314 ms 496 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 296 KB Output is correct
6 Correct 251 ms 520 KB Output is correct
7 Correct 269 ms 512 KB Output is correct
8 Correct 352 ms 512 KB Output is correct
9 Correct 368 ms 496 KB Output is correct
10 Correct 293 ms 520 KB Output is correct
11 Correct 257 ms 480 KB Output is correct

Subtask #3
21.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 6 ms 384 KB Output is correct
4 Correct 5 ms 384 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 512 KB Output is correct
8 Correct 5 ms 332 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 396 KB Output is correct
11 Correct 5 ms 396 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 460 KB Output is correct
14 Correct 5 ms 384 KB Output is correct

Subtask #4
30.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 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 45 ms 452 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 5 ms 396 KB Output is correct
9 Correct 48 ms 460 KB Output is correct
10 Correct 38 ms 448 KB Output is correct
11 Correct 44 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 49 ms 384 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 53 ms 444 KB Output is correct
17 Correct 39 ms 384 KB Output is correct
18 Correct 6 ms 332 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 48 ms 504 KB Output is correct
22 Correct 42 ms 452 KB Output is correct
23 Correct 5 ms 384 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 512 KB Output is correct
2 Correct 168 ms 500 KB Output is correct
3 Correct 257 ms 496 KB Output is correct
4 Correct 203 ms 524 KB Output is correct
5 Correct 393 ms 496 KB Output is correct
6 Correct 235 ms 496 KB Output is correct
7 Correct 392 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 253 ms 512 KB Output is correct
11 Correct 222 ms 512 KB Output is correct
12 Correct 265 ms 500 KB Output is correct
13 Correct 284 ms 516 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 6 ms 332 KB Output is correct
16 Correct 315 ms 492 KB Output is correct
17 Correct 275 ms 492 KB Output is correct
18 Correct 225 ms 496 KB Output is correct
19 Correct 345 ms 556 KB Output is correct
20 Correct 274 ms 512 KB Output is correct
21 Correct 254 ms 516 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 36 ms 444 KB Output is correct
24 Correct 336 ms 512 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 43 ms 444 KB Output is correct
28 Correct 46 ms 384 KB Output is correct
29 Correct 49 ms 444 KB Output is correct
30 Correct 294 ms 492 KB Output is correct
31 Correct 329 ms 496 KB Output is correct
32 Correct 298 ms 496 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 6 ms 512 KB Output is correct
35 Correct 240 ms 512 KB Output is correct
36 Correct 53 ms 452 KB Output is correct
37 Correct 258 ms 500 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 35 ms 456 KB Output is correct
40 Correct 42 ms 384 KB Output is correct
41 Correct 218 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 5 ms 384 KB Output is correct
45 Correct 43 ms 452 KB Output is correct
46 Correct 40 ms 512 KB Output is correct
47 Correct 234 ms 384 KB Output is correct
48 Correct 366 ms 512 KB Output is correct
49 Correct 5 ms 512 KB Output is correct