Submission #103728

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
103728	2019-04-02 09:34:02	turbat	Cave (IOI13_cave)	C++14	100 / 100	1206 ms	664 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 <bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int N) {
  int a[N], s[N], d[N], found[N], l, r, t;
  memset(s, 0, sizeof s);
  memset(found, 0, sizeof found);
    for (int i = 0;i < N;i++){
        for (int j = 0;j < N;j++)
            a[j] = s[j];
        int tmp = tryCombination(a);
        if (tmp > i || tmp == -1) t = 0;
        else t = 1;
        l = 0, r = N - 1;
        while (l != r){
            for (int i = 0;i < N;i++){
                if (found[i]) a[i] = s[i];
                else a[i] = 1 - t;
            }
            int mid = (l + r) / 2;
            for (int i = l;i <= mid;i++)
                if (!found[i]) 
                    a[i] = t;
            tmp = tryCombination(a);
            if (tmp > i || tmp == -1) r = mid;
            else l = mid + 1;
        }
        d[l] = i;
        found[l] = 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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