Submission #1136810

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1136810	2025-01-17 12:52:36	gustavo_d	Cave (IOI13_cave)	C++17	0 / 100	279 ms	524 KiB

cave

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int n) {
    int door_of_switch[n], switch_pos_ans[n];
    for (int i=0; i<n; i++) switch_pos_ans[i] = -1; // unknown
    for (int d=0; d<n; d++) {
        int switch_pos[n];
        
        int open_pos = -1;
        for (int i=0; i<n; i++) {
            if (switch_pos_ans[i] != -1) switch_pos[i] = switch_pos_ans[i];
            else switch_pos[i] = 1;
        }
        int first_closed = tryCombination(switch_pos); // -1 if all open
        if (first_closed == -1) first_closed = n;
        if (first_closed > d) open_pos = 1;
        else open_pos = 0;
        int l = 0, r=n-1; int s = -1;
        while (l < r) {
            int m = (l + r) / 2;
            for (int i=0; i<n; i++) {
                if (switch_pos_ans[i] != -1) switch_pos[i] = switch_pos_ans[i];
                else if (i <= m) switch_pos[i] = open_pos;
                else switch_pos[i] = (!open_pos);
            }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 12
• Subtask 2: 0 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24