結果

問題 No.2893 Minahoshi (Hard)
ユーザー 👑 amentorimaruamentorimaru
提出日時 2024-08-16 15:29:22
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,275 bytes
コンパイル時間 4,341 ms
コンパイル使用メモリ 249,296 KB
実行使用メモリ 11,868 KB
最終ジャッジ日時 2024-09-13 20:52:38
合計ジャッジ時間 13,247 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define ATCODER
#define _USE_MATH_DEFINES
#include<stdio.h>
#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
#include <list>
#include <random>
#include <iterator>
#include <bitset>
#include <chrono>
#include <type_traits>
using namespace std;

using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

//template<claLR T> using pq = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for(ll i=(a); i<(b);i++)
#define REP(i, n) for(ll i=0; i<(n);i++)
#define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--)
#define PER(i, n) for(ll i=n-1; i>=0;i--)
#define REPREP(i,j,a,b) for(ll i=0;i<a;i++)for(ll j=0;j<b;j++)
#define VV(type) vector< vector<type> >
#define VV2(type,n,m,val) vector< vector<type> > val;val.resize(n);for(ll i;i<n;i++)val[i].resize(m)
#define vec(type) vector<type>
#define VEC(type,n,val) vector<type> val;val.resize(n)
#define VL vector<ll>
#define VVL vector< vector<ll> >
#define VP vector< pair<ll,ll> >
#define SZ size()
#define all(i) begin(i),end(i)
#define SORT(i) sort(all(i))
#define BITI(i) (1<<i)
#define BITSET(x,i) x | (ll(1)<<i)
#define BITCUT(x,i) x & ~(ll(1)<<i)
#define EXISTBIT(x,i) (((x>>i) & 1) != 0)
#define ALLBIT(n) (ll(1)<<n-1)
#define CHMAX(n,v) n=n<v?v:n
#define CHMIN(n,v) n=n>v?v:n
#define MP(a,b) make_pair(a,b)
#define DET2(x1,y1,x2,y2) (x1)*(y2)-(x2)*(y1)
#define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) (x1)*(y2)*(z3)+(x2)*(y3)*(z1)+(x3)*(y1)*(z2)-(z1)*(y2)*(x3)-(z2)*(y3)*(x1)-(z3)*(y1)*(x2)
#define INC(a) for(auto& v:a)v++;
#define DEC(a) for(auto& v:a)v--;
#define SQU(x) (x)*(x)
#define L0 ll(0)
#ifdef ATCODER
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using mint2 = modint998244353;
#endif
template<typename T = ll>
vector<T> read(size_t n) {
  vector<T> ts(n);
  for (size_t i = 0; i < n; i++) cin >> ts[i];
  return ts;
}

template<typename TV, const ll N> void read_tuple_impl(TV&) {}
template<typename TV, const ll N, typename Head, typename... Tail>
void read_tuple_impl(TV& ts) {
  get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));
  read_tuple_impl<TV, N + 1, Tail...>(ts);
}
template<typename... Ts> decltype(auto) read_tuple(size_t n) {
  tuple<vector<Ts>...> ts;
  for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);
  return ts;
}

using val = ll;
using func = pair<ll, ll>;

val opm(val a, val b) {
  return min(a, b);
}

val em() { return 1e18; }

val opM(val a, val b) {
  return max(a, b);
}

val eM() { return 0; }

//val mp(func f, val a)
//{
//  if (f.first < 0)
//    return a;
//  return f;
//}
//func comp(func f, func g) {
//  if (g.first < 0)
//    return f;
//  return g;
//}
//
//func id() {
//  return MP(-1, -1);
//}


ll di[4] = { 1,0,-1,0 };
ll dj[4] = { 0,1,0,-1 };
ll si[4] = { 0,3,3,0 };
ll sj[4] = { 0,0,3,3 };
//ll di[4] = { -1,-1,1,1 };
//ll dj[4] = { -1,1,-1,1 };
ll di8[8] = { 0,-1,-1,-1,0,1,1,1 };
ll dj8[8] = { -1,-1,0,1,1,1,0,-1 };


void solve() {
  ll n;
  cin >> n;
  vector<string> precalc = {
    "",
    "a",
    "ab",
    "aab",
    "aaba",
    "aabba",
    "aaabba",
    "aaababb",
    "aaababba",
    "aaababbaa",
    "aaababbbaa",
    "aaaababbbaa",
    "aaaabaabbbab",
    "aaaabaabbabbb",
    "aaaabaabbabbba",
    "aaaabaabbababbb",
    "aaaabaabbababbba",
    "aaaabaabbababbbaa",
    "aaaabaabbababbbaaa",
    "aaaabaabbababbbbaaa"
  };
  if (n < precalc.size()) {
    cout << precalc[n] << "\n";
    return;
  }

  vector<unordered_set<ll>> lfsr = {
  {},
  {},
  {0,1},
  {0,1},
  {0,1},
  {0,2},
  {0,1},
  {0,1},
  {0,2,3,4},
  {0,4},
  {0,3},
  {0,2},
  {0,1,2,8},
  {0,1,2,5},
  {0,1,2,12},
  {0,1},
  {0,2,3,5},
  {0,3},
  {0,7},
  {0,1,2,5}
  };

  ll lfsr_i = 2;
  while ((1 << (lfsr_i + 1)) + lfsr_i < n) {
    lfsr_i++;
  }

  ll vn = 1LL << (lfsr_i);
  VVL g(vn);
  ll first = vn >> 1;
  ll now = first;
  ll cnt = lfsr_i;
  ll top_bit = vn >> 1;
  while (now != 1) {
    ll next_bit = 0;
    for (auto& v : lfsr[lfsr_i]) 
      next_bit ^= (now >> v) & 1;
    ll next = (now >> 1) | (next_bit * top_bit);
    g[now].push_back(next);
    now = next;
    cnt++;
  }
  g[now].push_back(0);
  cnt++;
  g[0].push_back(first);
  cnt++;
  REP(i, vn) {
    if (g[i].size() > 1)
      continue;
    VL add;
    ll now = i;
    while (cnt < n) {      
      ll next = g[now][0] ^ top_bit;
      g[now].push_back(next);
      cnt++;
      add.push_back(now);
      now = next;
      if (now == i)
        break;
    }
    if (cnt == n) {
      string ans;
      for (auto& v : add)
        swap(g[v][0], g[v][1]);
      ll now = i;
      REP(b, lfsr_i) {
        if (EXISTBIT(now, b))
          ans.push_back('B');
        else
          ans.push_back('A');
      }

      while (!g[now].empty()) {
        ll next = g[now].back();
        if (next & top_bit)
          ans.push_back('B');
        else
          ans.push_back('A');
        g[now].pop_back();
        now = next;
      }
      cout << ans << "\n";
      return;
    }
  }

  return;
}

int main() {
  ll t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
0