Submission #81032

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
81032	2018-10-23T14:54:29 Z	arman_ferdous	Cave (IOI13_cave)	C++17	34 / 100	62 ms	612 KB

cave

#include <bits/stdc++.h>
#include "cave.h"
using namespace std;

void exploreCave(int N) {
    int S[N], D[N];
    memset(S,0,sizeof S);
    for(;;) {
    	int bad = tryCombination(S);
    	if(bad == -1) break;
    	for(int i = 0; i < N; i++) {
    		S[i] ^= 1;
    		int door = tryCombination(S);
    		if(door == -1 || door > bad) break;
    		S[i] ^= 1;
    	}
    }
    for(int i = 0; i < N; i++) {
    	S[i] ^= 1;
    	int door = tryCombination(S);
    	S[i] ^= 1;
    	D[i] = door;
    } answer(S,D);
}

Subtask #1

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	62 ms	512 KB	too much calls on tryCombination()
2	Halted	0 ms	0 KB	-

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	420 KB	Output is correct
2	Correct	5 ms	512 KB	Output is correct
3	Correct	21 ms	496 KB	Output is correct
4	Correct	6 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	23 ms	516 KB	Output is correct
7	Correct	26 ms	512 KB	Output is correct
8	Correct	28 ms	480 KB	Output is correct
9	Correct	25 ms	384 KB	Output is correct
10	Correct	28 ms	472 KB	Output is correct
11	Correct	23 ms	612 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	6 ms	384 KB	Output is correct
3	Correct	5 ms	512 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	512 KB	Output is correct
6	Correct	5 ms	512 KB	Output is correct
7	Correct	6 ms	384 KB	Output is correct
8	Correct	5 ms	512 KB	Output is correct
9	Correct	6 ms	452 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	6 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 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	384 KB	Output is correct
2	Correct	6 ms	384 KB	Output is correct
3	Correct	5 ms	512 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	512 KB	Output is correct
6	Correct	5 ms	512 KB	Output is correct
7	Correct	6 ms	384 KB	Output is correct
8	Correct	5 ms	512 KB	Output is correct
9	Correct	6 ms	452 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	6 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	512 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	6 ms	460 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	512 KB	Output is correct
18	Correct	6 ms	384 KB	Output is correct
19	Correct	6 ms	384 KB	Output is correct
20	Incorrect	8 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	Incorrect	62 ms	512 KB	too much calls on tryCombination()
2	Halted	0 ms	0 KB	-