結果

問題 No.2029 Swap Min Max Min
ユーザー 👑 hos.lyrichos.lyric
提出日時 2022-08-05 22:20:15
言語 D
(dmd 2.109.1)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 3,513 bytes
コンパイル時間 818 ms
コンパイル使用メモリ 121,336 KB
実行使用メモリ 20,908 KB
最終ジャッジ日時 2024-06-22 15:58:17
合計ジャッジ時間 4,625 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2 WA * 1
other AC * 31 WA * 11
権限があれば一括ダウンロードができます

ソースコード

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; }
real readReal() { return readToken.to!real; }

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)); }


void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T ret = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    ret += bit[x];
  }
  return ret;
}


long solve(const(int[]) A, const(int[]) B) {
  const N = cast(int)(A.length);
  auto pos = new int[N];
  foreach (i; 0 .. N) {
    pos[B[i]] = i;
  }
  long cost;
  auto bit = new long[N];
  foreach (i; 0 .. N) {
    const x = pos[A[i]];
    cost += (i - bit.bSum(x));
    bit.bAdd(x, 1);
  }
  return cost;
}

void main() {
  /*
  debug {
    foreach (n; 1 .. 8 + 1) {
      int mn = int.max;
      int[][] pmss;
      auto ps = iota(n).array;
      do {
        int mx;
        foreach (i; 0 .. n - 1) {
          chmax(mx, min(ps[i], ps[i + 1]));
        }
        if (chmin(mn, mx)) {
          pmss = [];
        }
        if (mn == mx) {
          pmss ~= ps.dup;
        }
      } while (ps.nextPermutation);
      stderr.writeln(n, ": ", mn, " ", pmss.length);
      stderr.flush;
      foreach (pms; pmss) {
        writeln(pms);
      }
      stdout.flush;
    }
    return;
  }
  */
  
  try {
    for (; ; ) {
      const N = readInt;
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt - 1;
      }
      
      const thr = (N - 2) / 2;
      int[] smalls, larges;
      foreach (a; A) {
        if (a <= thr) {
          smalls ~= a;
        } else {
          larges ~= a;
        }
      }
      
      long ans = long.max;
      if (N % 2 != 0) {
        int[] bs;
        foreach (i; 0 .. N / 2) {
          bs ~= larges[i];
          bs ~= smalls[i];
        }
        bs ~= larges[N / 2];
        chmin(ans, solve(A, bs));
      } else {
        foreach (s; 0 .. 2) {
          int[] bs;
          foreach (i; 0 .. N / 2) {
            if (s) {
              bs ~= larges[i];
              bs ~= smalls[i];
            } else {
              bs ~= smalls[i];
              bs ~= larges[i];
            }
          }
          chmin(ans, solve(A, bs));
        }
      }
      writeln(thr + 1, " ", ans);
    }
  } catch (EOFException e) {
  }
}
0