QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#74287#5434. Binary Substringsjapan022022AC ✓22ms5140kbC++2016.1kb2023-01-31 14:16:362023-01-31 14:16:39

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-01-31 14:16:39]
  • 评测
  • 测评结果:AC
  • 用时:22ms
  • 内存:5140kb
  • [2023-01-31 14:16:36]
  • 提交

answer

#line 1 "library/my_template.hpp"
#if defined(LOCAL)
#include <my_template_compiled.hpp>
#else
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;

template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))

// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define overload4(a, b, c, d, e, ...) e
#define overload3(a, b, c, d, ...) d
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)

#define FOR_subset(t, s) \
  for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second

#define stoi stoll

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T, typename U>
T ceil(T x, U y) {
  return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U>
T floor(T x, U y) {
  return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
  T q = floor(x, y);
  return {q, x - q * y};
}

template <typename T, typename U>
T SUM(const vector<U> &A) {
  T sum = 0;
  for (auto &&a: A) sum += a;
  return sum;
}

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) \
  sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()

template <typename T>
T POP(deque<T> &que) {
  T a = que.front();
  que.pop_front();
  return a;
}
template <typename T>
T POP(pq<T> &que) {
  T a = que.top();
  que.pop();
  return a;
}
template <typename T>
T POP(pqg<T> &que) {
  assert(!que.empty());
  T a = que.top();
  que.pop();
  return a;
}
template <typename T>
T POP(vc<T> &que) {
  assert(!que.empty());
  T a = que.back();
  que.pop_back();
  return a;
}

template <typename F>
ll binary_search(F check, ll ok, ll ng) {
  assert(check(ok));
  while (abs(ok - ng) > 1) {
    auto x = (ng + ok) / 2;
    tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));
  }
  return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
  FOR(iter) {
    double x = (ok + ng) / 2;
    tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));
  }
  return (ok + ng) / 2;
}

template <class T, class S>
inline bool chmax(T &a, const S &b) {
  return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
  return (a > b ? a = b, 1 : 0);
}

// ? は -1
vc<int> s_to_vi(const string &S, char first_char) {
  vc<int> A(S.size());
  FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }
  return A;
}

template <typename T, typename U>
vector<T> cumsum(vector<U> &A, int off = 1) {
  int N = A.size();
  vector<T> B(N + 1);
  FOR(i, N) { B[i + 1] = B[i] + A[i]; }
  if (off == 0) B.erase(B.begin());
  return B;
}

// stable sort
template <typename T>
vector<int> argsort(const vector<T> &A) {
  vector<int> ids(len(A));
  iota(all(ids), 0);
  sort(all(ids),
       [&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });
  return ids;
}

// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
  vc<T> B(len(I));
  FOR(i, len(I)) B[i] = A[I[i]];
  return B;
}
#endif
#line 1 "library/other/io.hpp"
// based on yosupo's fastio
#include <unistd.h>

namespace fastio {
#define FASTIO
// クラスが read(), print() を持っているかを判定するメタ関数
struct has_write_impl {
  template <class T>
  static auto check(T &&x) -> decltype(x.write(), std::true_type{});

  template <class T>
  static auto check(...) -> std::false_type;
};

template <class T>
class has_write : public decltype(has_write_impl::check<T>(std::declval<T>())) {
};

struct has_read_impl {
  template <class T>
  static auto check(T &&x) -> decltype(x.read(), std::true_type{});

