Submission #70487135

---

Source Code Expand

// 30 bits, too tight...

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int lis(const(int[]) as) {
  int[] dp;
  foreach (a; as) {
    const pos = dp.lowerBound(a);
    if (pos < dp.length) {
      dp[pos] = a;
    } else {
      dp ~= a;
    }
  }
  return cast(int)(dp.length);
}

alias Ans = Tuple!(int[], "ps", int[], "as");
Ans solveSmall(int N) {
  const E = bsr(N) + 1;
  auto fs = new int[E];
  foreach (i; 1 .. N + 1) ++fs[bsf(i)];
  
  auto cuts = new int[E + 1];
  foreach (e; 0 .. E) {
    cuts[e + 1] = cuts[e] + (bsr(fs[e]) + 1);
  }
  int[] ps;
  foreach (e; 0 .. E) {
    foreach (i; 0 .. fs[e]) {
      ps ~= (i + 1) << cuts[e];
    }
  }
  
  auto as = new int[N + 1];
  foreach (k; 1 .. N + 1) {
    auto used = new bool[E];
    int kk = k;
    foreach (e; 0 .. E) {
      if (kk >= fs[e]) {
        kk -= fs[e];
        used[e] = true;
      } else {
        if (e == 0) kk -= 1;
      }
    }
    assert(kk == 0);
    foreach (e; 0 .. E) if (!used[e]) {
      as[k] |= (1 << cuts[e + 1]) - (1 << cuts[e]);
    }
  }
  debug {
    writeln("N = ", N);
    writeln("fs = ", fs);
    writeln("ps = ", ps);
    writeln("as = ", as);
    foreach (p; ps) {
      foreach_reverse (e; 0 .. cuts[E]) write(p >> e & 1);
      writeln;
    }
    foreach (k; 1 .. N + 1) {
      auto qs = new int[N];
      foreach (j; 0 .. N) qs[j] = as[k] | ps[j];
      const res = lis(qs);
      assert(res == k, format("FAIL %s %s %s", k, res, qs));
    }
  }
  return Ans(ps, as);
}

Ans solve(int N) {
  int[] fs;
  for (int n = N; n; ) {
    const lim = (n + 1) / 2;
    const e = bsr(lim);
    fs ~= 1 << e;
    n -= (1 << e);
  }
  const E = cast(int)(fs.length);
  debug writefln("N = %s: fs = %s", N, fs);
  
  int[] ps;
  foreach (e; 0 .. E) {
    foreach (i; 0 .. fs[e]) ps ~= fs[0] << e | i;
  }
  ps.sort;
  assert(ps.length == N);
  assert(0 <= ps[0]); assert(ps[N - 1] < 2^^30);
  
  auto as = new int[N + 1];
  foreach (k; 1 .. N + 1) {
    // m ni tsubusu
    for (int m = fs[0]; ; m /= 2) {
      assert(m);
      auto used = new bool[E];
      int kk = k;
      foreach (e; 0 .. E) {
        const f = min(fs[e], m);
        if (kk >= f) {
          kk -= f;
          used[e] = true;
        }
      }
      if (used[0]) {
        foreach (e; 0 .. E) if (!used[e]) {
          as[k] |= fs[0] << e;
        }
        foreach (e; bsr(m) .. bsr(fs[0])) {
          as[k] |= 1 << e;
        }
        break;
      }
    }
  }
  debug {
    /*
    writeln("N = ", N);
    writeln("fs = ", fs);
    writeln("ps = ", ps);
    writeln("as = ", as);
    const limE = bsr(ps.maxElement) + 1;
    foreach (p; ps) {
      foreach_reverse (e; 0 .. limE) write(p >> e & 1);
      writeln;
    }
    //*/
    foreach (k; 1 .. N + 1) {
      auto qs = new int[N];
      foreach (j; 0 .. N) qs[j] = as[k] | ps[j];
      const res = lis(qs);
      assert(res == k, format("FAIL %s %s %s", k, res, qs));
    }
  }
  return Ans(ps, as);
}

void main() {
  debug {{
    // exper; return;
    // exper2; return;
    foreach (N; 1 .. 1000 + 1) {
      solve(N);
    }
  }}
  
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readInt;
        
        const ans = solve(N);
        foreach (i; 0 .. N) {
          if (i) write(" ");
          write(ans.ps[i]);
        }
        writeln;
        foreach (k; 1 .. N + 1) {
          if (k > 1) write(" ");
          write(ans.as[k]);
        }
        writeln;
      }
    }
  } catch (EOFException e) {
  }
}

Submission Info

Judge Result