Submission #777710

# Submission time Handle Problem Language Result Execution time Memory
777710 2023-07-09T13:38:16 Z AkibAzmain Cave (IOI13_cave) C++17
100 / 100
182 ms 460 KB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void
exploreCave (int n)
{
  //// subtask 1
  // vector < int > a (n), b (n);
  // for (int i = tryCombination (a.data ()); i != -1; i = tryCombination (a.data ()))
  //   a[i] = !a[i];
  // for (int i = 0; i < n; ++i) b[i] = i;
  // answer (a.data (), b.data ());
  //// subtask 2
  // vector < int > a (n), b (n);
  // for (int i = 0; i < n; ++i)
  //   {
  //     a[i] = 1;
  //     b[i] = tryCombination (&a[0]);
  //     a[i] = 0;
  //   }
  // answer (&a[0], &b[0]);
  //// subtask 3
  // vector < int > a (n), b (n, -1);
  // for (int i = tryCombination (&a[0]); i != -1;)
  //   {
  //     for (int j = 0; j < n; ++j)
  //       {
  //         if (b[j] != -1) continue;
  //         a[j] = !a[j];
  //         int s = tryCombination (&a[0]);
  //         if (s < i && s != -1) b[j] = s, a[j] = !a[j];
  //         if (s > i || s == -1)
  //           {
  //             b[j] = i;
  //             i = s;
  //             break;
  //           }
  //       }
  //   }
  // for (int i = 0; i < n; ++i)
  //   {
  //     if (b[i] >= 0) continue;
  //     a[i] = !a[i];
  //     b[i] = tryCombination (&a[0]);
  //     a[i] = !a[i];
  //   }
  // answer (&a[0], &b[0]);
  /// full task
  int s = -2;
  vector < int > a (n), b (n, -1);
  for (int i = 0; i < n; ++i)
    {
      if (s == -2) s = tryCombination (&a[0]);
      int l = 0, r = n;
      while (l < r)
        {
          if (l + 1 == r) break;
          int m = (l + r) / 2;
          for (int j = l; j < m; ++j)
            if (b[j] == -1)
              a[j] = !a[j];
          int t = tryCombination (&a[0]);
          for (int j = l; j < m; ++j)
            if (b[j] == -1)
              a[j] = !a[j];
          if ((s == i && (t > i || t == -1))
              || ((s > i || s == -1) && t == i))
            r = m;
          else
            l = m;
        }
      b[l] = i;
      if (s == i) a[l] = !a[l], s = -2;
    }
  answer (&a[0], &b[0]);
}
# Verdict Execution time Memory Grader output
1 Correct 82 ms 368 KB Output is correct
2 Correct 85 ms 368 KB Output is correct
3 Correct 130 ms 376 KB Output is correct
4 Correct 89 ms 376 KB Output is correct
5 Correct 159 ms 372 KB Output is correct
6 Correct 129 ms 372 KB Output is correct
7 Correct 161 ms 372 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 125 ms 376 KB Output is correct
13 Correct 130 ms 372 KB Output is correct
14 Correct 141 ms 380 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 160 ms 376 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 140 ms 376 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 163 ms 416 KB Output is correct
7 Correct 123 ms 412 KB Output is correct
8 Correct 176 ms 408 KB Output is correct
9 Correct 182 ms 408 KB Output is correct
10 Correct 179 ms 408 KB Output is correct
11 Correct 124 ms 408 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 19 ms 368 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 24 ms 316 KB Output is correct
24 Correct 24 ms 340 KB Output is correct
25 Correct 24 ms 300 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 20 ms 312 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 19 ms 364 KB Output is correct
31 Correct 19 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 23 ms 316 KB Output is correct
36 Correct 26 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 82 ms 368 KB Output is correct
2 Correct 85 ms 368 KB Output is correct
3 Correct 130 ms 376 KB Output is correct
4 Correct 89 ms 376 KB Output is correct
5 Correct 159 ms 372 KB Output is correct
6 Correct 129 ms 372 KB Output is correct
7 Correct 161 ms 372 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 125 ms 376 KB Output is correct
13 Correct 130 ms 372 KB Output is correct
14 Correct 141 ms 380 KB Output is correct
15 Correct 160 ms 376 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 140 ms 376 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 163 ms 416 KB Output is correct
21 Correct 123 ms 412 KB Output is correct
22 Correct 176 ms 408 KB Output is correct
23 Correct 182 ms 408 KB Output is correct
24 Correct 179 ms 408 KB Output is correct
25 Correct 124 ms 408 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 19 ms 368 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 24 ms 316 KB Output is correct
49 Correct 24 ms 340 KB Output is correct
50 Correct 24 ms 300 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 300 KB Output is correct
53 Correct 20 ms 312 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 19 ms 364 KB Output is correct
56 Correct 19 ms 340 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 23 ms 316 KB Output is correct
61 Correct 26 ms 340 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 81 ms 396 KB Output is correct
64 Correct 88 ms 392 KB Output is correct
65 Correct 143 ms 340 KB Output is correct
66 Correct 91 ms 396 KB Output is correct
67 Correct 164 ms 412 KB Output is correct
68 Correct 124 ms 408 KB Output is correct
69 Correct 160 ms 416 KB Output is correct
70 Correct 1 ms 304 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 124 ms 412 KB Output is correct
73 Correct 140 ms 412 KB Output is correct
74 Correct 157 ms 408 KB Output is correct
75 Correct 136 ms 416 KB Output is correct
76 Correct 1 ms 304 KB Output is correct
77 Correct 1 ms 304 KB Output is correct
78 Correct 167 ms 408 KB Output is correct
79 Correct 119 ms 340 KB Output is correct
80 Correct 179 ms 408 KB Output is correct
81 Correct 169 ms 416 KB Output is correct
82 Correct 181 ms 460 KB Output is correct
83 Correct 123 ms 416 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 24 ms 340 KB Output is correct
86 Correct 123 ms 316 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 0 ms 212 KB Output is correct
89 Correct 23 ms 356 KB Output is correct
90 Correct 23 ms 340 KB Output is correct
91 Correct 23 ms 344 KB Output is correct
92 Correct 178 ms 416 KB Output is correct
93 Correct 164 ms 412 KB Output is correct
94 Correct 165 ms 412 KB Output is correct
95 Correct 1 ms 304 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 125 ms 340 KB Output is correct
98 Correct 22 ms 360 KB Output is correct
99 Correct 129 ms 416 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 19 ms 316 KB Output is correct
102 Correct 19 ms 340 KB Output is correct
103 Correct 125 ms 412 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 304 KB Output is correct
107 Correct 24 ms 340 KB Output is correct
108 Correct 23 ms 340 KB Output is correct
109 Correct 167 ms 408 KB Output is correct
110 Correct 180 ms 408 KB Output is correct
111 Correct 1 ms 212 KB Output is correct