結果
問題 | No.1300 Sum of Inversions |
ユーザー | daut-dlang |
提出日時 | 2020-11-27 22:51:13 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 590 ms / 2,000 ms |
コード長 | 4,331 bytes |
コンパイル時間 | 961 ms |
コンパイル使用メモリ | 129,656 KB |
実行使用メモリ | 47,484 KB |
最終ジャッジ日時 | 2024-06-22 10:06:57 |
合計ジャッジ時間 | 15,676 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
import std.stdio, std.conv, std.functional, std.string;import std.algorithm, std.array, std.container, std.range, std.typecons;import std.bigint, std.numeric, std.math, std.random;import core.bitop;string FMT_F = "%.10f";static File _f;void file_io(string fn) { _f = File(fn, "r"); }static string[] s_rd;T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); }size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }bool inside(T)(T x, T b, T e) { return x >= b && x < e; }T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }//long mod = 10^^9 + 7;long mod = 998_244_353;//long mod = 1_000_003;void moda(ref long x, long y) { x = (x + y) % mod; }void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }void modm(ref long x, long y) { x = (x * y) % mod; }void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); }struct SegTree(T){T delegate(const(T), const(T)) f;T[] data;T init;this(T[] _data, T delegate(const(T), const(T)) _f, T _init){f = _f; init = _init;size_t n = 1; while (n < _data.length) n *= 2; data.length = n*2-1;foreach (i; 0.._data.length) data[i+n-1] = _data[i];foreach (i; _data.length..n) data[i+n-1] = _init;foreach_reverse (i; 0..n-1) data[i] = f(data[i*2+1], data[i*2+2]);}T query(size_t l, size_t r) const{size_t n = (data.length+1) / 2; l += n-1; r += n-1; T res = init;while (l < r){if ((l & 1) == 0) res = f(res, data[l]);if ((r & 1) == 0) res = f(res, data[r-1]);l = l/2; r = (r-1)/2;}return res;}void update(size_t i, T v){i += (data.length+1) / 2 - 1; data[i] = v;while (i != 0) { i = (i-1)/2; data[i] = f(data[i*2+1], data[i*2+2]); }}}long compress(in long[] arr, out long[long] zip, out long[] unzip){auto index = MAKE_IDX(arr);long last = arr[index[0]], x;zip[last] = x;unzip ~= last;foreach (i; index[1..$]){if (arr[i] == last) continue;last = arr[i];++x;zip[last] = x;unzip ~= last;}return x+1;}void main(){auto N = RD;auto A = RDA;long[long] zip;long[] unzip;auto len = compress(A, zip, unzip);auto d1 = new long[](len);auto d2 = new long[](len);auto d3 = new long[](len);auto d4 = new long[](len);auto st1 = new SegTree!(long)(d1, (in long a, in long b)=>a+b, 0);auto st2 = new SegTree!(long)(d2, (in long a, in long b)=>a+b, 0);auto st3 = new SegTree!(long)(d3, (in long a, in long b)=>a+b, 0);auto st4 = new SegTree!(long)(d4, (in long a, in long b)=>a+b, 0);foreach (i; 0..N){auto x = zip[A[i]];auto cnt1 = st2.query(x, x+1);st2.update(x, cnt1+1);auto cnt2 = st4.query(x, x+1);st4.update(x, cnt2+A[i]);}long ans;foreach (i; 0..N){auto x = zip[A[i]];{auto cnt1 = st2.query(x, x+1);st2.update(x, cnt1-1);auto cnt2 = st4.query(x, x+1);st4.update(x, cnt2-A[i]);}long r1 = st1.query(x+1, len);long r3 = st3.query(x+1, len);long r2 = st2.query(0, x);long r4 = st4.query(0, x);r3 %= mod;r4 %= mod;r3.modm(r2);r4.modm(r1);ans.moda(r3);ans.moda(r4);r1.modm(r2);r1.modm(A[i]);ans.moda(r1);{auto cnt1 = st1.query(x, x+1);st1.update(x, cnt1+1);auto cnt2 = st3.query(x, x+1);st3.update(x, cnt2+A[i]);}}writeln(ans);stdout.flush;debug readln;}