結果

問題 No.1864 Shortest Paths Counting
ユーザー 👑 hos.lyrichos.lyric
提出日時 2022-03-04 22:25:06
言語 D
(dmd 2.107.1)
結果
AC  
実行時間 327 ms / 2,000 ms
コード長 4,694 bytes
コンパイル時間 1,948 ms
コンパイル使用メモリ 169,268 KB
実行使用メモリ 22,844 KB
最終ジャッジ日時 2023-09-04 16:16:29
合計ジャッジ時間 10,937 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,384 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,384 KB
testcase_03 AC 2 ms
4,384 KB
testcase_04 AC 1 ms
4,384 KB
testcase_05 AC 1 ms
4,384 KB
testcase_06 AC 1 ms
4,384 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 314 ms
21,768 KB
testcase_10 AC 314 ms
21,100 KB
testcase_11 AC 318 ms
20,788 KB
testcase_12 AC 325 ms
21,888 KB
testcase_13 AC 313 ms
21,044 KB
testcase_14 AC 319 ms
14,056 KB
testcase_15 AC 322 ms
21,024 KB
testcase_16 AC 323 ms
21,308 KB
testcase_17 AC 321 ms
21,832 KB
testcase_18 AC 315 ms
21,588 KB
testcase_19 AC 323 ms
22,200 KB
testcase_20 AC 327 ms
21,108 KB
testcase_21 AC 319 ms
22,844 KB
testcase_22 AC 321 ms
21,908 KB
testcase_23 AC 313 ms
21,096 KB
testcase_24 AC 2 ms
4,380 KB
testcase_25 AC 259 ms
13,340 KB
testcase_26 AC 216 ms
14,064 KB
権限があれば一括ダウンロードができます

ソースコード

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 = 998244353;
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, "x", long, "y", int, "id");

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto P = new Pt[N];
      foreach (i; 0 .. N) {
        const a = readLong;
        const b = readLong;
        P[i].x = a + b;
        P[i].y = a - b;
        P[i].id = i;
      }
      if (P[0].x > P[N - 1].x) {
        foreach (i; 0 .. N) {
          P[i].x *= -1;
        }
      }
      if (P[0].y > P[N - 1].y) {
        foreach (i; 0 .. N) {
          P[i].y *= -1;
        }
      }
      P.sort;
      
      auto ys = P.map!"a.y".array;
      ys = ys.sort.uniq.array;
      const ysLen = cast(long)(ys.length);
      debug {
        writeln("ys = ", ys);
      }
      
      auto bit = new Mint[ysLen];
      Mint ans;
      foreach (i; 0 .. N) {
        const pos = ys.lowerBound(P[i].y);
        Mint here = bit.bSum(pos + 1);
        if (P[i].id == 0) {
          here += 1;
        }
        debug {
          writeln(P[i], " ", here);
        }
        if (P[i].id == N - 1) {
          ans += here;
        }
        bit.bAdd(pos, here);
      }
      
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0