oj.uz

Submission #894076

# Submission time Handle Problem Language Result Execution time Memory
894076 2023-12-28T00:28:33 Z MilosMilutinovic Monster Game (JOI21_monster) C++17
96 / 100
 55 ms 1196 KB 
#include "monster.h"
#include <bits/stdc++.h>

using namespace std;

namespace {

bool example_variable;

}  // namespace

vector<int> Solve(int n) {
  vector<int> order(n);
  iota(order.begin(), order.end(), 0);
  vector<int> tmp(n);
  function<void(int, int)> MergeSort = [&](int l, int r) {
    if (l == r) {
      return;
    }
    int mid = l + r >> 1;
    MergeSort(l, mid);
    MergeSort(mid + 1, r);
    for (int i = l; i <= r; i++) {
      tmp[i] = order[i];
    }
    int pl = l, pr = mid + 1;
    int ptr = l;
    while (pl <= mid || pr <= r) {
      if (pl > mid) {
        order[ptr++] = tmp[pr++];
      } else if (pr > r) {
        order[ptr++] = tmp[pl++];
      } else {
        order[ptr++] = (Query(tmp[pl], tmp[pr]) ? tmp[pl++] : tmp[pr++]);
      }
    }
  };
  MergeSort(0, n - 1);
  int pos = -1;
  auto Check = [&]() {
    if (Query(order[0], order[2])) {
      return false;
    }
    if (!Query(order[0], order[1])) {
      return false;
    }
    if (!Query(order[1], order[2])) {
      return false;
    }
    return true;
  };
  if (n <= 10) {
    vector<int> bad;
    for (int i = 1; i < n; i++) {
      if (!Query(order[0], order[i])) {
        bad.push_back(i);
      }
    }
    if ((int) bad.size() > 1) {
      pos = bad.rbegin()[1];
    } else {
      bool ok = true;
      for (int i = 2; i < n; i++) {
        if (!Query(order[1], order[i])) {
          ok = false;
          break;
        }
      }
      if (ok) {
        pos = 1;
      } else {
        pos = 0;
      }
    }
  } else {
    if (Check()) {
      if (!Query(order[0], order[3]) && !Query(order[1], order[3])) {
        vector<int> bad;
        for (int i = 1; i < n; i++) {
          if (!Query(order[0], order[i])) {
            bad.push_back(i);
          }
        }
        pos = bad.rbegin()[1];
      } else {
        int smx = -1;
        vector<int> cnt(3);
        auto Update = [&](int x) {
          for (int i = 0; i < 3; i++) {
            cnt[i] += !Query(order[i], x);
          }
        };
        if (!Query(order[3], order[5]) && Query(order[3], order[4]) && Query(order[4], order[5])) {
          if (!Query(order[3], order[6]) && !Query(order[4], order[6])) {
            vector<int> bad(order[6]);
            for (int i = 7; i < n; i++) {
              if (!Query(order[3], order[i])) {
                bad.push_back(order[i]);
              }
            }
            if ((int) bad.size() > 1) {
              bad.pop_back();
            }
            Update(bad.back());
          } else {
            for (int i = 3; i < 6; i++) {
              Update(order[i]);
            }
          }
        } else {
          bool ok = true;
          for (int i = 5; i < n; i++) {
            if (!Query(order[4], order[i])) {
              ok = false;
              break;
            }
          }
          if (ok) {
            Update(order[4]);
          } else {
            Update(order[3]);
          }
        }
        for (int i = 0; i < 3; i++) {
          if (cnt[i] > 0) {
            pos = (i - 1 + 3) % 3;
          }
        }
      }
    } else {
      bool ok = true;
      for (int i = 2; i < n; i++) {
        if (!Query(order[1], order[i])) {
          ok = false;
          break;
        }
      }
      if (ok) {
        pos = 1;
      } else {
        pos = 0;
      }
    }
  }
  vector<int> res;
  function<void(int, int)> Solve = [&](int l, int r) {
    for (int i = r; i >= l; i--) {
      res.push_back(order[i]);
    }
    if (r == n - 1) {
      return;
    }
    for (int i = r + 1; i < n; i++) {
      if (!Query(order[l], order[i])) {
        Solve(r + 1, i);
        break;
      }
    }
  };
  Solve(0, pos);
  reverse(res.begin(), res.end());
  vector<int> ret(n);
  for (int i = 0; i < n; i++) {
    ret[res[i]] = i;
  }
  return ret;
}

Compilation message

monster.cpp: In lambda function:
monster.cpp:20:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   20 |     int mid = l + r >> 1;
      |               ~~^~~
monster.cpp: In function 'std::vector<int> Solve(int)':
monster.cpp:86:13: warning: unused variable 'smx' [-Wunused-variable]
   86 |         int smx = -1;
      |             ^~~
monster.cpp: At global scope:
monster.cpp:8:6: warning: '{anonymous}::example_variable' defined but not used [-Wunused-variable]
    8 | bool example_variable;
      |      ^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 6 ms 596 KB Output is correct
17 Correct 7 ms 436 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 7 ms 436 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 3 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 5 ms 600 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 6 ms 596 KB Output is correct
17 Correct 7 ms 436 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 7 ms 436 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 3 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 5 ms 600 KB Output is correct
33 Correct 42 ms 504 KB Output is correct
34 Correct 36 ms 848 KB Output is correct
35 Correct 41 ms 416 KB Output is correct
36 Correct 39 ms 948 KB Output is correct
37 Correct 50 ms 436 KB Output is correct
38 Correct 40 ms 444 KB Output is correct
39 Correct 45 ms 928 KB Output is correct
40 Correct 43 ms 424 KB Output is correct
41 Correct 41 ms 848 KB Output is correct
42 Correct 52 ms 672 KB Output is correct
43 Correct 25 ms 1196 KB Output is correct
44 Correct 26 ms 592 KB Output is correct

Subtask #3
71.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 424 KB Output is correct
2 Correct 39 ms 1188 KB Output is correct
3 Partially correct 47 ms 676 KB Partially correct
4 Correct 42 ms 424 KB Output is correct
5 Correct 36 ms 848 KB Output is correct
6 Correct 47 ms 428 KB Output is correct
7 Correct 36 ms 420 KB Output is correct
8 Partially correct 48 ms 676 KB Partially correct
9 Partially correct 55 ms 428 KB Partially correct
10 Partially correct 45 ms 1192 KB Partially correct
11 Correct 39 ms 932 KB Output is correct
12 Partially correct 41 ms 932 KB Partially correct
13 Correct 44 ms 944 KB Output is correct
14 Correct 44 ms 420 KB Output is correct
15 Correct 27 ms 416 KB Output is correct
16 Correct 27 ms 932 KB Output is correct
17 Correct 37 ms 420 KB Output is correct
18 Correct 42 ms 936 KB Output is correct