  template <class T>
  static auto check(...) -> std::false_type;
};

template <class T>
class has_read : public decltype(has_read_impl::check<T>(std::declval<T>())) {};

struct Scanner {
  FILE *fp;
  char line[(1 << 15) + 1];
  size_t st = 0, ed = 0;
  void reread() {
    memmove(line, line + st, ed - st);
    ed -= st;
    st = 0;
    ed += fread(line + ed, 1, (1 << 15) - ed, fp);
    line[ed] = '\0';
  }
  bool succ() {
    while (true) {
      if (st == ed) {
        reread();
        if (st == ed) return false;
      }
      while (st != ed && isspace(line[st])) st++;
      if (st != ed) break;
    }
    if (ed - st <= 50) {
      bool sep = false;
      for (size_t i = st; i < ed; i++) {
        if (isspace(line[i])) {
          sep = true;
          break;
        }
      }
      if (!sep) reread();
    }
    return true;
  }
  template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
  bool read_single(T &ref) {
    if (!succ()) return false;
    while (true) {
      size_t sz = 0;
      while (st + sz < ed && !isspace(line[st + sz])) sz++;
      ref.append(line + st, sz);
      st += sz;
      if (!sz || st != ed) break;
      reread();
    }
    return true;
  }
  template <class T, enable_if_t<is_integral<T>::value, int> = 0>
  bool read_single(T &ref) {
    if (!succ()) return false;
    bool neg = false;
    if (line[st] == '-') {
      neg = true;
      st++;
    }
    ref = T(0);
    while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }
    if (neg) ref = -ref;
    return true;
  }
  template <typename T,
            typename enable_if<has_read<T>::value>::type * = nullptr>
  inline bool read_single(T &x) {
    x.read();
    return true;
  }
  bool read_single(double &ref) {
    string s;
    if (!read_single(s)) return false;
    ref = std::stod(s);
    return true;
  }
  bool read_single(char &ref) {
    string s;
    if (!read_single(s) || s.size() != 1) return false;
    ref = s[0];
    return true;
  }
  template <class T>
  bool read_single(vector<T> &ref) {
    for (auto &d: ref) {
      if (!read_single(d)) return false;
    }
    return true;
  }
  template <class T, class U>
  bool read_single(pair<T, U> &p) {
    return (read_single(p.first) && read_single(p.second));
  }
  template <size_t N = 0, typename T>
  void read_single_tuple(T &t) {
    if constexpr (N < std::tuple_size<T>::value) {
      auto &x = std::get<N>(t);
      read_single(x);
      read_single_tuple<N + 1>(t);
    }
  }
  template <class... T>
  bool read_single(tuple<T...> &tpl) {
    read_single_tuple(tpl);
    return true;
  }
  void read() {}
  template <class H, class... T>
  void read(H &h, T &... t) {
    bool f = read_single(h);
    assert(f);
    read(t...);
  }
  Scanner(FILE *fp) : fp(fp) {}
};

struct Printer {
  Printer(FILE *_fp) : fp(_fp) {}
  ~Printer() { flush(); }

  static constexpr size_t SIZE = 1 << 15;
  FILE *fp;
  char line[SIZE], small[50];
  size_t pos = 0;
  void flush() {
    fwrite(line, 1, pos, fp);
    pos = 0;
  }
  void write(const char val) {
    if (pos == SIZE) flush();
    line[pos++] = val;
  }
  template <class T, enable_if_t<is_integral<T>::value, int> = 0>
  void write(T val) {
    if (pos > (1 << 15) - 50) flush();
    if (val == 0) {
      write('0');
      return;
    }
    if (val < 0) {
      write('-');
      val = -val; // todo min
    }
    size_t len = 0;
    while (val) {
      small[len++] = char(0x30 | (val % 10));
      val /= 10;
    }
    for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }
    pos += len;
  }
  void write(const string s) {
    for (char c: s) write(c);
  }
  void write(const char *s) {
    size_t len = strlen(s);
    for (size_t i = 0; i < len; i++) write(s[i]);
  }
  void write(const double x) {
    ostringstream oss;
    oss << fixed << setprecision(15) << x;
    string s = oss.str();
    write(s);
  }
  void write(const long double x) {
    ostringstream oss;
    oss << fixed << setprecision(15) << x;
    string s = oss.str();
    write(s);
  }
  template <typename T,
            typename enable_if<has_write<T>::value>::type * = nullptr>
  inline void write(T x) {
    x.write();
  }
  template <class T>
  void write(const vector<T> val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
      if (i) write(' ');
      write(val[i]);
    }
  }
  template <class T, class U>
  void write(const pair<T, U> val) {
    write(val.first);
    write(' ');
    write(val.second);
  }
  template <size_t N = 0, typename T>
  void write_tuple(const T t) {
    if constexpr (N < std::tuple_size<T>::value) {
      if constexpr (N > 0) { write(' '); }
      const auto x = std::get<N>(t);
      write(x);
      write_tuple<N + 1>(t);
    }
  }
  template <class... T>
  bool write(tuple<T...> tpl) {
    write_tuple(tpl);
    return true;
  }
  template <class T, size_t S>
  void write(const array<T, S> val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
      if (i) write(' ');
      write(val[i]);
    }
  }
  void write(i128 val) {
    string s;
    bool negative = 0;
    if (val < 0) {
      negative = 1;
      val = -val;
    }
    while (val) {
      s += '0' + int(val % 10);
      val /= 10;
    }
    if (negative) s += "-";
    reverse(all(s));
    if (len(s) == 0) s = "0";
    write(s);
  }
};
Scanner scanner = Scanner(stdin);
Printer printer = Printer(stdout);
void flush() { printer.flush(); }
void print() { printer.write('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
  printer.write(head);
  if (sizeof...(Tail)) printer.write(' ');
  print(forward<Tail>(tail)...);
}

void read() {}
template <class Head, class... Tail>
void read(Head &head, Tail &... tail) {
  scanner.read(head);
  read(tail...);
}
} // namespace fastio
using fastio::print;
using fastio::flush;
using fastio::read;

