結果

問題 No.2771 Personal Space
ユーザー risujirohrisujiroh
提出日時 2024-05-31 21:50:10
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 164 ms / 2,000 ms
コード長 4,054 bytes
コンパイル時間 3,343 ms
コンパイル使用メモリ 269,172 KB
実行使用メモリ 24,320 KB
最終ジャッジ日時 2024-05-31 21:50:20
合計ジャッジ時間 8,726 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 164 ms
24,140 KB
testcase_02 AC 130 ms
24,320 KB
testcase_03 AC 139 ms
24,320 KB
testcase_04 AC 136 ms
24,320 KB
testcase_05 AC 137 ms
24,320 KB
testcase_06 AC 133 ms
24,192 KB
testcase_07 AC 91 ms
6,944 KB
testcase_08 AC 65 ms
6,944 KB
testcase_09 AC 91 ms
6,940 KB
testcase_10 AC 114 ms
8,360 KB
testcase_11 AC 131 ms
16,640 KB
testcase_12 AC 127 ms
19,968 KB
testcase_13 AC 77 ms
6,944 KB
testcase_14 AC 92 ms
6,940 KB
testcase_15 AC 91 ms
6,940 KB
testcase_16 AC 93 ms
6,940 KB
testcase_17 AC 97 ms
6,944 KB
testcase_18 AC 90 ms
6,944 KB
testcase_19 AC 90 ms
6,940 KB
testcase_20 AC 121 ms
16,128 KB
testcase_21 AC 130 ms
15,488 KB
testcase_22 AC 129 ms
15,104 KB
testcase_23 AC 144 ms
22,528 KB
testcase_24 AC 126 ms
18,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void solve() {
  Int n, m;
  scan(n, m);
  Vec<Int> ans(n + 1, -1);
  ans[m] = 1;
  Set<Tuple<Int, Int, Int>> se;
  se.emplace(-(m - 1), 2 - m, m);
  se.emplace(-(n - m), m, 2 * n - m);
  for (const Int i : rep1(2, n)) {
    const auto [_, l, r] = *se.begin();
    se.erase(se.begin());
    const Int mid = (l + r) / 2;
    ans[mid] = i;
    if (mid != 1) {
      se.emplace(-((mid - l) / 2), l, mid);
    }
    if (mid != n) {
      se.emplace(-((r - mid) / 2), mid, r);
    }
  }
  print(ans | views::drop(1));
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout << std::setprecision(std::numeric_limits<Float>::max_digits10);

  Int t;
  scan(t);
  while (t--) {
    solve();
  }
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;

using Int = int64_t;
using Float = double;
using Str = std::string;

template <class T1, class T2>
using Pair = std::pair<T1, T2>;

template <class... Ts>
using Tuple = std::tuple<Ts...>;

template <class T, size_t N>
using Arr = std::array<T, N>;

template <class T>
using Vec = std::vector<T>;

template <class T>
using Set = std::set<T>;

template <class T>
using Multiset = std::multiset<T>;

template <class K, class T>
using Map = std::map<K, T>;

template <class T>
using MinHeap = std::priority_queue<T, Vec<T>, std::greater<T>>;

template <class T>
using MaxHeap = std::priority_queue<T>;

namespace ranges = std::ranges;
namespace views = std::views;

inline constexpr auto len = ranges::ssize;
inline constexpr auto rev = views::reverse;

constexpr auto rep(Int l, Int r) { return views::iota(std::min(l, r), r); }
constexpr auto rep(Int n) { return rep(0, n); }
constexpr auto rep1(Int l, Int r) { return rep(l, r + 1); }
constexpr auto rep1(Int n) { return rep(1, n + 1); }

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <std::signed_integral T = Int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}

template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}

template <class T>
concept Range = ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept TupleLike = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, TupleLike auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  for (string_view sep = ""; auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, TupleLike auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

}  // namespace std

#define DEF_INC_OR_DEC(op) \
  auto& operator op(Range auto&& r) { \
    for (auto&& e : r) { \
      op e; \
    } \
    return r; \
  } \
  auto& operator op(TupleLike auto&& t) { \
    std::apply([](auto&... xs) { (op xs, ...); }, t); \
    return t; \
  }

DEF_INC_OR_DEC(++)
DEF_INC_OR_DEC(--)

#undef DEF_INC_OR_DEC

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const {
    return f_(std::ref(*this), std::forward<decltype(xs)>(xs)...);
  }

 private:
  F f_;
};

#endif  // __INCLUDE_LEVEL__
0