Submission #97111

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
97111	2019-02-14 00:35:03	E869120	Cave (IOI13_cave)	C++14	100 / 100	1334 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;
int S[5000], A[5009], B[5009], col[5009];
void exploreCave(int N) {
  for (int i = 0; i < N; i++) col[i] = -1;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      if (col[j] == -1) S[j] = 0;
      else S[j] = col[j];
    }
    int Z = tryCombination(S);
    
    int L = 0, R = N, M, res = 0;
    while (R - L >= 2) {
      M = (L + R) / 2;
      for (int j = 0; j < N; j++) {
        if (col[j] == -1) { if (L <= j && j < M) S[j] = 1; else S[j] = 0; }
        else S[j] = col[j];
      }
      int ZZ = tryCombination(S);
      bool ok1 = true; if (Z == i) ok1 = false;
      bool ok2 = true; if (ZZ == i) ok2 = false;
      
      if (ok1 != ok2) { res = L; R = M; }
      if (ok1 == ok2) { res = M; L = M; }
    }
    if (Z == i) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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