結果

問題 No.877 Range ReLU Query
ユーザー uwiuwi
提出日時 2019-09-06 21:34:49
言語 Java21
(openjdk 21)
結果
AC  
実行時間 736 ms / 2,000 ms
コード長 4,237 bytes
コンパイル時間 4,913 ms
コンパイル使用メモリ 85,952 KB
実行使用メモリ 66,712 KB
最終ジャッジ日時 2024-04-25 21:57:44
合計ジャッジ時間 11,764 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
50,044 KB
testcase_01 AC 61 ms
50,172 KB
testcase_02 AC 58 ms
50,308 KB
testcase_03 AC 68 ms
50,812 KB
testcase_04 AC 53 ms
50,420 KB
testcase_05 AC 56 ms
50,500 KB
testcase_06 AC 56 ms
50,072 KB
testcase_07 AC 56 ms
50,448 KB
testcase_08 AC 64 ms
50,616 KB
testcase_09 AC 56 ms
49,960 KB
testcase_10 AC 58 ms
50,000 KB
testcase_11 AC 591 ms
65,776 KB
testcase_12 AC 526 ms
63,048 KB
testcase_13 AC 434 ms
63,596 KB
testcase_14 AC 451 ms
61,368 KB
testcase_15 AC 563 ms
65,524 KB
testcase_16 AC 637 ms
66,652 KB
testcase_17 AC 624 ms
66,708 KB
testcase_18 AC 608 ms
65,952 KB
testcase_19 AC 690 ms
66,392 KB
testcase_20 AC 736 ms
66,712 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), Q = ni();
		int[] a = na(n);
		
		int[][] qs = new int[Q][];
		for(int z = 0;z < Q;z++){
			ni();
			qs[z] = new int[]{ni()-1, ni()-1, ni(), z};
		}
		Arrays.sort(qs, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				return -(a[2] - b[2]);
			}
		});
		
		int[][] ai = new int[n][];
		for(int i = 0;i < n;i++)ai[i] = new int[]{a[i], i};
		Arrays.sort(ai, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				return -(a[0] - b[0]);
			}
		});

		int p = 0;
		long[] anss = new long[Q];
		long[] ft = new long[n+5];
		long[] cts = new long[n+5];
		for(int[] q : qs){
			while(p < n && ai[p][0] >= q[2]){
				addFenwick(cts, ai[p][1], 1);
				addFenwick(ft, ai[p][1], ai[p][0]);
				p++;
			}
			anss[q[3]] = 
			sumFenwick(ft, q[1]) - sumFenwick(ft, q[0]-1) - 
			q[2] * (sumFenwick(cts, q[1]) - sumFenwick(cts, q[0]-1))
			;
		}
		for(long v : anss)out.println(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;
	}

	
	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 C().run(); }
	
	private 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 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