oj.uz

Submission #516457

# Submission time Handle Problem Language Result Execution time Memory
516457 2022-01-21T10:57:02 Z 600Mihnea Cave (IOI13_cave) C++17
100 / 100
 246 ms 616 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 5000 + 7;
int state[N];
int inv[N];
int guy[N];

void exploreCave(int n) {
  /**
  int S[] = {1, 1, 1, 0};
  int D[] = {3, 1, 0, 2};
  answer(S, D);
  **/
  vector<int> guys(n);
  int last_guy = tryCombination(state);
  if (last_guy == -1) last_guy = n;

  iota(guys.begin(), guys.end(), 0);
  for (int pos = 0; pos < n; pos++) {
    int tl = 0, tr = (int) guys.size() - 1;
    int last = tr - tl + 1, per = 0;
    while (tl < tr) {
      int tm = (tl + tr) / 2;
      vector<int> my_part;
      for (int j = tl; j <= tm; j++) {
        my_part.push_back(guys[j]);
      }
      int sol1 = last_guy;
      for (auto &x : my_part) state[x] ^= 1;
      int sol2 = tryCombination(state);
      if (sol2 == -1) sol2 = n;
      for (auto &x : my_part) state[x] ^= 1;

      bool ok1 = (sol1 >= pos + 1);
      bool ok2 = (sol2 >= pos + 1);

      if (ok1 == ok2) {
        tl = tm + 1;
      } else {
        tr = tm;
      }
      assert(tr - tl + 1 < last);
    }
    ///cout << pos << " : " << per << "\n";
    int sol = tryCombination(state);
    if (sol == -1) sol = n;
    if (sol < pos + 1) {
      state[guys[tl]] ^= 1;
      last_guy = tryCombination(state);
      if (last_guy == -1) last_guy = n;
    }
    inv[guys[tl]] = pos;

    vector<int> pguys;
    for (int j = 0; j < (int) guys.size(); j++) {
      if (j != tl) {
        pguys.push_back(guys[j]);
      }
    }
    guys = pguys;
  }
  answer(state, inv);

}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:24:29: warning: unused variable 'per' [-Wunused-variable]
   24 |     int last = tr - tl + 1, per = 0;
      |                             ^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 420 KB Output is correct
2 Correct 140 ms 432 KB Output is correct
3 Correct 207 ms 616 KB Output is correct
4 Correct 141 ms 472 KB Output is correct
5 Correct 199 ms 564 KB Output is correct
6 Correct 196 ms 476 KB Output is correct
7 Correct 197 ms 572 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 0 ms 304 KB Output is correct
12 Correct 197 ms 484 KB Output is correct
13 Correct 198 ms 476 KB Output is correct
14 Correct 208 ms 440 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 452 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 210 ms 460 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 205 ms 452 KB Output is correct
7 Correct 206 ms 444 KB Output is correct
8 Correct 210 ms 460 KB Output is correct
9 Correct 219 ms 460 KB Output is correct
10 Correct 215 ms 460 KB Output is correct
11 Correct 203 ms 332 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 288 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 37 ms 408 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 32 ms 376 KB Output is correct
24 Correct 33 ms 332 KB Output is correct
25 Correct 32 ms 308 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 31 ms 388 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 32 ms 392 KB Output is correct
31 Correct 32 ms 388 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 0 ms 300 KB Output is correct
35 Correct 36 ms 452 KB Output is correct
36 Correct 32 ms 332 KB Output is correct
37 Correct 0 ms 204 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 420 KB Output is correct
2 Correct 140 ms 432 KB Output is correct
3 Correct 207 ms 616 KB Output is correct
4 Correct 141 ms 472 KB Output is correct
5 Correct 199 ms 564 KB Output is correct
6 Correct 196 ms 476 KB Output is correct
7 Correct 197 ms 572 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 0 ms 304 KB Output is correct
12 Correct 197 ms 484 KB Output is correct
13 Correct 198 ms 476 KB Output is correct
14 Correct 208 ms 440 KB Output is correct
15 Correct 205 ms 452 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 210 ms 460 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 205 ms 452 KB Output is correct
21 Correct 206 ms 444 KB Output is correct
22 Correct 210 ms 460 KB Output is correct
23 Correct 219 ms 460 KB Output is correct
24 Correct 215 ms 460 KB Output is correct
25 Correct 203 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 0 ms 300 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 288 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 37 ms 408 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 32 ms 376 KB Output is correct
49 Correct 33 ms 332 KB Output is correct
50 Correct 32 ms 308 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 31 ms 388 KB Output is correct
54 Correct 0 ms 332 KB Output is correct
55 Correct 32 ms 392 KB Output is correct
56 Correct 32 ms 388 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 0 ms 300 KB Output is correct
60 Correct 36 ms 452 KB Output is correct
61 Correct 32 ms 332 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 129 ms 440 KB Output is correct
64 Correct 132 ms 452 KB Output is correct
65 Correct 213 ms 612 KB Output is correct
66 Correct 147 ms 460 KB Output is correct
67 Correct 197 ms 460 KB Output is correct
68 Correct 192 ms 460 KB Output is correct
69 Correct 195 ms 484 KB Output is correct
70 Correct 1 ms 292 KB Output is correct
71 Correct 1 ms 296 KB Output is correct
72 Correct 196 ms 488 KB Output is correct
73 Correct 196 ms 612 KB Output is correct
74 Correct 193 ms 480 KB Output is correct
75 Correct 240 ms 496 KB Output is correct
76 Correct 0 ms 204 KB Output is correct
77 Correct 0 ms 204 KB Output is correct
78 Correct 217 ms 600 KB Output is correct
79 Correct 212 ms 468 KB Output is correct
80 Correct 219 ms 488 KB Output is correct
81 Correct 213 ms 484 KB Output is correct
82 Correct 229 ms 488 KB Output is correct
83 Correct 198 ms 484 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 32 ms 372 KB Output is correct
86 Correct 193 ms 484 KB Output is correct
87 Correct 0 ms 300 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 32 ms 312 KB Output is correct
90 Correct 36 ms 332 KB Output is correct
91 Correct 32 ms 332 KB Output is correct
92 Correct 246 ms 460 KB Output is correct
93 Correct 216 ms 492 KB Output is correct
94 Correct 199 ms 484 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 188 ms 492 KB Output is correct
98 Correct 31 ms 376 KB Output is correct
99 Correct 199 ms 488 KB Output is correct
100 Correct 1 ms 332 KB Output is correct
101 Correct 31 ms 392 KB Output is correct
102 Correct 31 ms 388 KB Output is correct
103 Correct 193 ms 484 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 204 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 34 ms 392 KB Output is correct
108 Correct 33 ms 376 KB Output is correct
109 Correct 209 ms 504 KB Output is correct
110 Correct 198 ms 484 KB Output is correct
111 Correct 0 ms 204 KB Output is correct