結果

問題 No.789 範囲の合計
コンテスト
ユーザー uwi
提出日時 2019-02-08 21:50:08
言語 Java
(openjdk 23)
結果
AC  
実行時間 215 ms / 1,000 ms
コード長 5,541 bytes
コンパイル時間 3,461 ms
コンパイル使用メモリ 85,292 KB
実行使用メモリ 88,536 KB
最終ジャッジ日時 2024-06-28 18:50:31
合計ジャッジ時間 6,455 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190208;
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 F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		DynamicSegmentTreeRSQSimple dst = new DynamicSegmentTreeRSQSimple(n, 30);
		long ans = 0;
		for(int i = 0;i < n;i++) {
			int t = ni();
			if(t == 0) {
				dst.add(ni(), ni());
			}else {
				ans += dst.sum(ni(), ni()+1);
			}
		}
		out.println(ans);
	}
	
	public static class DynamicSegmentTreeRSQSimple {
		public long[] vals;
		public int[] ls;
		public int[] rs;
		public int gen;
		public int height;
		
		public DynamicSegmentTreeRSQSimple(int q, int height)
		{
			int bufsize = q * (height+1) + 1;
			this.vals = new long[bufsize];
			this.ls = new int[bufsize];
			this.rs = new int[bufsize];
			Arrays.fill(this.ls, -1);
			Arrays.fill(this.rs, -1);
			this.height = height;
			gen = 0;
			vals[gen++] = 0;
		}
		
		public void add(long x, long v)
		{
			addDfs(0, x, v, height-1);
		}
		
		private int addDfs(int id, long x, long v, int d)
		{
			if(id == -1)id = gen++;
			if(d == -1){
				vals[id] += v;
			}else{
				if(x<<~d<0){
					rs[id] = addDfs(rs[id], x, v, d-1);
				}else{
					ls[id] = addDfs(ls[id], x, v, d-1);
				}
				propagate(id);
			}
			return id;
		}
		
		private long val(int id){ return id == -1 ? 0 : vals[id]; }
		private int L(int id){ return id == -1 ? -1 : ls[id]; }
		private int R(int id){ return id == -1 ? -1 : rs[id]; }
		
		private void propagate(int id)
		{
			if(id == -1)return;
			vals[id] = val(ls[id]) + val(rs[id]);
		}
		
		// sum of a[pos] which (t xor pos) >= v
		public long sumge(long t, long v)
		{
			if(v >= 1L<<height)return 0L;
			return sumge(0, t, v, height-1, 0);
		}
		
		private long sumge(long cur, long t, long v, int d, int id)
		{
			if(id == -1)return 0L;
			if(d == -1){
				return vals[id];
			}
			
			long ret = 0;
			if(v<<~d<0){
				if(t<<~d<0){
					ret += sumge(cur|0L<<d, t, v, d-1, L(id));
				}else{
					ret += sumge(cur|1L<<d, t, v, d-1, R(id));
				}
			}else{
				if(t<<~d<0){
					ret += sumge(cur|1L<<d, t, v, d-1, R(id));
					ret += val(L(id));
				}else{
					ret += sumge(cur|0L<<d, t, v, d-1, L(id));
					ret += val(R(id));
				}
			}
			return ret;
		}
		
		public long sum(long l, long r)
		{
			return sum(l, r, height-1, 0);
		}
		
		private long sum(long l, long r, int d, int id)
		{
			if(l <= 0 && r >= 1L<<d+1){
				return vals[id];
			}else{
				// [l,r), [0,1<<d-1)
				long ret = 0;
				if(l < 1L<<d && 0 < r && L(id) != -1){
					ret += sum(l, r, d-1, L(id));
				}
				if(l < 1L<<d+1 && 1L<<d < r && R(id) != -1){
					ret += sum(l-(1L<<d), r-(1L<<d), d-1, R(id));
				}
				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 F().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