제출 #169292

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
169292	2019-12-19 14:18:33	AlexLuchianov	동굴 (IOI13_cave)	C++14	100 / 100	1171 ms	564 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 <vector>
using namespace std;
void exploreCave(int N) {
  int sol[N] = {0};
  int door[N] = {0}, seen[N] = {0};
  for(int i = 0; i < N; i++){
    if(i != tryCombination(sol))
      for(int j = 0; j < N; j++)
        if(seen[j] == 0)
          sol[j] ^= 1;
    int from = 0, to = N - 1;
    while(from < to){
      int mid = (from + to) / 2;
      for(int j = 0; j <= mid; j++)
        if(seen[j] == 0)
          sol[j] ^= 1;
      int result = tryCombination(sol);
      for(int j = 0; j <= mid; j++)
        if(seen[j] == 0)
          sol[j] ^= 1;
      if(i == result)
        from = mid + 1;
      else
        to = mid;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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