結果

問題 No.1099 Range Square Sum
ユーザー uwiuwi
提出日時 2020-06-26 21:47:43
言語 Java21
(openjdk 21)
結果
AC  
実行時間 522 ms / 2,000 ms
コード長 5,591 bytes
コンパイル時間 4,159 ms
コンパイル使用メモリ 87,944 KB
実行使用メモリ 61,496 KB
最終ジャッジ日時 2024-07-04 20:36:44
合計ジャッジ時間 11,788 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
36,748 KB
testcase_01 AC 52 ms
36,872 KB
testcase_02 AC 52 ms
36,972 KB
testcase_03 AC 51 ms
36,740 KB
testcase_04 AC 51 ms
37,052 KB
testcase_05 AC 51 ms
37,248 KB
testcase_06 AC 50 ms
36,748 KB
testcase_07 AC 51 ms
37,240 KB
testcase_08 AC 52 ms
37,268 KB
testcase_09 AC 50 ms
37,032 KB
testcase_10 AC 50 ms
37,040 KB
testcase_11 AC 73 ms
38,544 KB
testcase_12 AC 79 ms
38,088 KB
testcase_13 AC 73 ms
38,464 KB
testcase_14 AC 72 ms
38,592 KB
testcase_15 AC 82 ms
38,628 KB
testcase_16 AC 81 ms
38,384 KB
testcase_17 AC 80 ms
38,416 KB
testcase_18 AC 82 ms
38,548 KB
testcase_19 AC 84 ms
38,500 KB
testcase_20 AC 80 ms
38,292 KB
testcase_21 AC 522 ms
61,120 KB
testcase_22 AC 489 ms
61,308 KB
testcase_23 AC 496 ms
61,228 KB
testcase_24 AC 474 ms
61,304 KB
testcase_25 AC 489 ms
61,284 KB
testcase_26 AC 433 ms
61,296 KB
testcase_27 AC 448 ms
61,252 KB
testcase_28 AC 438 ms
61,496 KB
testcase_29 AC 436 ms
61,272 KB
testcase_30 AC 427 ms
61,440 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200626;
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 E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	// -1 -3 -2
	// 2 0 1
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		SegmentTreeRSQ st = new SegmentTreeRSQ(a);
		for(int Q = ni();Q > 0;Q--){
			int type = ni();
			if(type == 1){
				int l = ni()-1, r = ni()-1, x = ni();
				st.add(l, r+1, x);
			}else{
				int l = ni()-1, r = ni()-1;
				out.println(st.sum(l, r+1));
			}
		}
	}
	
	public static class SegmentTreeRSQ {
		public int M, H, N;
		public long[] st;
		public long[] st2;
		public long[] plus;
		
		public SegmentTreeRSQ(int n)
		{
			N = n;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new long[M];
			st2 = new long[M];
			plus = new long[H];
		}
		
		public SegmentTreeRSQ(int[] a)
		{
			N = a.length;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new long[M];
			st2 = new long[M];
			plus = new long[H];
			for(int i = 0;i < N;i++){
				st[H+i] = a[i];
				st2[H+i] = (long)a[i]*a[i];
			}
			for(int i = (M>>1)-1;i >= 1;i--){
				propagate(i);
			}
		}
		
		public void add(int pos, int v)
		{
			for(int i = H+pos;i >= 1;i >>>= 1){
				st[i] += v;
			}
		}
		
		private void propagate(int i)
		{
			int count = H/Integer.highestOneBit(i);
			st[i] = st[2*i]+st[2*i+1]+plus[i]*count;
			st2[i] = st2[2*i]+st2[2*i+1]+plus[i]*plus[i]*count + 2*(st[2*i] + st[2*i+1]) * plus[i];
		}
		
		public void add(int l, int r, int v) { if(l < r)add(l, r, v, 0, H, 1); }
		
		private void add(int l, int r, int v, int cl, int cr, int cur)
		{
			if(cur >= H){
				st[cur] += v;
				st2[cur] = st[cur] * st[cur];
			}else if(l <= cl && cr <= r){
				plus[cur] += v;
				propagate(cur);
			}else{
				int mid = cl+cr>>>1;
				if(cl < r && l < mid){
					add(l, r, v, cl, mid, 2*cur);
				}
				if(mid < r && l < cr){
					add(l, r, v, mid, cr, 2*cur+1);
				}
				propagate(cur);
			}
		}
		
		public long sum(int l, int r) { 
			return sum(l, r, 0, H, 1)[1];
		}
		
		private long[] sum(int l, int r, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				return new long[]{st[cur], st2[cur]};
			}else{
				int mid = cl+cr>>>1;
				long[] L = null, R = null;
				if(cl < r && l < mid){
					L = sum(l, r, cl, mid, 2*cur);
				}
				if(mid < r && l < cr){
					R = sum(l, r, mid, cr, 2*cur+1);
				}
				if(L == null && R == null)return null;
				long count = Math.min(r,cr)-Math.max(l,cl);
				long[] ret = new long[2];
				long P = plus[cur];
				ret[0] = (L == null ? 0 : L[0])+(R == null ? 0 : R[0])+P*count;
				ret[1] = (L == null ? 0 : L[1])+(R == null ? 0 : R[1])+P*P*count + 2*((L == null ? 0 : L[0]) + (R == null ? 0 : R[0])) * P;
				return ret;
			}
		}
	}

	
	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 E().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