結果

問題 No.404 部分門松列
ユーザー uwiuwi
提出日時 2016-07-23 00:31:44
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,038 ms / 2,000 ms
コード長 5,330 bytes
コンパイル時間 4,368 ms
コンパイル使用メモリ 83,364 KB
実行使用メモリ 78,180 KB
最終ジャッジ日時 2023-09-11 02:29:10
合計ジャッジ時間 22,633 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
51,496 KB
testcase_01 AC 45 ms
51,468 KB
testcase_02 AC 44 ms
51,452 KB
testcase_03 AC 43 ms
51,852 KB
testcase_04 AC 48 ms
51,580 KB
testcase_05 AC 47 ms
51,448 KB
testcase_06 AC 49 ms
49,960 KB
testcase_07 AC 50 ms
51,804 KB
testcase_08 AC 49 ms
51,552 KB
testcase_09 AC 48 ms
51,716 KB
testcase_10 AC 48 ms
51,584 KB
testcase_11 AC 50 ms
51,604 KB
testcase_12 AC 48 ms
51,392 KB
testcase_13 AC 531 ms
67,692 KB
testcase_14 AC 494 ms
70,552 KB
testcase_15 AC 483 ms
67,908 KB
testcase_16 AC 573 ms
69,320 KB
testcase_17 AC 1,038 ms
73,672 KB
testcase_18 AC 363 ms
60,668 KB
testcase_19 AC 320 ms
60,108 KB
testcase_20 AC 582 ms
69,052 KB
testcase_21 AC 793 ms
71,468 KB
testcase_22 AC 409 ms
61,292 KB
testcase_23 AC 767 ms
76,668 KB
testcase_24 AC 841 ms
75,440 KB
testcase_25 AC 825 ms
69,868 KB
testcase_26 AC 771 ms
66,196 KB
testcase_27 AC 305 ms
61,740 KB
testcase_28 AC 540 ms
61,536 KB
testcase_29 AC 704 ms
70,228 KB
testcase_30 AC 563 ms
52,648 KB
testcase_31 AC 181 ms
54,840 KB
testcase_32 AC 748 ms
71,828 KB
testcase_33 AC 690 ms
56,680 KB
testcase_34 AC 788 ms
78,180 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class N404 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] imap = shrinkX(a);
		long[] cums = new long[n];
		go(a, cums, false);
		for(int i = 0;i < n;i++)a[i] = 200000-a[i];
		go(a, cums, true);
		long[] ccums = new long[n+1];
		for(int i = 0;i < n;i++){
			ccums[i+1] = ccums[i] + cums[i];
		}
		for(int Q = ni();Q > 0;Q--){
			int l = Arrays.binarySearch(imap, ni()), h = Arrays.binarySearch(imap, ni());
			if(l < 0)l = -l-1;
			if(h < 0)h = -h-2;
			if(l > h){
				out.println(0);
			}else{
				out.println(ccums[h+1]-ccums[l]);
			}
		}
	}
	
	static void go(int[] a, long[] cums, boolean ref)
	{
		int n = a.length;
		int[] leftless = new int[n];
		int[] ftl = new int[200005];
		{
			for(int i = 0;i < n;i++){
				leftless[i] = sumFenwick(ftl, a[i]-1);
				addFenwick(ftl, a[i], 1);
			}
		}
		int[] rightless = new int[n];
		long[] sames = new long[n];
		long[] fts = new long[200005];
		{
			int[] ft = new int[200005];
			for(int i = n-1;i >= 0;i--){
				addFenwick(ftl, a[i], -1);
				addFenwick(fts, a[i], -(sumFenwick(ft, a[i]) - sumFenwick(ft, a[i]-1)));
				sames[i] = sumFenwick(fts, a[i]-1);
				rightless[i] = sumFenwick(ft, a[i]-1);
				addFenwick(ft, a[i], 1);
				addFenwick(fts, a[i], (sumFenwick(ftl, a[i]) - sumFenwick(ftl, a[i]-1)));
			}
		}
		
		for(int i = 0;i < n;i++){
			cums[ref ? 200000-a[i] : a[i]] += (long)leftless[i] * rightless[i] - sames[i];
		}
	}
	
	
	
	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 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 long sumFenwick(long[] ft, int i)
	{
		long sum = 0;
		for(i++;i > 0;i -= i&-i)sum += ft[i];
		return sum;
	}
	
	public static void addFenwick(long[] ft, int i, long v)
	{
		if(v == 0)return;
		int n = ft.length;
		for(i++;i < n;i += i&-i)ft[i] += v;
	}
	
	public static int[] shrinkX(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);
//		b = radixSort(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)ret[p++] = (int)(b[i]>>32);
			a[(int)b[i]] = p-1;
		}
		return Arrays.copyOf(ret, p);
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-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();
	}
	
	public static void main(String[] args) throws Exception { new N404().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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))){ // when nextLine, (isSpaceChar(b) && 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 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 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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0