#define INT(...)   \
  int __VA_ARGS__; \
  read(__VA_ARGS__)
#define LL(...)   \
  ll __VA_ARGS__; \
  read(__VA_ARGS__)
#define STR(...)      \
  string __VA_ARGS__; \
  read(__VA_ARGS__)
#define CHAR(...)   \
  char __VA_ARGS__; \
  read(__VA_ARGS__)
#define DBL(...)      \
  double __VA_ARGS__; \
  read(__VA_ARGS__)

#define VEC(type, name, size) \
  vector<type> name(size);    \
  read(name)
#define VV(type, name, h, w)                     \
  vector<vector<type>> name(h, vector<type>(w)); \
  read(name)

void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 1 "library/string/run_length.hpp"
template <typename STRING = string, typename CHAR = char>
vc<pair<CHAR, int>> run_length(STRING& S) {
  vc<pair<CHAR, int>> res;
  for (auto&& x: S) {
    if (res.empty() || res.back().fi != x) { res.emplace_back(x, 0); }
    res.back().se++;
  }
  return res;
}
#line 4 "main.cpp"

// 部分文字列の種類数が最大であるような 01 文字列の構成
// https://qoj.ac/contest/1096/problem/5434?v=1
// https://www.mimuw.edu.pl/~rytter/MYPAPERS/paper.pdf
string substring_abundant_string(ll N) {
  ll N0 = N;
  N = 1;
  while ((1 << N) + (N - 1) < N0) ++N;

  string S = [&]() -> string {
    if (N == 1) return "01";
    if (N == 2) return "00110";

    auto SHIFT = [&](string x, string y) -> string {
      int n = len(x);
      x += x;
      FOR(i, n, n + n) {
        if (x.substr(i - len(y), len(y)) == y) { return x.substr(i - n, n); }
      }
      return "";
    };
    auto oplus = [&](string x, string y) -> string {
      int n = topbit(len(y));
      assert(len(x) == (1 << n) && len(y) == (1 << n));
      return x + SHIFT(y, x.substr(len(x) - n, n));
    };
    auto NOT = [&](string x) -> string {
      string y;
      for (auto&& s: x) y += (s == '0' ? '1' : '0');
      return y;
    };
    auto PSI = [&](string x) -> string {
      int a = 0;
      FOR(i, len(x)) {
        a ^= (x[i] - '0');
        x[i] = ('0' + a);
      }
      return x;
    };

    auto NEXT = [&](string x) -> string {
      x = PSI(x);
      return oplus(x, NOT(x));
    };

    auto otimes = [&](string x, string y) -> string {
      string t;
      FOR(topbit(len(x))) t += '0';
      x = SHIFT(x, t);
      y = SHIFT(y, t);
      rotate(x.begin(), x.end() - len(t), x.end());
      rotate(y.begin(), y.end() - len(t), y.end());

      int n = len(x);
      int x0 = 0, x1 = 0, y0 = 0, y1 = 1;
      for (auto&& [k, v]: run_length(x)) {
        if (k == '0') chmax(x0, v);
        if (k == '1') chmax(x1, v);
      }
      for (auto&& [k, v]: run_length(y)) {
        if (k == '0') chmax(y0, v);
        if (k == '1') chmax(y1, v);
      }
      string X, Y;
      for (auto&& [k, v]: run_length(x)) {
        if (k == '0' && v < x0) { X += string(v, k); }
        if (k == '0' && v == x0) { X += string(v - 1, k); }
        if (k == '1' && v < x1) { X += string(v, k); }
        if (k == '1' && v == x1) { X += string(v + 1, k); }
      }
      for (auto&& [k, v]: run_length(y)) {
        if (k == '0' && v < y0) { Y += string(v, k); }
        if (k == '0' && v == y0) { Y += string(v + 1, k); }
        if (k == '1' && v < y1) { Y += string(v, k); }
        if (k == '1' && v == y1) { Y += string(v - 1, k); }
      }
      return X + Y;
    };

    string x = "0011", y = "0011";
    FOR(i, 2, N - 1) {
      string t;
      FOR(i) t += '1';
      x = SHIFT(x, t);
      x = NEXT(x);
      y = SHIFT(y, t);
      y = NOT(NEXT(y));
    }
    x = otimes(x, y);
    FOR(i, N - 1) x += x[i];
    return x;
  }();
  return S.substr(0, N0);
}

