Submission #1176186

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1176186	2025-03-30 06:23:44	tawwie	Cave (IOI13_cave)	C++20	100 / 100	774 ms	884 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) {
    unordered_map<int, int> door, s; // u[i] = j -> switch j is for door i
    // initialize door
    for(int i=0; i<N; i++) s[i] = -1;
    
    for(int i=0; i<N; i++){ // iterate doors
        int buffer[N];
        for(int j=0; j<N; j++){
            if(s[j] != -1) buffer[j] = s[j];
            else buffer[j] = 1; // arbitrary
        }
        int switchdoor; // switch mode for door i (0 / 1)
        if(tryCombination(buffer) == i){
            switchdoor = 0;
        }else{
            switchdoor = 1;
        }
        int l = 0, r = N - 1;
        while(l < r){
            int mid = (l + r) / 2;
            for(int j=l; j<=mid; j++){
                if(s[j] != -1) buffer[j] = s[j];
                else buffer[j] = switchdoor;
            }
            for(int j=mid+1; j<=r; j++){
                if(s[j] != -1) buffer[j] = s[j];
                else buffer[j] = abs(switchdoor - 1);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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