結果
| 問題 | No.1733 Sum of Sorted Subarrays |
| ユーザー |
 uwi
|
| 提出日時 | 2021-11-05 22:07:08 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 1,996 ms / 3,000 ms |
| コード長 | 15,571 bytes |
| コンパイル時間 | 6,131 ms |
| コンパイル使用メモリ | 93,008 KB |
| 実行使用メモリ | 82,744 KB |
| 最終ジャッジ日時 | 2024-11-06 12:58:28 |
| 合計ジャッジ時間 | 37,356 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 24 |
ソースコード
package contest211105;import java.io.*;import java.util.ArrayDeque;import java.util.Arrays;import java.util.InputMismatchException;import java.util.Queue;import java.util.function.IntUnaryOperator;import java.util.function.LongUnaryOperator;public class E {InputStream is;FastWriter out;String INPUT = "";public void solve(){int n = ni();int[] a = na(n);// 432210なら// (2^4+2^3+...+2^0)long[] pre = go(a, true);long[] suf = go(rev(a), false);long ans = 0;for(int i = 0;i < n;i++){ans += pre[i] * suf[n-1-i] % mod * a[i];ans %= mod;}out.println(ans);}public static int[] rev(int[] a){int[] b = new int[a.length];for(int i = 0;i < a.length;i++)b[a.length-1-i] = a[i];return b;}long[] go(int[] a, boolean flag){int n = a.length;int[][] ai = new int[n][];for(int i = 0;i < n;i++){ai[i] = new int[]{a[i], i};}Arrays.sort(ai, (x, y) -> {if (x[0] != y[0]) return x[0] - y[0];return flag ? (x[1] - y[1]) : -(x[1] - y[1]);});long[] pre = new long[n];SegmentTreeRAddRMulRSQModulo st = new SegmentTreeRAddRMulRSQModulo(n);st.muladd(0, n, 0L, 1L);for(int[] u : ai){pre[u[1]] = st.sum(0, u[1]+1) * invl(st.sum(u[1], u[1]+1), mod) % mod;st.muladd(0, u[1]+1, 2L, 0L);}return pre;}static final int mod = 998244353;public static long invl(long a, long mod) {long b = mod;long p = 1, q = 0;while (b > 0) {long c = a / b;long d;d = a;a = b;b = d % b;d = p;p = q;q = d - c * q;}return p < 0 ? p + mod : p;}public static class SegmentTreeRAddRMulRSQModulo {public final int mod = 998244353;public final int M, H, N, LH;public final long[] sums;public final long[] A;public final long[] B;public SegmentTreeRAddRMulRSQModulo(int n){N = n;M = Integer.highestOneBit(Math.max(N-1, 1))<<2;H = M>>>1;LH = Integer.numberOfTrailingZeros(H);sums = new long[M];A = new long[H];B = new long[H];Arrays.fill(A, 1L);}public SegmentTreeRAddRMulRSQModulo(int[] a){this(a.length);for(int i = 0;i < N;i++){sums[H+i] = a[i];}for(int i = H-1;i >= 1;i--)propagate(i);}private void push(int cur, int len){if(A[cur] == 1 && B[cur] == 0)return;int L = cur*2, R = L + 1;sums[L] = (sums[L] * A[cur] + (B[cur] <<len-1)) % mod;sums[R] = (sums[R] * A[cur] + (B[cur] <<len-1)) % mod;if(L < H){A[L] = A[L] * A[cur] % mod;A[R] = A[R] * A[cur] % mod;B[L] = (B[L] * A[cur] + B[cur]) % mod;B[R] = (B[R] * A[cur] + B[cur]) % mod;}A[cur] = 1; B[cur] = 0;}private void propagate(int i){sums[i] = sums[2*i] + sums[2*i+1];if(sums[i] >= mod)sums[i] -= mod;}private void muladd(int cur, long v, long w, int q){sums[cur] = (sums[cur] * v + (w<<q)) % mod;if(cur < H) {A[cur] = A[cur] * v % mod;B[cur] = (B[cur] * v + w) % mod;}}private void pushlr(int l, int r){for(int i = LH;i >= 1;i--) {if (l >>> i << i != l) push(l >>> i, i);if (r >>> i << i != r) push(r >>> i, i);}}public void muladd(int l, int r, final long v, final long w) {if(l >= r)return;l += H; r += H;pushlr(l, r);for(int ll = l, rr = r, q = 0;ll < rr;ll>>>=1,rr>>>=1, q++){if((ll&1) == 1) muladd(ll++, v, w, q);if((rr&1) == 1) muladd(--rr, v, w, q);}for(int i = 1;i <= LH;i++){if(l>>>i<<i != l)propagate(l>>>i);if(r>>>i<<i != r)propagate(r>>>i);}}public long sum(int l, int r) {if(l >= r)return 0;l += H; r += H;pushlr(l, r);long ret = 0;for(int ll = l, rr = r;ll < rr;ll>>>=1,rr>>>=1){if((ll&1) == 1)ret += sums[ll++];if((rr&1) == 1)ret += sums[--rr];}return ret % mod;}}public static int sumFenwick(int[] ft, int i){int sum = 0;for(i++;i > 0;i -= i&-i)sum += ft[i];return sum;}public static void addFenwick(int[] ft, int l, int r, int v){addFenwick(ft, l, v);addFenwick(ft, r, -v);}public static void addFenwick(int[] ft, int i, int v){if(v == 0 || i < 0)return;int n = ft.length;for(i++;i < n;i += i&-i)ft[i] += v;}public static int[] shrink(int[] a) {int n = a.length;long[] b = new long[n];for (int i = 0; i < n; i++) b[i] = (long) a[i] << 32 | i;Arrays.sort(b);int[] ret = new int[n];int p = 0;for (int i = 0; i < n; i++) {if (i > 0 && (b[i] ^ b[i - 1]) >> 32 != 0) p++;ret[(int) b[i]] = p;}return ret;}public static void main(String[] args) {new E().run();}public void run(){long S = System.currentTimeMillis();is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new FastWriter(System.out);solve();out.flush();long G = System.currentTimeMillis();tr(G-S+"ms");// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){// @Override// public void run() {// long s = System.currentTimeMillis();// solve();// out.flush();// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// }// };// t.start();// t.join();}private boolean eof(){if(lenbuf == -1)return true;int lptr = ptrbuf;while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;try {is.mark(1000);while(true){int b = is.read();if(b == -1){is.reset();return true;}else if(!isSpaceChar(b)){is.reset();return false;}}} catch (IOException e) {return true;}}private final byte[] inbuf = new byte[1024];public int lenbuf = 0, ptrbuf = 0;private int readByte(){if(lenbuf == -1)throw new InputMismatchException();if(ptrbuf >= lenbuf){ptrbuf = 0;try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }if(lenbuf <= 0)return -1;}return inbuf[ptrbuf++];}private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }// private boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }private double nd() { return Double.parseDouble(ns()); }private char nc() { return (char)skip(); }private String ns(){int b = skip();StringBuilder sb = new StringBuilder();while(!(isSpaceChar(b))){sb.appendCodePoint(b);b = readByte();}return sb.toString();}private char[] ns(int n){char[] buf = new char[n];int b = skip(), p = 0;while(p < n && !(isSpaceChar(b))){buf[p++] = (char)b;b = readByte();}return n == p ? buf : Arrays.copyOf(buf, p);}private char[][] nm(int n, int m){char[][] map = new char[n][];for(int i = 0;i < n;i++)map[i] = ns(m);return map;}private int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private long[] nal(int n){long[] a = new long[n];for(int i = 0;i < n;i++)a[i] = nl();return a;}private int ni(){int num = 0, b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private long nl(){long num = 0;int b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}public static class FastWriter{private static final int BUF_SIZE = 1<<13;private final byte[] buf = new byte[BUF_SIZE];private final OutputStream out;private int ptr = 0;private FastWriter(){out = null;}public FastWriter(OutputStream os){this.out = os;}public FastWriter(String path){try {this.out = new FileOutputStream(path);} catch (FileNotFoundException e) {throw new RuntimeException("FastWriter");}}public FastWriter write(byte b){buf[ptr++] = b;if(ptr == BUF_SIZE)innerflush();return this;}public FastWriter write(char c){return write((byte)c);}public FastWriter write(char[] s){for(char c : s){buf[ptr++] = (byte)c;if(ptr == BUF_SIZE)innerflush();}return this;}public FastWriter write(String s){s.chars().forEach(c -> {buf[ptr++] = (byte)c;if(ptr == BUF_SIZE)innerflush();});return this;}private static int countDigits(int l) {if (l >= 1000000000) return 10;if (l >= 100000000) return 9;if (l >= 10000000) return 8;if (l >= 1000000) return 7;if (l >= 100000) return 6;if (l >= 10000) return 5;if (l >= 1000) return 4;if (l >= 100) return 3;if (l >= 10) return 2;return 1;}public FastWriter write(int x){if(x == Integer.MIN_VALUE){return write((long)x);}if(ptr + 12 >= BUF_SIZE)innerflush();if(x < 0){write((byte)'-');x = -x;}int d = countDigits(x);for(int i = ptr + d - 1;i >= ptr;i--){buf[i] = (byte)('0'+x%10);x /= 10;}ptr += d;return this;}private static int countDigits(long l) {if (l >= 1000000000000000000L) return 19;if (l >= 100000000000000000L) return 18;if (l >= 10000000000000000L) return 17;if (l >= 1000000000000000L) return 16;if (l >= 100000000000000L) return 15;if (l >= 10000000000000L) return 14;if (l >= 1000000000000L) return 13;if (l >= 100000000000L) return 12;if (l >= 10000000000L) return 11;if (l >= 1000000000L) return 10;if (l >= 100000000L) return 9;if (l >= 10000000L) return 8;if (l >= 1000000L) return 7;if (l >= 100000L) return 6;if (l >= 10000L) return 5;if (l >= 1000L) return 4;if (l >= 100L) return 3;if (l >= 10L) return 2;return 1;}public FastWriter write(long x){if(x == Long.MIN_VALUE){return write("" + x);}if(ptr + 21 >= BUF_SIZE)innerflush();if(x < 0){write((byte)'-');x = -x;}int d = countDigits(x);for(int i = ptr + d - 1;i >= ptr;i--){buf[i] = (byte)('0'+x%10);x /= 10;}ptr += d;return this;}public FastWriter write(double x, int precision){if(x < 0){write('-');x = -x;}x += Math.pow(10, -precision)/2;// if(x < 0){ x = 0; }write((long)x).write(".");x -= (long)x;for(int i = 0;i < precision;i++){x *= 10;write((char)('0'+(int)x));x -= (int)x;}return this;}public FastWriter writeln(char c){ return write(c).writeln(); }public FastWriter writeln(int x){ return write(x).writeln(); }public FastWriter writeln(long x){ return write(x).writeln(); }public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); }public FastWriter write(int... xs){boolean first = true;for(int x : xs) {if (!first) write(' ');first = false;write(x);}return this;}public FastWriter write(long... xs){boolean first = true;for(long x : xs) {if (!first) write(' ');first = false;write(x);}return this;}public FastWriter write(IntUnaryOperator f, int... xs){boolean first = true;for(int x : xs) {if (!first) write(' ');first = false;write(f.applyAsInt(x));}return this;}public FastWriter write(LongUnaryOperator f, long... xs){boolean first = true;for(long x : xs) {if (!first) write(' ');first = false;write(f.applyAsLong(x));}return this;}public FastWriter writeln(){return write((byte)'\n');}public FastWriter writeln(int... xs) { return write(xs).writeln(); }public FastWriter writeln(long... xs) { return write(xs).writeln(); }public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); }public FastWriter writeln(char[] line) { return write(line).writeln(); }public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; }public FastWriter writeln(String s) { return write(s).writeln(); }private void innerflush(){try {out.write(buf, 0, ptr);ptr = 0;} catch (IOException e) {throw new RuntimeException("innerflush");}}public void flush(){innerflush();try {out.flush();} catch (IOException e) {throw new RuntimeException("flush");}}public FastWriter print(byte b) { return write(b); }public FastWriter print(char c) { return write(c); }public FastWriter print(char[] s) { return write(s); }public FastWriter print(String s) { return write(s); }public FastWriter print(int x) { return write(x); }public FastWriter print(long x) { return write(x); }public FastWriter print(double x, int precision) { return write(x, precision); }public FastWriter println(char c){ return writeln(c); }public FastWriter println(int x){ return writeln(x); }public FastWriter println(long x){ return writeln(x); }public FastWriter println(double x, int precision){ return writeln(x, precision); }public FastWriter print(int... xs) { return write(xs); }public FastWriter print(long... xs) { return write(xs); }public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); }public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }public FastWriter println(int... xs) { return writeln(xs); }public FastWriter println(long... xs) { return writeln(xs); }public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); }public FastWriter println(char[] line) { return writeln(line); }public FastWriter println(char[]... map) { return writeln(map); }public FastWriter println(String s) { return writeln(s); }public FastWriter println() { return writeln(); }}public static void trnz(int... o){for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");System.out.println();}// print ids which are 1public static void trt(long... o){Queue<Integer> stands = new ArrayDeque<>();for(int i = 0;i < o.length;i++){for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));}System.out.println(stands);}public static void tf(boolean... r){for(boolean x : r)System.out.print(x?'#':'.');System.out.println();}public static void tf(boolean[]... b){for(boolean[] r : b) {for(boolean x : r)System.out.print(x?'#':'.');System.out.println();}System.out.println();}public void tf(long[]... b){if(INPUT.length() != 0) {for (long[] r : b) {for (long x : r) {for (int i = 0; i < 64; i++) {System.out.print(x << ~i < 0 ? '#' : '.');}}System.out.println();}System.out.println();}}public void tf(long... b){if(INPUT.length() != 0) {for (long x : b) {for (int i = 0; i < 64; i++) {System.out.print(x << ~i < 0 ? '#' : '.');}}System.out.println();}}private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }}