結果

問題 No.2719 Equal Inner Products in Permutation
ユーザー 👑 hos.lyric
提出日時 2024-04-05 22:06:00
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 275 ms / 2,000 ms
コード長 2,718 bytes
コンパイル時間 2,627 ms
コンパイル使用メモリ 118,204 KB
実行使用メモリ 8,192 KB
最終ジャッジ日時 2024-10-01 02:22:46
合計ジャッジ時間 8,576 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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[] solve(int N) {
  if (N == 1) return null;
  int[] as, bs;
  final switch (N % 4) {
    case 2: {
      as = [1, 4];
      bs = [5, 2];
    } break;
    case 3: {
      as = [1, 2, 8];
      bs = [7, 5, 4];
    } break;
    case 0: {
      as = [1, 2, 5, 11];
      bs = [10, 7, 8, 4];
    } break;
    case 1: {
      as = [1, 2, 4, 8, 14];
      bs = [13, 10, 11, 7, 5];
    } break;
  }
  int n = cast(int)(as.length);
  for (; n < N; n += 4) {
    as ~= [3 * n + 1, 3 * n + 5, 3 * n + 8, 3 * n + 10];
    bs ~= [3 * n + 2, 3 * n + 4, 3 * n + 7, 3 * n + 11];
  }
  int[] ans;
  ans ~= as;
  foreach (i; 1 .. N + 1) ans ~= 3 * i;
  ans ~= bs;
  return ans;
}
void main() {
  debug {{
    foreach (n; 1 .. 5 + 1) {
      int[] xs;
      foreach (x; 1 .. 3 * n + 1) if (x % 3 != 0) xs ~= x;
      do {
        int sum;
        foreach (i; 0 .. n) sum += (i + 1) * (xs[i] - xs[n + i]);
        if (sum == 0) {
          writeln(xs);
          break;
        }
      } while (xs.nextPermutation);
    }
    
    foreach (n; 2 .. 10 + 1) {
      const ans = solve(n);
      int sum;
      foreach (i; 0 .. n) sum += ans[n + i] * (ans[i] - ans[2 * n + i]);
      assert(sum == 0, format("%s: %s %s", n, sum, ans));
    }
  }}
  
  try {
    for (; ; ) {
      const N = readInt;
      
      const ans = solve(N);
      if (ans) {
        foreach (i; 0 .. 3 * N) {
          if (i) write(" ");
          write(ans[i]);
        }
        writeln;
      } else {
        writeln(-1);
      }
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0