Submission #29844

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
29844	2017-07-21T08:28:08 Z	ozaslan	Cave (IOI13_cave)	C++14	33 / 100	235 ms	516 KB

cave

#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 != 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	46 ms	516 KB	Output is correct
2	Correct	32 ms	468 KB	Output is correct
3	Correct	34 ms	464 KB	Output is correct
4	Correct	42 ms	512 KB	Output is correct
5	Correct	54 ms	512 KB	Output is correct
6	Correct	62 ms	480 KB	Output is correct
7	Correct	74 ms	384 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	37 ms	480 KB	Output is correct
13	Correct	49 ms	512 KB	Output is correct
14	Correct	50 ms	516 KB	Output is correct

Subtask #2

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	67 ms	468 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Incorrect	235 ms	476 KB	too much calls on tryCombination()
4	Halted	0 ms	0 KB	-

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	384 KB	Output is correct
3	Correct	6 ms	512 KB	Output is correct
4	Correct	5 ms	396 KB	Output is correct
5	Correct	6 ms	384 KB	Output is correct
6	Correct	6 ms	512 KB	Output is correct
7	Correct	5 ms	432 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	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	6 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct

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	6 ms	512 KB	Output is correct
4	Correct	5 ms	396 KB	Output is correct
5	Correct	6 ms	384 KB	Output is correct
6	Correct	6 ms	512 KB	Output is correct
7	Correct	5 ms	432 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	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	6 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	6 ms	384 KB	Output is correct
17	Correct	5 ms	464 KB	Output is correct
18	Correct	5 ms	452 KB	Output is correct
19	Correct	5 ms	512 KB	Output is correct
20	Incorrect	9 ms	384 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	46 ms	516 KB	Output is correct
2	Correct	32 ms	468 KB	Output is correct
3	Correct	34 ms	464 KB	Output is correct
4	Correct	42 ms	512 KB	Output is correct
5	Correct	54 ms	512 KB	Output is correct
6	Correct	62 ms	480 KB	Output is correct
7	Correct	74 ms	384 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	37 ms	480 KB	Output is correct
13	Correct	49 ms	512 KB	Output is correct
14	Correct	50 ms	516 KB	Output is correct
15	Correct	67 ms	468 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Incorrect	235 ms	476 KB	too much calls on tryCombination()
18	Halted	0 ms	0 KB	-