結果
問題 | No.2250 Split Permutation |
ユーザー |
👑 |
提出日時 | 2023-03-17 21:38:47 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 111 ms / 3,000 ms |
コード長 | 4,356 bytes |
コンパイル時間 | 1,607 ms |
コンパイル使用メモリ | 151,708 KB |
実行使用メモリ | 12,296 KB |
最終ジャッジ日時 | 2024-06-22 17:39:21 |
合計ジャッジ時間 | 4,779 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
ソースコード
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; }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 = cast(uint)(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;}void main() {try {for (; ; ) {const N = readInt;auto P = new int[N];foreach (i; 0 .. N) {P[i] = readInt - 1;}const INV2 = Mint(2).inv;auto two = new Mint[N + 1];auto invTwo = new Mint[N + 1];two[0] = invTwo[0] = 1;foreach (i; 1 .. N + 1) {two[i] = two[i - 1] * 2;invTwo[i] = invTwo[i - 1] * INV2;}auto bit0 = new Mint[N];auto bit1 = new Mint[N];Mint ans;foreach (i; 0 .. N) {{const sum0 = bit0.bSum(N) - bit0.bSum(P[i]);const sum1 = bit1.bSum(N) - bit1.bSum(P[i]);ans += (sum0 * two[N - 1] - sum1 * two[N - 1 - i]);}bit0.bAdd(P[i], Mint(1));bit1.bAdd(P[i], two[i]);}writeln(ans);}} catch (EOFException e) {}}