結果

問題 No.404 部分門松列
ユーザー ぴろずぴろず
提出日時 2016-07-23 00:23:19
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 8,451 bytes
コンパイル時間 2,907 ms
コンパイル使用メモリ 92,068 KB
実行使用メモリ 78,632 KB
最終ジャッジ日時 2024-11-06 10:05:58
合計ジャッジ時間 23,900 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
37,716 KB
testcase_01 AC 64 ms
37,400 KB
testcase_02 AC 59 ms
37,272 KB
testcase_03 AC 62 ms
37,384 KB
testcase_04 AC 70 ms
38,004 KB
testcase_05 AC 68 ms
38,148 KB
testcase_06 AC 68 ms
37,608 KB
testcase_07 AC 73 ms
38,040 KB
testcase_08 AC 68 ms
38,012 KB
testcase_09 AC 70 ms
37,760 KB
testcase_10 AC 69 ms
37,644 KB
testcase_11 AC 72 ms
37,848 KB
testcase_12 AC 70 ms
37,740 KB
testcase_13 AC 694 ms
56,556 KB
testcase_14 AC 474 ms
56,200 KB
testcase_15 AC 622 ms
50,416 KB
testcase_16 AC 841 ms
65,252 KB
testcase_17 AC 987 ms
67,200 KB
testcase_18 AC 463 ms
50,400 KB
testcase_19 AC 478 ms
54,236 KB
testcase_20 WA -
testcase_21 AC 941 ms
65,672 KB
testcase_22 AC 495 ms
50,616 KB
testcase_23 AC 706 ms
59,172 KB
testcase_24 AC 1,134 ms
65,688 KB
testcase_25 AC 1,316 ms
78,632 KB
testcase_26 AC 1,148 ms
68,152 KB
testcase_27 AC 305 ms
46,704 KB
testcase_28 AC 701 ms
61,248 KB
testcase_29 AC 1,044 ms
67,360 KB
testcase_30 AC 718 ms
57,824 KB
testcase_31 AC 205 ms
44,288 KB
testcase_32 AC 950 ms
68,432 KB
testcase_33 AC 900 ms
67,696 KB
testcase_34 AC 847 ms
67,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no404;

import java.io.IOException;
import java.io.InputStream;
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) {
		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));
		}
//		System.out.println(count2);
		
		int q = io.nextInt();
		for(int qq=0;qq<q;qq++) {
			int l = io.nextInt();
			int r = io.nextInt();
			l = Bound.lowerBound(unzip, 0, m, l);
			r = Bound.upperBound(unzip, 0, m, 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, - (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);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	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) {}}
}
0