oj.uz

Submission #29848

# Submission time Handle Problem Language Result Execution time Memory
29848 2017-07-21T08:41:20 Z ozaslan Cave (IOI13_cave) C++14
46 / 100
 98 ms 584 KB 
#include "cave.h"
#define max_N 5005

int kul[max_N], S[max_N], D[max_N];

void exploreCave(int N) {

	for (int i = 0; i < N; i++) {
		int kapi = tryCombination(S);

		if (kapi == -1) {
		
			for (int i = 0; i < N; i++) {
				S[i] = (S[i] + 1) % 2;
				kapi = tryCombination(S);
				D[i] = kapi;
				S[i] = (S[i] + 1) % 2;
			}
			answer(S, D);		
		}

		else if(kapi > i) {
			for (int j = 0; j < N; j++)
				if (!kul[j]) {
					S[j] = 1;
					kapi = tryCombination(S);
					if (kapi == i) {
						S[j] = 0;
						D[j] = i;
						kul[j] = 1;
						break;
					}
					else
						S[j] = 0;
				}

		}
		else 
			for (int j = 0; j < N; j++)
				if (!kul[j]) {
					S[j] = 1;
					kapi = tryCombination(S);
					if (kapi > i || kapi == -1) {
						D[j] = i;
						kul[j] = 1;
						break;
					}
					else
						S[j] = 0;
				}

	}

	answer(S, D);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 460 KB Output is correct
2 Correct 41 ms 384 KB Output is correct
3 Correct 59 ms 384 KB Output is correct
4 Correct 40 ms 384 KB Output is correct
5 Correct 20 ms 432 KB Output is correct
6 Correct 56 ms 476 KB Output is correct
7 Correct 98 ms 468 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 368 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 432 KB Output is correct
12 Correct 81 ms 384 KB Output is correct
13 Correct 61 ms 384 KB Output is correct
14 Correct 68 ms 456 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 460 KB Output is correct
2 Correct 5 ms 360 KB Output is correct
3 Correct 27 ms 424 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 27 ms 384 KB Output is correct
7 Correct 27 ms 384 KB Output is correct
8 Correct 28 ms 476 KB Output is correct
9 Correct 29 ms 384 KB Output is correct
10 Correct 28 ms 384 KB Output is correct
11 Correct 19 ms 584 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 304 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 256 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 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 276 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 304 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 256 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 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 276 KB Output is correct
15 Correct 6 ms 432 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 324 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Incorrect 9 ms 360 KB too much calls on tryCombination()
21 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 460 KB Output is correct
2 Correct 41 ms 384 KB Output is correct
3 Correct 59 ms 384 KB Output is correct
4 Correct 40 ms 384 KB Output is correct
5 Correct 20 ms 432 KB Output is correct
6 Correct 56 ms 476 KB Output is correct
7 Correct 98 ms 468 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 368 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 432 KB Output is correct
12 Correct 81 ms 384 KB Output is correct
13 Correct 61 ms 384 KB Output is correct
14 Correct 68 ms 456 KB Output is correct
15 Correct 25 ms 460 KB Output is correct
16 Correct 5 ms 360 KB Output is correct
17 Correct 27 ms 424 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 27 ms 384 KB Output is correct
21 Correct 27 ms 384 KB Output is correct
22 Correct 28 ms 476 KB Output is correct
23 Correct 29 ms 384 KB Output is correct
24 Correct 28 ms 384 KB Output is correct
25 Correct 19 ms 584 KB Output is correct
26 Correct 5 ms 304 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 4 ms 256 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 5 ms 256 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 256 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Correct 6 ms 384 KB Output is correct
39 Correct 5 ms 276 KB Output is correct
40 Correct 6 ms 432 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 5 ms 324 KB Output is correct
43 Correct 5 ms 256 KB Output is correct
44 Correct 6 ms 384 KB Output is correct
45 Incorrect 9 ms 360 KB too much calls on tryCombination()
46 Halted 0 ms 0 KB -