#542259 (D) No.1201 お菓子配り-4

提出ソース

結果

問題	No.1201 お菓子配り-4
ユーザー	👑 hos.lyric
提出日時	2020-08-28 22:20:20
言語	D (dmd 2.106.1)
結果	AC
実行時間	639 ms / 4,000 ms
コード長	4,858 bytes
コンパイル時間	1,439 ms
コンパイル使用メモリ	155,468 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-22 08:27:06
合計ジャッジ時間	9,257 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	23 ms 6,816 KB
testcase_01	AC	302 ms 6,940 KB
testcase_02	AC	438 ms 6,940 KB
testcase_03	AC	214 ms 6,944 KB
testcase_04	AC	108 ms 6,940 KB
testcase_05	AC	266 ms 6,944 KB
testcase_06	AC	42 ms 6,940 KB
testcase_07	AC	124 ms 6,944 KB
testcase_08	AC	331 ms 6,940 KB
testcase_09	AC	237 ms 6,944 KB
testcase_10	AC	3 ms 6,940 KB
testcase_11	AC	62 ms 6,944 KB
testcase_12	AC	498 ms 6,940 KB
testcase_13	AC	15 ms 6,940 KB
testcase_14	AC	8 ms 6,940 KB
testcase_15	AC	390 ms 6,944 KB
testcase_16	AC	121 ms 6,940 KB
testcase_17	AC	153 ms 6,944 KB
testcase_18	AC	27 ms 6,944 KB
testcase_19	AC	24 ms 6,944 KB
testcase_20	AC	1 ms 6,940 KB
testcase_21	AC	1 ms 6,944 KB
testcase_22	AC	1 ms 6,940 KB
testcase_23	AC	1 ms 6,940 KB
testcase_24	AC	1 ms 6,944 KB
testcase_25	AC	1 ms 6,940 KB
testcase_26	AC	1 ms 6,944 KB
testcase_27	AC	2 ms 6,944 KB
testcase_28	AC	1 ms 6,944 KB
testcase_29	AC	1 ms 6,944 KB
testcase_30	AC	629 ms 6,940 KB
testcase_31	AC	635 ms 6,940 KB
testcase_32	AC	627 ms 6,944 KB
testcase_33	AC	639 ms 6,940 KB
testcase_34	AC	634 ms 6,944 KB
testcase_35	AC	293 ms 6,944 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`

ソースコード

raw source code

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(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 1000000007;
alias Mint = ModInt!MO;


// floor(a / b)
Int divFloor(Int)(Int a, Int b) {
  return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}

// sum_{x=l}^r floor((a x + b) / m)
// m > 0
/*
long sumFloors(long m, long a, long b, long l, long r)
in {
  assert(m > 0, "sumFloors: m > 0 must hold");
}
do {
  long sum;
  for (; l <= r; ) {
    const q = divFloor(a, m);
    const aa = a - q * m;
    const ll = divFloor(aa * l + b, m) + 1;
    const rr = divFloor(aa * r + b, m);
    sum += q * ((r + 1) * r / 2 - l * (l - 1) / 2) + r * rr - (l - 1) * (ll - 1) + (rr - ll + 1);
    a = m; m = aa; l = -rr; r = -ll;
  }
  return sum;
}
*/
Mint sumFloors(long m, long a, long b, long l, long r)
in {
  assert(m > 0, "sumFloors: m > 0 must hold");
}
do {
  Mint sum;
  for (; l <= r; ) {
    const q = divFloor(a, m);
    const aa = a - q * m;
    const ll = divFloor(aa * l + b, m) + 1;
    const rr = divFloor(aa * r + b, m);
    sum += Mint(q) * Mint((r + 1) * r / 2 - l * (l - 1) / 2) + Mint(r) * Mint(rr) - Mint(l - 1) * Mint(ll - 1) + Mint(rr - ll + 1);
    a = m; m = aa; l = -rr; r = -ll;
  }
  return sum;
}


Mint solve(long a, long b) {
  const d = gcd(a, b);
  const aa = a / d, bb = b / d;
  Mint ret;
  ret += Mint(d) * Mint(((aa + 1) * (bb + 1)) / 2 - aa - bb);
  ret += Mint(d * (d - 1) / 2) * Mint(aa * bb);
  ret += a;
  return ret;
}

void main() {
  try {
    for (; ; ) {
      const M = readInt();
      const N = readInt();
      auto A = new long[M];
      foreach (i; 0 .. M) {
        A[i] = readLong();
      }
      auto B = new long[N];
      foreach (j; 0 .. N) {
        B[j] = readLong();
      }
      
      Mint ans;
      foreach (i; 0 .. M) foreach (j; 0 .. N) {
        const res = solve(A[i], B[j]);
        ans += res;
        debug {
          const brt = sumFloors(B[j], A[i], 0, 1, B[j]);
          assert(brt == res, format("%s %s: %s %s", A[i], B[j], brt, res));
        }
      }
      ans *= 2;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード