Submission #29850

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
29850	2017-07-21T08:46:37 Z	ozaslan	Cave (IOI13_cave)	C++14	46 / 100	74 ms	524 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 == -1) {
		
			for (int j = 0; j < N; j++) {
				S[j] = (S[j] + 1) % 2;
				kapi = tryCombination(S);
				D[j] = kapi;
				S[j] = (S[j] + 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	53 ms	512 KB	Output is correct
2	Correct	29 ms	524 KB	Output is correct
3	Correct	39 ms	484 KB	Output is correct
4	Correct	42 ms	492 KB	Output is correct
5	Correct	17 ms	384 KB	Output is correct
6	Correct	48 ms	384 KB	Output is correct
7	Correct	74 ms	472 KB	Output is correct
8	Correct	5 ms	452 KB	Output is correct
9	Correct	5 ms	512 KB	Output is correct
10	Correct	6 ms	512 KB	Output is correct
11	Correct	5 ms	512 KB	Output is correct
12	Correct	60 ms	484 KB	Output is correct
13	Correct	49 ms	480 KB	Output is correct
14	Correct	56 ms	520 KB	Output is correct

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	460 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	23 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	6 ms	384 KB	Output is correct
6	Correct	21 ms	460 KB	Output is correct
7	Correct	17 ms	384 KB	Output is correct
8	Correct	18 ms	452 KB	Output is correct
9	Correct	18 ms	468 KB	Output is correct
10	Correct	31 ms	384 KB	Output is correct
11	Correct	18 ms	384 KB	Output is correct

Subtask #3

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	512 KB	Output is correct
2	Correct	6 ms	384 KB	Output is correct
3	Correct	5 ms	512 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	6 ms	512 KB	Output is correct
6	Correct	6 ms	512 KB	Output is correct
7	Correct	6 ms	512 KB	Output is correct
8	Correct	6 ms	384 KB	Output is correct
9	Correct	5 ms	396 KB	Output is correct
10	Correct	7 ms	384 KB	Output is correct
11	Correct	5 ms	452 KB	Output is correct
12	Correct	6 ms	384 KB	Output is correct
13	Correct	6 ms	512 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	512 KB	Output is correct
2	Correct	6 ms	384 KB	Output is correct
3	Correct	5 ms	512 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	6 ms	512 KB	Output is correct
6	Correct	6 ms	512 KB	Output is correct
7	Correct	6 ms	512 KB	Output is correct
8	Correct	6 ms	384 KB	Output is correct
9	Correct	5 ms	396 KB	Output is correct
10	Correct	7 ms	384 KB	Output is correct
11	Correct	5 ms	452 KB	Output is correct
12	Correct	6 ms	384 KB	Output is correct
13	Correct	6 ms	512 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	396 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	6 ms	512 KB	Output is correct
19	Correct	6 ms	396 KB	Output is correct
20	Incorrect	9 ms	512 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	53 ms	512 KB	Output is correct
2	Correct	29 ms	524 KB	Output is correct
3	Correct	39 ms	484 KB	Output is correct
4	Correct	42 ms	492 KB	Output is correct
5	Correct	17 ms	384 KB	Output is correct
6	Correct	48 ms	384 KB	Output is correct
7	Correct	74 ms	472 KB	Output is correct
8	Correct	5 ms	452 KB	Output is correct
9	Correct	5 ms	512 KB	Output is correct
10	Correct	6 ms	512 KB	Output is correct
11	Correct	5 ms	512 KB	Output is correct
12	Correct	60 ms	484 KB	Output is correct
13	Correct	49 ms	480 KB	Output is correct
14	Correct	56 ms	520 KB	Output is correct
15	Correct	18 ms	460 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	23 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	6 ms	384 KB	Output is correct
20	Correct	21 ms	460 KB	Output is correct
21	Correct	17 ms	384 KB	Output is correct
22	Correct	18 ms	452 KB	Output is correct
23	Correct	18 ms	468 KB	Output is correct
24	Correct	31 ms	384 KB	Output is correct
25	Correct	18 ms	384 KB	Output is correct
26	Correct	5 ms	512 KB	Output is correct
27	Correct	6 ms	384 KB	Output is correct
28	Correct	5 ms	512 KB	Output is correct
29	Correct	6 ms	512 KB	Output is correct
30	Correct	6 ms	512 KB	Output is correct
31	Correct	6 ms	512 KB	Output is correct
32	Correct	6 ms	512 KB	Output is correct
33	Correct	6 ms	384 KB	Output is correct
34	Correct	5 ms	396 KB	Output is correct
35	Correct	7 ms	384 KB	Output is correct
36	Correct	5 ms	452 KB	Output is correct
37	Correct	6 ms	384 KB	Output is correct
38	Correct	6 ms	512 KB	Output is correct
39	Correct	5 ms	384 KB	Output is correct
40	Correct	5 ms	384 KB	Output is correct
41	Correct	6 ms	396 KB	Output is correct
42	Correct	5 ms	384 KB	Output is correct
43	Correct	6 ms	512 KB	Output is correct
44	Correct	6 ms	396 KB	Output is correct
45	Incorrect	9 ms	512 KB	too much calls on tryCombination()
46	Halted	0 ms	0 KB	-