void solve() {
  LL(N);
  print(substring_abundant_string(N));
}

signed main() {
  solve();
  return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3424kb

input:

2

output:

01

result:

ok meet maximum 3

Test #2:

score: 0
Accepted
time: 2ms
memory: 3424kb

input:

5

output:

00110

result:

ok meet maximum 12

Test #3:

score: 0
Accepted
time: 2ms
memory: 3416kb

input:

1

output:

0

result:

ok meet maximum 1

Test #4:

score: 0
Accepted
time: 2ms
memory: 3416kb

input:

3

output:

001

result:

ok meet maximum 5

Test #5:

score: 0
Accepted
time: 0ms
memory: 3432kb

input:

4

output:

0011

result:

ok meet maximum 8

Test #6:

score: 0
Accepted
time: 0ms
memory: 3448kb

input:

6

output:

011100

result:

ok meet maximum 16

Test #7:

score: 0
Accepted
time: 2ms
memory: 3424kb

input:

7

output:

0111000

result:

ok meet maximum 21

Test #8:

score: 0
Accepted
time: 2ms
memory: 3428kb

input:

8

output:

01110001

result:

ok meet maximum 27

Test #9:

score: 0
Accepted
time: 2ms
memory: 3372kb

input:

9

output:

011100010

result:

ok meet maximum 34

Test #10:

score: 0
Accepted
time: 2ms
memory: 3440kb

input:

10

output:

0111000101

result:

ok meet maximum 42

Test #11:

score: 0
Accepted
time: 1ms
memory: 3316kb

input:

11

output:

00101111000

result:

ok meet maximum 50

Test #12:

score: 0
Accepted
time: 1ms
memory: 3380kb

input:

12

output:

001011110000

result:

ok meet maximum 59

Test #13:

score: 0
Accepted
time: 21ms
memory: 5048kb

input:

200000

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 19996962278

Test #14:

score: 0
Accepted
time: 2ms
memory: 3448kb

input:

24

output:

000110101111100100000101

result:

ok meet maximum 240

Test #15:

score: 0
Accepted
time: 2ms
memory: 3488kb

input:

35

output:

00011010111110010000010100111011000

result:

ok meet maximum 526

Test #16:

score: 0
Accepted
time: 2ms
memory: 3376kb

input:

30

output:

000110101111100100000101001110

result:

ok meet maximum 381

Test #17:

score: 0
Accepted
time: 0ms
memory: 3496kb

input:

45

output:

000010011010001111110110010101110000001100010

result:

ok meet maximum 882

Test #18:

score: 0
Accepted
time: 2ms
memory: 3424kb

input:

66

output:

000010011010001111110110010101110000001100010110111100111010100100

result:

ok meet maximum 1953

Test #19:

score: 0
Accepted
time: 2ms
memory: 3368kb

input:

50

output:

00001001101000111111011001010111000000110001011011

result:

ok meet maximum 1097

Test #20:

score: 0
Accepted
time: 2ms
memory: 3500kb

input:

80

output:

00000111011000010100100011001011111110001001111010101101110011010000000100001101

result:

ok meet maximum 2901

Test #21:

score: 0
Accepted
time: 0ms
memory: 3500kb

input:

107

output:

00000111011000010100100011001011111110001001111010101101110011010000000100001101101011101001100011111011110

result:

ok meet maximum 5277

Test #22:

score: 0
Accepted
time: 2ms
memory: 3336kb

input:

81

output:

000001110110000101001000110010111111100010011110101011011100110100000001000011011

result:

ok meet maximum 2976

Test #23:

score: 0
Accepted
time: 2ms
memory: 3380kb

input:

147

output:

000000101101111100111000010001101010000111010110011011010001001111111101001000001100011110111001010101111000101001100100101110110000000011111011011

result:

ok meet maximum 10124

Test #24:

score: 0
Accepted
time: 1ms
memory: 3424kb

input:

255

output:

000000101101111100111000010001101010000111010110011011010001001111111101001000001100011110111001010101111000101001100100101110110000000011111011011001011000100001010110101110001100111100100010111111000001001001101001110111101010100101000111001100001101110

result:

ok meet maximum 31130

Test #25:

score: 0
Accepted
time: 0ms
memory: 3484kb

input:

173

output:

00000010110111110011100001000110101000011101011001101101000100111111110100100000110001111011100101010111100010100110010010111011000000001111101101100101100010000101011010111

result:

ok meet maximum 14115

Test #26:

score: 0
Accepted
time: 2ms
memory: 3500kb

input:

288

output:

000000011011010100010111110000100110000010110010001001001111000101010011100000010000101001011100110010100001100010001110010110111111111001001010111010000011110110011111010011011101101100001110101010110001111110111101011010001100110101111001110111000110100100000000010101101101110010000111

result:

ok meet maximum 39850

Test #27:

score: 0
Accepted
time: 1ms
memory: 3568kb

input:

407

output:

000000011011010100010111110000100110000010110010001001001111000101010011100000010000101001011100110010100001100010001110010110111111111001001010111010000011110110011111010011011101101100001110101010110001111110111101011010001100110101111001110111000110100100000000010101101101110010000111110011011001...

result:

ok meet maximum 80310

Test #28:

score: 0
Accepted
time: 0ms
memory: 3428kb

input:

349

output:

000000011011010100010111110000100110000010110010001001001111000101010011100000010000101001011100110010100001100010001110010110111111111001001010111010000011110110011111010011011101101100001110101010110001111110111101011010001100110101111001110111000110100100000000010101101101110010000111110011011001...

result:

ok meet maximum 58821

Test #29:

score: 0
Accepted
time: 2ms
memory: 3332kb

input:

526

output:

000000001001001100001101010000011101111110010001111000111010111100110001011111110000011000110100010001100000100001111010001101101010100011100110100111111010110111010100111011010010010000010110011001000010101001010011011000010001001101011101001011110110001111111111011011001111001010111110001000000110...

result:

ok meet maximum 134925

Test #30:

score: 0
Accepted
time: 2ms
memory: 3548kb

input:

1018

output:

000000001001001100001101010000011101111110010001111000111010111100110001011111110000011000110100010001100000100001111010001101101010100011100110100111111010110111010100111011010010010000010110011001000010101001010011011000010001001101011101001011110110001111111111011011001111001010111110001000000110...

result:

ok meet maximum 510567

Test #31:

score: 0
Accepted
time: 0ms
memory: 3384kb

input:

1017

output:

000000001001001100001101010000011101111110010001111000111010111100110001011111110000011000110100010001100000100001111010001101101010100011100110100111111010110111010100111011010010010000010110011001000010101001010011011000010001001101011101001011110110001111111111011011001111001010111110001000000110...

result:

ok meet maximum 509558

Test #32:

score: 0
Accepted
time: 2ms
memory: 3356kb

input:

1209

output:

000000000111000100000100110000001011010101110000101000010110010100010000110101010000001000010011110000100000011111010110000100100110011110100010011101010110010010110011101001001110001111110010001000111110011000110001001000001111000100110100111001010010000101010100100100010100011001010111100000001001...

result:

ok meet maximum 721446

Test #33:

score: 0
Accepted
time: 0ms
memory: 3436kb

input:

1632

output:

000000000111000100000100110000001011010101110000101000010110010100010000110101010000001000010011110000100000011111010110000100100110011110100010011101010110010010110011101001001110001111110010001000111110011000110001001000001111000100110100111001010010000101010100100100010100011001010111100000001001...

result:

ok meet maximum 1318299

Test #34:

score: 0
Accepted
time: 2ms
memory: 3500kb

input:

1829

output:

000000000111000100000100110000001011010101110000101000010110010100010000110101010000001000010011110000100000011111010110000100100110011110100010011101010110010010110011101001001110001111110010001000111110011000110001001000001111000100110100111001010010000101010100100100010100011001010111100000001001...

result:

ok meet maximum 1657336

Test #35:

score: 0
Accepted
time: 1ms
memory: 3580kb

input:

3187

output:

000000000010111100000011101111111001001100101111100111110010001100001111101100110000000111110001010000011111110101001101111100011101110101100001110100110010001110010001011000111010000101010001111000010101110111101111000111111010111100010011101000110001111100110011100011110011110111001101011111111000...

result:

ok meet maximum 5049170

Test #36:

score: 0
Accepted
time: 2ms
memory: 3444kb

input:

2138

output:

000000000010111100000011101111111001001100101111100111110010001100001111101100110000000111110001010000011111110101001101111100011101110101100001110100110010001110010001011000111010000101010001111000010101110111101111000111111010111100010011101000110001111100110011100011110011110111001101011111111000...

result:

ok meet maximum 2267222

Test #37:

score: 0
Accepted
time: 2ms
memory: 3608kb

input:

4030

output:

000000000010111100000011101111111001001100101111100111110010001100001111101100110000000111110001010000011111110101001101111100011101110101100001110100110010001110010001011000111010000101010001111000010101110111101111000111111010111100010011101000110001111100110011100011110011110111001101011111111000...

result:

ok meet maximum 8082284

Test #38:

score: 0
Accepted
time: 2ms
memory: 3480kb

input:

6101

output:

000000000001101011111110100101010111000100011010100010101110000100000101011011101111111101010000110000001010101100111011010100001011010011011111010011101110000101110000110111101001111100110000101000001100101101011010111101010110010100001110100111101111010100010001011110101110101101000100110101010111...

result:

ok meet maximum 18549195

Test #39:

score: 0
Accepted
time: 2ms
memory: 3604kb

input:

5917

output:

000000000001101011111110100101010111000100011010100010101110000100000101011011101111111101010000110000001010101100111011010100001011010011011111010011101110000101110000110111101001111100110000101000001100101101011010111101010110010100001110100111101111010100010001011110101110101101000100110101010111...

result:

ok meet maximum 17445655

Test #40:

score: 0
Accepted
time: 2ms
memory: 3412kb

input:

6635

output:

000000000001101011111110100101010111000100011010100010101110000100000101011011101111111101010000110000001010101100111011010100001011010011011111010011101110000101110000110111101001111100110000101000001100101101011010111101010110010100001110100111101111010100010001011110101110101101000100110101010111...

result:

ok meet maximum 21943566

Test #41:

score: 0
Accepted
time: 2ms
memory: 3700kb

input:

9993

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 49821572

Test #42:

score: 0
Accepted
time: 0ms
memory: 3464kb

input:

14474

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 104583873

Test #43:

score: 0
Accepted
time: 2ms
memory: 3636kb

input:

11534

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 66388863

Test #44:

score: 0
Accepted
time: 3ms
memory: 3584kb

input:

19098

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 182141836

Test #45:

score: 0
Accepted
time: 0ms
memory: 3536kb

input:

31872

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 507514777

Test #46:

score: 0
Accepted
time: 3ms
memory: 3608kb

input:

27626

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 381257844

Test #47:

score: 0
Accepted
time: 5ms
memory: 3780kb

input:

43245

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 934503599

Test #48:

score: 0
Accepted
time: 5ms
memory: 3716kb

input:

34491

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 594380060

Test #49:

score: 0
Accepted
time: 5ms
memory: 3620kb

input:

64535

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 2081512994

Test #50:

score: 0
Accepted
time: 11ms
memory: 4100kb

input:

65746

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 2160380385

Test #51:

score: 0
Accepted
time: 10ms
memory: 4104kb

input:

65861

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 2167946005

Test #52:

score: 0
Accepted
time: 10ms
memory: 4044kb

input:

66725

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 2225209765

Test #53:

score: 0
Accepted
time: 10ms
memory: 4076kb

input:

86349

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 3726867681

Test #54:

score: 0
Accepted
time: 10ms
memory: 3928kb

input:

68454

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 2342045211

Test #55:

score: 0
Accepted
time: 10ms
memory: 4124kb

input:

112260

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 6299544960

Test #56:

score: 0
Accepted
time: 1ms
memory: 4052kb

input:

108023

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 5832941098

Test #57:

score: 0
Accepted
time: 10ms
memory: 4076kb

input:

103787

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 5384393176

Test #58:

score: 0
Accepted
time: 10ms
memory: 4112kb

input:

128710

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 8281268235

Test #59:

score: 0
Accepted
time: 10ms
memory: 4132kb

input:

129534

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 8387651991

Test #60:

score: 0
Accepted
time: 1ms
memory: 4200kb

input:

128670

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 8276121255

Test #61:

score: 0
Accepted
time: 21ms
memory: 5140kb

input:

154721

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 11967003302

Test #62:

score: 0
Accepted
time: 17ms
memory: 5060kb

input:

143149

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 10243718420

Test #63:

score: 0
Accepted
time: 20ms
memory: 5008kb

input:

134065

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 8984762318

Test #64:

score: 0
Accepted
time: 17ms
memory: 4932kb

input:

163454

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 13356170345

Test #65:

score: 0
Accepted
time: 15ms
memory: 5004kb

input:

139150

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 9679327553

Test #66:

score: 0
Accepted
time: 21ms
memory: 5084kb

input:

172380

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 14854850208

Test #67:

score: 0
Accepted
time: 14ms
memory: 4936kb

input:

178166

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 15868884317

Test #68:

score: 0
Accepted
time: 20ms
memory: 4932kb

input:

143651

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 10315696937

Test #69:

score: 0
Accepted
time: 22ms
memory: 5004kb

input:

198199

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 19638413795

Test #70:

score: 0
Accepted
time: 12ms
memory: 4992kb

input:

186272

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 17345817782

Test #71:

score: 0
Accepted
time: 21ms
memory: 5068kb

input:

198102

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 19619194797

Test #72:

score: 0
Accepted
time: 0ms
memory: 3484kb

input:

8201

output:

000000000001101011111110100101010111000100011010100010101110000100000101011011101111111101010000110000001010101100111011010100001011010011011111010011101110000101110000110111101001111100110000101000001100101101011010111101010110010100001110100111101111010100010001011110101110101101000100110101010111...

result:

ok meet maximum 33542145

Test #73:

score: 0
Accepted
time: 0ms
memory: 3492kb

input:

8202

output:

000000000001101011111110100101010111000100011010100010101110000100000101011011101111111101010000110000001010101100111011010100001011010011011111010011101110000101110000110111101001111100110000101000001100101101011010111101010110010100001110100111101111010100010001011110101110101101000100110101010111...

result:

ok meet maximum 33550335

Test #74:

score: 0
Accepted
time: 2ms
memory: 3576kb

input:

8203

output:

000000000001101011111110100101010111000100011010100010101110000100000101011011101111111101010000110000001010101100111011010100001011010011011111010011101110000101110000110111101001111100110000101000001100101101011010111101010110010100001110100111101111010100010001011110101110101101000100110101010111...

result:

ok meet maximum 33558526

Test #75:

score: 0
Accepted
time: 2ms
memory: 3524kb

input:

8204

output:

000000000001101011111110100101010111000100011010100010101110000100000101011011101111111101010000110000001010101100111011010100001011010011011111010011101110000101110000110111101001111100110000101000001100101101011010111101010110010100001110100111101111010100010001011110101110101101000100110101010111...

result:

ok meet maximum 33566718

Test #76:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

8205

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 33574910

Test #77:

score: 0
Accepted
time: 2ms
memory: 3544kb

input:

8206

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 33583103

Test #78:

score: 0
Accepted
time: 1ms
memory: 3552kb

input:

16394

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 134193153

Test #79:

score: 0
Accepted
time: 1ms
memory: 3708kb

input:

16395

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 134209535

Test #80:

score: 0
Accepted
time: 0ms
memory: 3636kb

input:

16396

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 134225918

Test #81:

score: 0
Accepted
time: 3ms
memory: 3688kb

input:

16397

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 134242302

Test #82:

score: 0
Accepted
time: 3ms
memory: 3652kb

input:

16398

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 134258686

Test #83:

score: 0
Accepted
time: 1ms
memory: 3476kb

input:

16399

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 134275071

Test #84:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

32779

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 536821761

Test #85:

score: 0
Accepted
time: 3ms
memory: 3624kb

input:

32780

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 536854527

Test #86:

score: 0
Accepted
time: 3ms
memory: 3760kb

input:

32781

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 536887294

Test #87:

score: 0
Accepted
time: 2ms
memory: 3640kb

input:

32782

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 536920062

Test #88:

score: 0
Accepted
time: 5ms
memory: 3784kb

input:

32783

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 536952830

Test #89:

score: 0
Accepted
time: 4ms
memory: 3768kb

input:

32784

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 536985599

Test #90:

score: 0
Accepted
time: 5ms
memory: 3624kb

input:

65548

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 2147385345

Test #91:

score: 0
Accepted
time: 5ms
memory: 3608kb

input:

65549

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 2147450879

Test #92:

score: 0
Accepted
time: 7ms
memory: 3712kb

input:

65550

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 2147516414

Test #93:

score: 0
Accepted
time: 2ms
memory: 3728kb

input:

65551

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 2147581950

Test #94:

score: 0
Accepted
time: 6ms
memory: 4044kb

input:

65552

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 2147647486

Test #95:

score: 0
Accepted
time: 10ms
memory: 4100kb

input:

65553

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 2147713023

Test #96:

score: 0
Accepted
time: 10ms
memory: 4008kb

input:

131085

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 8589737985

Test #97:

score: 0
Accepted
time: 6ms
memory: 4204kb

input:

131086

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 8589869055

Test #98:

score: 0
Accepted
time: 6ms
memory: 4016kb

input:

131087

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 8590000126

Test #99:

score: 0
Accepted
time: 11ms
memory: 4200kb

input:

131088

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 8590131198

Test #100:

score: 0
Accepted
time: 21ms
memory: 5104kb

input:

131089

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 8590262270

Test #101:

score: 0
Accepted
time: 18ms
memory: 5072kb

input:

131090

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 8590393343

Test #102:

score: 0
Accepted
time: 2ms
memory: 3516kb

input:

8197

output:

000000000001101011111110100101010111000100011010100010101110000100000101011011101111111101010000110000001010101100111011010100001011010011011111010011101110000101110000110111101001111100110000101000001100101101011010111101010110010100001110100111101111010100010001011110101110101101000100110101010111...

result:

ok meet maximum 33509395

Test #103:

score: 0
Accepted
time: 3ms
memory: 3512kb

input:

16328

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 133114152

Test #104:

score: 0
Accepted
time: 3ms
memory: 3712kb

input:

32608

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 531233481

Test #105:

score: 0
Accepted
time: 6ms
memory: 3720kb

input:

65141

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 2120796035

Test #106:

score: 0
Accepted
time: 5ms
memory: 4056kb

input:

130420

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 8502797880

Test #107:

score: 0
Accepted
time: 3ms
memory: 3472kb

input:

8265

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 34068260

Test #108:

score: 0
Accepted
time: 3ms
memory: 3532kb

input:

16508

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 136067031

Test #109:

score: 0
Accepted
time: 3ms
memory: 3768kb

input:

33008

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 544351055

Test #110:

score: 0
Accepted
time: 5ms
memory: 4048kb

input:

65964

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 2174733396

Test #111:

score: 0
Accepted
time: 21ms
memory: 5088kb

input:

131692

output:

000000000000000010010011100111101101111100000000100100010111001011011101111011001001001110010101101000011110011111101111100101011010001100001011111011010111001011011111000010111110011011000010110101001011000010011010110010011010100010111011111001101100100110101010010101111110010000101110110101100101...

result:

ok meet maximum 8669480792

Test #112:

score: 0
Accepted
time: 1ms
memory: 3512kb

input:

15843

output:

000000000000100110101010011100110010111100001001100001100101111100000011001001011010101011001111101111111001100100010110110011111001001110110101001110100101111100101111101101011000101011101111100111111011100100110110010100110010001100000101100010100101001100001111001010011010011011000011101100110010...

result:

ok meet maximum 125318747

Test #113:

score: 0
Accepted
time: 3ms
memory: 3660kb

input:

31560

output:

000000000000011101100110001011101110010100000111011111011100101011111110111000110110011001000101011010101000100011110010010001010111000101101100111010011100101011100101011011001000011001011010100010101001011100010010001100010001111011111100100001100011000100000101000110001001110110111110100100010001...

result:

ok meet maximum 497623597

Test #114:

score: 0
Accepted
time: 2ms
memory: 3672kb

input:

64241

output:

000000000000001011011101111001011010001100000010110101001011100110101010010111101101110111000011001001100111100001010001110000110010111100100100010110001011100110100011001001000111110111001001100001100111001011110001111011110000101001010100011111011110111100000011000010000111010010010101100011110000...

result:

ok meet maximum 2062587185

Test #115:

score: 0
Accepted
time: 6ms
memory: 3964kb

input:

73307

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 2685953056

Test #116:

score: 0
Accepted
time: 6ms
memory: 4176kb

input:

129593

output:

000000000000000110110100101000110110000100000001101100111001011101100110001101011011010010111110111000100010100000110000101111101110010100011100001101111001011101100001000111000010101101000111011111011101000110101111010110101111100111001100001010110101101011111110111110000010110001110011011110101111...

result:

ok meet maximum 8395295323