Submission #317191

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
317191	2020-10-29T05:15:28 Z	seedkin	Cave (IOI13_cave)	C	100 / 100	1054 ms	892 KB

cave

#include "cave.h"

int open[5005]; // index = switch number return = 1, 0 ( open value )
int target[5005]; // index = switch number return = door number

int S[5005]; // index == switch number return = 1, 0 ( open Value request)
int door[5005]; // index = door 번호 return 1, 0 (1 == open, 0 == close);

void exploreCave(int N) {
    for(int i =0; i < N; i++) {
        open[i] = -1;
        target[i] = -1;        
    }

    for(int i = 0; i < N; i++) { // door number
        for(int j = 0; j < N; j++) { // switch number
            if(open[j] != -1) {
                S[j] = open[j];
            } else {
                S[j] = 1;
            }
        }
        int ans = tryCombination(S);
        if (ans > i || ans == -1) door[i] = 1;
        else door[i] = 0;

        int low = 0;
        int high = N;
        int mid = (low + high) / 2;

        while ( low != mid) {
            for (int j = 0;  j < mid; j++) {
                if(open[j] != -1) {
                    S[j] = open[j];
                } else {
                    S[j] = door[i];
                }                
            }
            for (int j = mid; j < N; j++) {
                if(open[j] != -1) {
                    S[j] = open[j];
                } else {
                    S[j] = 1-door[i];
                }
            }
            ans = tryCombination(S);
            if(ans > i || ans == -1) {
                high = mid;
                mid = (low + high) / 2;

            } else { 
                low = mid;
                mid = (low + high) / 2;
            }
        }

        open[mid] = door[i];
        target[mid] = i;        
    }

    answer(open, target);
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	396 ms	504 KB	Output is correct
2	Correct	389 ms	752 KB	Output is correct
3	Correct	614 ms	892 KB	Output is correct
4	Correct	411 ms	504 KB	Output is correct
5	Correct	609 ms	636 KB	Output is correct
6	Correct	596 ms	760 KB	Output is correct
7	Correct	600 ms	632 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	599 ms	632 KB	Output is correct
13	Correct	597 ms	632 KB	Output is correct
14	Correct	595 ms	632 KB	Output is correct

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	610 ms	504 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	599 ms	504 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	596 ms	504 KB	Output is correct
7	Correct	585 ms	888 KB	Output is correct
8	Correct	1036 ms	632 KB	Output is correct
9	Correct	1033 ms	588 KB	Output is correct
10	Correct	1030 ms	504 KB	Output is correct
11	Correct	581 ms	632 KB	Output is correct

Subtask #3

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	512 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct

Subtask #4

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	512 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	74 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	129 ms	384 KB	Output is correct
24	Correct	130 ms	504 KB	Output is correct
25	Correct	131 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	86 ms	504 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	75 ms	384 KB	Output is correct
31	Correct	76 ms	384 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	131 ms	504 KB	Output is correct
36	Correct	130 ms	512 KB	Output is correct
37	Correct	0 ms	256 KB	Output is correct

Subtask #5

24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	396 ms	504 KB	Output is correct
2	Correct	389 ms	752 KB	Output is correct
3	Correct	614 ms	892 KB	Output is correct
4	Correct	411 ms	504 KB	Output is correct
5	Correct	609 ms	636 KB	Output is correct
6	Correct	596 ms	760 KB	Output is correct
7	Correct	600 ms	632 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	599 ms	632 KB	Output is correct
13	Correct	597 ms	632 KB	Output is correct
14	Correct	595 ms	632 KB	Output is correct
15	Correct	610 ms	504 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	599 ms	504 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	596 ms	504 KB	Output is correct
21	Correct	585 ms	888 KB	Output is correct
22	Correct	1036 ms	632 KB	Output is correct
23	Correct	1033 ms	588 KB	Output is correct
24	Correct	1030 ms	504 KB	Output is correct
25	Correct	581 ms	632 KB	Output is correct
26	Correct	1 ms	256 KB	Output is correct
27	Correct	0 ms	256 KB	Output is correct
28	Correct	0 ms	384 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	1 ms	256 KB	Output is correct
36	Correct	1 ms	384 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	512 KB	Output is correct
39	Correct	1 ms	256 KB	Output is correct
40	Correct	1 ms	384 KB	Output is correct
41	Correct	1 ms	256 KB	Output is correct
42	Correct	1 ms	384 KB	Output is correct
43	Correct	0 ms	384 KB	Output is correct
44	Correct	1 ms	384 KB	Output is correct
45	Correct	74 ms	384 KB	Output is correct
46	Correct	1 ms	384 KB	Output is correct
47	Correct	1 ms	256 KB	Output is correct
48	Correct	129 ms	384 KB	Output is correct
49	Correct	130 ms	504 KB	Output is correct
50	Correct	131 ms	384 KB	Output is correct
51	Correct	1 ms	384 KB	Output is correct
52	Correct	1 ms	384 KB	Output is correct
53	Correct	86 ms	504 KB	Output is correct
54	Correct	1 ms	384 KB	Output is correct
55	Correct	75 ms	384 KB	Output is correct
56	Correct	76 ms	384 KB	Output is correct
57	Correct	1 ms	384 KB	Output is correct
58	Correct	1 ms	384 KB	Output is correct
59	Correct	1 ms	384 KB	Output is correct
60	Correct	131 ms	504 KB	Output is correct
61	Correct	130 ms	512 KB	Output is correct
62	Correct	0 ms	256 KB	Output is correct
63	Correct	389 ms	504 KB	Output is correct
64	Correct	386 ms	504 KB	Output is correct
65	Correct	612 ms	504 KB	Output is correct
66	Correct	417 ms	504 KB	Output is correct
67	Correct	601 ms	632 KB	Output is correct
68	Correct	597 ms	504 KB	Output is correct
69	Correct	599 ms	756 KB	Output is correct
70	Correct	1 ms	384 KB	Output is correct
71	Correct	1 ms	384 KB	Output is correct
72	Correct	592 ms	760 KB	Output is correct
73	Correct	593 ms	632 KB	Output is correct
74	Correct	617 ms	636 KB	Output is correct
75	Correct	637 ms	632 KB	Output is correct
76	Correct	0 ms	256 KB	Output is correct
77	Correct	1 ms	384 KB	Output is correct
78	Correct	615 ms	636 KB	Output is correct
79	Correct	610 ms	760 KB	Output is correct
80	Correct	1054 ms	760 KB	Output is correct
81	Correct	1052 ms	636 KB	Output is correct
82	Correct	1049 ms	628 KB	Output is correct
83	Correct	592 ms	500 KB	Output is correct
84	Correct	1 ms	256 KB	Output is correct
85	Correct	78 ms	560 KB	Output is correct
86	Correct	521 ms	760 KB	Output is correct
87	Correct	1 ms	384 KB	Output is correct
88	Correct	1 ms	384 KB	Output is correct
89	Correct	128 ms	384 KB	Output is correct
90	Correct	130 ms	384 KB	Output is correct
91	Correct	134 ms	504 KB	Output is correct
92	Correct	1035 ms	504 KB	Output is correct
93	Correct	1034 ms	760 KB	Output is correct
94	Correct	1033 ms	640 KB	Output is correct
95	Correct	1 ms	384 KB	Output is correct
96	Correct	1 ms	384 KB	Output is correct
97	Correct	596 ms	632 KB	Output is correct
98	Correct	93 ms	512 KB	Output is correct
99	Correct	594 ms	632 KB	Output is correct
100	Correct	1 ms	256 KB	Output is correct
101	Correct	75 ms	384 KB	Output is correct
102	Correct	77 ms	384 KB	Output is correct
103	Correct	513 ms	504 KB	Output is correct
104	Correct	1 ms	384 KB	Output is correct
105	Correct	1 ms	384 KB	Output is correct
106	Correct	1 ms	384 KB	Output is correct
107	Correct	129 ms	512 KB	Output is correct
108	Correct	129 ms	384 KB	Output is correct
109	Correct	1039 ms	632 KB	Output is correct
110	Correct	1042 ms	760 KB	Output is correct
111	Correct	1 ms	256 KB	Output is correct