結果
問題 | No.1300 Sum of Inversions |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-11-27 21:36:11 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 241 ms / 2,000 ms |
コード長 | 4,793 bytes |
コンパイル時間 | 2,275 ms |
コンパイル使用メモリ | 158,884 KB |
実行使用メモリ | 28,404 KB |
最終ジャッジ日時 | 2023-09-04 11:13:33 |
合計ジャッジ時間 | 11,585 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,384 KB |
testcase_03 | AC | 179 ms
21,040 KB |
testcase_04 | AC | 172 ms
20,940 KB |
testcase_05 | AC | 139 ms
18,060 KB |
testcase_06 | AC | 208 ms
23,064 KB |
testcase_07 | AC | 197 ms
22,360 KB |
testcase_08 | AC | 226 ms
22,820 KB |
testcase_09 | AC | 215 ms
23,372 KB |
testcase_10 | AC | 111 ms
14,588 KB |
testcase_11 | AC | 113 ms
14,752 KB |
testcase_12 | AC | 175 ms
20,400 KB |
testcase_13 | AC | 170 ms
20,460 KB |
testcase_14 | AC | 241 ms
24,768 KB |
testcase_15 | AC | 215 ms
23,196 KB |
testcase_16 | AC | 177 ms
20,380 KB |
testcase_17 | AC | 107 ms
15,200 KB |
testcase_18 | AC | 127 ms
15,892 KB |
testcase_19 | AC | 154 ms
18,976 KB |
testcase_20 | AC | 152 ms
19,620 KB |
testcase_21 | AC | 156 ms
19,132 KB |
testcase_22 | AC | 136 ms
18,632 KB |
testcase_23 | AC | 201 ms
22,952 KB |
testcase_24 | AC | 142 ms
19,436 KB |
testcase_25 | AC | 120 ms
15,072 KB |
testcase_26 | AC | 119 ms
15,384 KB |
testcase_27 | AC | 135 ms
16,400 KB |
testcase_28 | AC | 221 ms
24,096 KB |
testcase_29 | AC | 159 ms
19,240 KB |
testcase_30 | AC | 219 ms
22,788 KB |
testcase_31 | AC | 141 ms
18,516 KB |
testcase_32 | AC | 149 ms
19,016 KB |
testcase_33 | AC | 42 ms
16,692 KB |
testcase_34 | AC | 69 ms
18,144 KB |
testcase_35 | AC | 127 ms
27,032 KB |
testcase_36 | AC | 136 ms
28,404 KB |
ソースコード
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 = 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; } void main() { try { for (; ; ) { const N = readInt(); auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong(); } const as = A.dup.sort.uniq.array; const asLen = cast(int)(as.length); auto ls0 = new long[N]; auto ls1 = new long[N]; { auto bit0 = new long[asLen]; auto bit1 = new long[asLen]; foreach (i; 0 .. N) { const pos = as.lowerBound(A[i]); ls0[i] = bit0.bSum(asLen) - bit0.bSum(pos + 1); ls1[i] = bit1.bSum(asLen) - bit1.bSum(pos + 1); bit0.bAdd(pos, 1); bit1.bAdd(pos, A[i]); } } auto rs0 = new Mint[N]; auto rs1 = new Mint[N]; { auto bit0 = new long[asLen]; auto bit1 = new long[asLen]; foreach_reverse (i; 0 .. N) { const pos = as.lowerBound(A[i]); rs0[i] = bit0.bSum(pos); rs1[i] = bit1.bSum(pos); bit0.bAdd(pos, 1); bit1.bAdd(pos, A[i]); } } debug { writeln("ls0 = ", ls0); writeln("ls1 = ", ls1); writeln("rs0 = ", rs0); writeln("rs1 = ", rs1); } Mint ans; foreach (i; 0 .. N) { ans += Mint(rs0[i]) * Mint(ls1[i]); ans += Mint(ls0[i]) * Mint(rs0[i]) * Mint(A[i]); ans += Mint(ls0[i]) * Mint(rs1[i]); } writeln(ans); } } catch (EOFException e) { } }