Submission #641097

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
641097	2022-09-16 01:43:57	quocnguyen1012	Cave (IOI13_cave)	C++14	100 / 100	1527 ms	668 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;
const int maxn = 5005;
int a[maxn], mark[maxn], b[maxn], match[maxn];
void exploreCave(int N) {
  for (int door = 0; door < N; ++door) {
    for (int i = 0; i < N; ++i) {
      if (mark[i]) b[i] = a[i];
      else b[i] = 0;
    }
    int res = tryCombination(b);
    if (res == -1) res = N;
    //cerr << res << '\n';
    const auto ask = [&](int pivot, int v) {
      for (int i = 0; i < N; ++i) {
        if (mark[i]) b[i] = a[i];
        else b[i] = 0;
      }
      for (int i = 0; i <= pivot; ++i) {
        if (not mark[i])
          b[i] = (v ^ 1);  
      }
      for (int i = pivot + 1; i < N; ++i) {
        if (not mark[i]) b[i] = v;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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