Submission #133904

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
133904	2019-07-21 17:26:14	KieranHorgan	Cave (IOI13_cave)	C++17	100 / 100	1151 ms	640 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 switchOfDoorXIsKnown[N];
  int doorOfSwitchXIsKnown[N];
  int posOfSwitch[N];
  memset(switchOfDoorXIsKnown, -1, sizeof(switchOfDoorXIsKnown));
  memset(doorOfSwitchXIsKnown, -1, sizeof(doorOfSwitchXIsKnown));
  memset(posOfSwitch, -1, sizeof(posOfSwitch));
  int toGuess[N];
  for(int i = 0; i < N; i++) {
    for(int j = 0; j < N; j++)
      if(doorOfSwitchXIsKnown[j] == -1)
        toGuess[j] = 0;
      else
        toGuess[j] = posOfSwitch[j];
    bool offIsDown = tryCombination(toGuess) == i;
    int lo = 0;
    int hi = N-1;
    while(lo != hi) {
      int mid = (lo+hi)/2;
      for(int j = 0; j < N; j++)
        if(doorOfSwitchXIsKnown[j] == -1) {
          if(j <= mid)
            toGuess[j] = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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