結果

問題 No.1919 Many Monster Battles
ユーザー 👑 hos.lyrichos.lyric
提出日時 2022-04-29 22:19:37
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 854 ms / 2,000 ms
コード長 5,567 bytes
コンパイル時間 1,851 ms
コンパイル使用メモリ 171,368 KB
実行使用メモリ 38,732 KB
最終ジャッジ日時 2024-06-22 15:01:19
合計ジャッジ時間 18,147 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

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

struct ModInt(uint M_) {
  import std.conv : to;
  alias M = M_;
  uint x;
  this(ModInt a) { x = a.x; }
  this(uint x_) { x = x_ % M; }
  this(ulong x_) { x = x_ % M; }
  this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }
  this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }
  ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }
  ref ModInt opOpAssign(string op, T)(T a) {
    static if (is(T == ModInt)) {
      static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }
      else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }
      else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }
      else static if (op == "/") { this *= a.inv(); }
      else static assert(false);
      return this;
    } else static if (op == "^^") {
      if (a < 0) return this = inv()^^(-a);
      ModInt b = this, c = 1U;
      for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }
      return this = c;
    } else {
      return mixin("this " ~ op ~ "= ModInt(a)");
    }
  }
  ModInt inv() const {
    uint a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }
    assert(a == 1); return ModInt(y);
  }
  ModInt opUnary(string op)() const {
    static if (op == "+") { return this; }
    else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }
    else static assert(false);
  }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  bool opCast(T: bool)() const { return (x != 0U); }
  string toString() const { return x.to!string; }
}

enum MO = 10^^9 + 7;
alias Mint = ModInt!MO;


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


alias Pt = Tuple!(long, "a", long, "b");

int N;
Pt[] P;

Mint solve() {
  P.sort!((p, q) => (p.a < q.a));
  debug {
    writeln("P = ", P);
  }
  
  auto xs = new long[N];
  auto ys = new long[N];
  foreach (i; 0 .. N) {
    xs[i] = -P[i].a + P[i].b;
    ys[i] = -P[i].a - P[i].b;
  }
  xs = xs.sort.uniq.array;
  ys = ys.sort.uniq.array;
  const xsLen = cast(int)(xs.length);
  const ysLen = cast(int)(ys.length);
  debug {
    writeln("  xs = ", xs);
    writeln("  ys = ", ys);
  }
  
  Mint tot1, totA;
  auto bitX1 = new Mint[xsLen];
  auto bitXA = new Mint[xsLen];
  auto bitY1 = new Mint[ysLen];
  auto bitYA = new Mint[ysLen];
  
  Mint ans;
  for (int i = 0, j; i < N; i = j) {
    for (j = i; j < N && P[i].a == P[j].a; ++j) {}
    foreach (ref p; P[i .. j]) {
      const posX = xs.upperBound(-p.a + p.b);
      const posY = ys.upperBound(-p.a - p.b);
      const resX1 = bitX1.bSum(posX);
      const resXA = bitXA.bSum(posX);
      const resY1 = bitY1.bSum(posY);
      const resYA = bitYA.bSum(posY);
      debug {
        writeln("  get ", p, " ", [posX, posY], " ", [tot1 - resX1 - resY1, totA - resXA - resYA]);
      }
      ans += (tot1 - resX1 - resY1) * p.a;
      ans -= (totA - resXA - resYA);
    }
    foreach (ref p; P[i .. j]) {
      const posX = xs.lowerBound(-p.a + p.b);
      const posY = ys.lowerBound(-p.a - p.b);
      debug {
        writeln("  add ", p, " ", [posX, posY]);
      }
      tot1 += 1;
      totA += p.a;
      bitX1.bAdd(posX, Mint(1));
      bitXA.bAdd(posX, Mint(p.a));
      bitY1.bAdd(posY, Mint(1));
      bitYA.bAdd(posY, Mint(p.a));
    }
  }
  ans *= 2;
  return ans;
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      P = new Pt[N];
      foreach (i; 0 .. N) P[i].a = readLong;
      foreach (i; 0 .. N) P[i].b = readLong;
      
      const ansA = solve;
      foreach (i; 0 .. N) swap(P[i].a, P[i].b);
      const ansB = solve;
      foreach (i; 0 .. N) swap(P[i].a, P[i].b);
      writeln(ansA, " ", ansB);
    }
  } catch (EOFException e) {
  }
}
0