結果
| 問題 | No.404 部分門松列 |
| ユーザー |
 ぴろず
|
| 提出日時 | 2016-07-23 00:48:13 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 1,382 ms / 2,000 ms |
| コード長 | 8,775 bytes |
| コンパイル時間 | 2,688 ms |
| コンパイル使用メモリ | 90,576 KB |
| 実行使用メモリ | 78,172 KB |
| 最終ジャッジ日時 | 2024-06-28 17:00:18 |
| 合計ジャッジ時間 | 23,825 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 31 |
ソースコード
package no404;import java.io.IOException;import java.io.InputStream;import java.io.OutputStream;import java.io.PrintWriter;import java.util.ArrayList;import java.util.Arrays;import java.util.HashMap;import java.util.InputMismatchException;import java.util.NoSuchElementException;public class Main {public static void main(String[] args) throws IOException {//IO io = new IO(new FileInputStream("404in.txt"),new FileOutputStream("404out.txt"));IO io = new IO();int n = io.nextInt();int[] a = io.nextIntArray(n);Pair[] p = new Pair[n];for(int i=0;i<n;i++) {p[i] = new Pair(a[i], i);}Arrays.sort(p, (x,y) -> Integer.compare(x.v, y.v));HashMap<Integer, Integer> zip = new HashMap<>();int[] unzip = new int[n];int ind = 0;for(int i=0;i<n;i++) {if (i == 0 || p[i].v != p[i-1].v) {zip.put(p[i].v, ind);unzip[ind] = p[i].v;ind++;}}RangeAdd count = new RangeAdd(n+1);count2(n,p,count);count(n,p,count);for(int i=0;i<n;i++) {p[i].v = 1000000001 - p[i].v;}for(int i=0;i<n/2;i++) {Pair temp = p[i];p[i] = p[n-1-i];p[n-1-i] = temp;}count(n,p,count);// System.out.println(Arrays.toString(a));// System.out.println(count);//// System.out.println(Arrays.toString(unzip));int m = ind;RangeSum count2 = new RangeSum(m);for(int i=0;i<n;i++) {count2.accumlate(zip.get(a[i]), count.get(i));}// io.println(count2);// io.println(Arrays.toString(unzip));int q = io.nextInt();for(int qq=0;qq<q;qq++) {int l = io.nextInt();int r = io.nextInt();// io.println("1:" + l + " " + r);l = Bound.lowerBound(unzip, 0, m, l);r = Bound.upperBound(unzip, 0, m, r);// io.println("2:" + l + " " + r);// System.out.println(l + "," + r);long ans;if (l > r) {ans = 0;}else{ans = count2.sum(l, r + 1);}io.println(ans);}io.flush();}static void count(int n,Pair[] p,RangeAdd count) {RangeSum bit = new RangeSum(n);int used = 0;for(int i=0;i<n;i++) {if (p[i].v > used) {used = p[i].v;for(int j=i;j<n;j++) {if (p[j].v > used) {break;}bit.accumlate(p[j].i, 1);}}int j = p[i].i;long left = j - bit.sum(0, j);long right = n - 1 - j - bit.sum(j + 1, n);int x = p[i].i;count.accumulate(x, x + 1, left * right);}}static void count2(int n,Pair[] p,RangeAdd count) {for(int i=0;i<n;) {ArrayList<Pair> al = new ArrayList<>();int f = i;for(;i<n && p[f].v == p[i].v;i++) {al.add(p[i]);}for(int j=0;j<al.size()-1;j++) {count.accumulate(al.get(j).i + 1, al.get(j+1).i, - (long) (j+1) * (al.size() - 1 - j));}}}static class Pair {int v,i;public Pair(int v,int i) {this.v = v;this.i = i;}}}/* 0-indexed */class RangeSum {private int n;private long[] bit;public RangeSum(int n) {this.n = n;bit = new long[n+1];}public void accumlate(int index,long num) {index++;while(index<=n) {bit[index] += num;index+=index&-index;}}/* [begin , end) */public long sum(int begin,int end) {return sum(end) - sum(begin);}private long sum(int i) {long s = 0;while(i>0) {s+=bit[i];i-=i&-i;}return s;}public long get(int index) {return sum(index,index+1);}public void set(int index,long num) {accumlate(index,num-(sum(index)-sum(index-1)));}public String toString() {long[] value = new long[n];for(int i=0;i<n;i++) {value[i] = get(i);}return Arrays.toString(value);}}class RangeAdd {private int n;private long[] bit;public RangeAdd(int n) {this.n = n;bit = new long[n+2];}public void accumulate(int begin,int end,long num) {accumulate(begin, num);accumulate(end, -num);}private void accumulate(int index,long num) {index++;while(index<=n+1) {bit[index] += num;index+=index&-index;}}private long sum(int i) {long s = 0;while(i>0) {s+=bit[i];i-=i&-i;}return s;}public long get(int index) {return sum(index+1);}public void set(int index,long num) {accumulate(index,index+1,num-get(index));}public String toString() {long[] value = new long[n];for(int i=0;i<n;i++) {value[i] = get(i);}return Arrays.toString(value);}}class Bound {static int lowerBound(int[] a,int fromIndex,int toIndex,int key) {if (a[toIndex-1] < key) {return toIndex;}else if(a[fromIndex] >= key) {return fromIndex;}int l = fromIndex;int r = toIndex - 1;while(l + 1 < r) {int c = (l + r) >>> 1;if (a[c] >= key) {r = c;}else{l = c;}}return r;}static int lowerBound(int[] a,int key) {return lowerBound(a, 0, a.length, key);}static int upperBound(int[] a,int fromIndex,int toIndex,int key) {if (a[toIndex-1] <= key) {return toIndex - 1;}else if(a[fromIndex] > key) {return fromIndex - 1;}int l = fromIndex;int r = toIndex - 1;while(l + 1 < r) {int c = (l + r) >>> 1;if (a[c] > key) {r = c;}else{l = c;}}return l;}static int upperBound(int[] a,int key) {return upperBound(a, 0, a.length, key);}}class IO extends PrintWriter {private final InputStream in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int buflen = 0;public IO() { this(System.in, System.out);}public IO(InputStream in) { this(in, System.out);}public IO(InputStream in, OutputStream out) { super(out); this.in = in;}private boolean hasNextByte() {if (ptr < buflen) {return true;}else{ptr = 0;try {buflen = in.read(buffer);} catch (IOException e) {e.printStackTrace();}if (buflen <= 0) {return false;}}return true;}private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}public String next() {if (!hasNext()) {throw new NoSuchElementException();}StringBuilder sb = new StringBuilder();int b = readByte();while(isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public char[] nextCharArray(int len) {if (!hasNext()) {throw new NoSuchElementException();}char[] s = new char[len];int i = 0;int b = readByte();while(isPrintableChar(b)) {if (i == len) {throw new InputMismatchException();}s[i++] = (char) b;b = readByte();}return s;}public String nextLine() {if (!hasNextLine()) {throw new NoSuchElementException();}StringBuilder sb = new StringBuilder();int b = readByte();while(!isNewLine(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public long nextLong() {if (!hasNext()) {throw new NoSuchElementException();}long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while(true){if ('0' <= b && b <= '9') {n *= 10;n += b - '0';}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}else{throw new NumberFormatException();}b = readByte();}}public int nextInt() {long nl = nextLong();if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {throw new NumberFormatException();}return (int) nl;}public char nextChar() {if (!hasNext()) {throw new NoSuchElementException();}return (char) readByte();}public double nextDouble() { return Double.parseDouble(next());}public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}public void close() { super.close(); try {in.close();} catch (IOException e) {}}}