結果

問題 No.1074 増殖
コンテスト
ユーザー uwi
提出日時 2020-06-05 21:51:04
言語 Java
(openjdk 23)
結果
AC  
実行時間 837 ms / 2,000 ms
コード長 7,571 bytes
コンパイル時間 4,797 ms
コンパイル使用メモリ 89,736 KB
実行使用メモリ 67,056 KB
最終ジャッジ日時 2024-12-17 14:20:09
合計ジャッジ時間 10,871 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 12
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

package contest200605;
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 = "";
	
	int O = 20000;
	
	void solve()
	{
		int n = ni();
		int[][] co = new int[n][];
		for(int i = 0;i < n;i++){
			co[i] = na(4);
		}
		
		long[] ans = new long[n];
		SegmentTreeOverwriteRAddRSQL st = new SegmentTreeOverwriteRAddRSQL(42000);
		for(int i = 0;i < n;i++){
			int l = co[i][0] + O;
			int r = co[i][2] + O;
			int h = co[i][3];
			ans[i] += go(st, l, r, h);
		}
		st = new SegmentTreeOverwriteRAddRSQL(42000);
		for(int i = 0;i < n;i++){
			int l = co[i][0] + O;
			int r = co[i][2] + O;
			int h = -co[i][1];
			ans[i] += go(st, l, r, h);
		}
		for(long v: ans){
			out.println(v);
		}
	}
	
	long go(SegmentTreeOverwriteRAddRSQL st, int l, int r, int h)
	{
		long prev = st.sum(0, st.H);
		if(st.sum(O, O+1) > h){
			// split
			{
				int low = O, high = r;
				while(high - low > 1){
					int q = high+low>>1;
					if(st.sum(q, q+1) > h){
						low = q;
					}else{
						high = q;
					}
				}
				st.update(high, r, h);
			}
			{
				int low = l-1, high = O+1;
				while(high - low > 1){
					int q = high+low>>1;
					if(st.sum(q, q+1) > h){
						high = q;
					}else{
						low = q;
					}
				}
				st.update(l, low+1, h);
			}
		}else{
			st.update(l, r, h);
		}
		long anew = st.sum(0, st.H);
		return anew - prev;
	}
	
	public static class SegmentTreeOverwriteRAddRSQL {
		public int M, H, N;
		public long[] st;
		public long[] plus;
		public long[] cover;
		private long I = Long.MAX_VALUE;
		
		public SegmentTreeOverwriteRAddRSQL(int n)
		{
			N = n;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			cover = new long[H];
			Arrays.fill(cover, I);
			plus = new long[H];
			st = new long[M];
			Arrays.fill(st, 0);
			for(int i = H-1;i >= 1;i--){
				propagate(i);
			}
		}
		
		private void propagate(int i)
		{
			if(cover[i] == I){
				st[i] = st[2*i] + st[2*i+1] + plus[i] * (H/Integer.highestOneBit(i));
			}else{
				st[i] = cover[i] * (H/Integer.highestOneBit(i));
			}
		}
		
		private void fall(int cur)
		{
			if(cover[cur] != I){
				if(2*cur >= H){
					st[2*cur] = st[2*cur+1] = cover[cur];
				}else{
					cover[2*cur] = cover[2*cur+1] = cover[cur];
					plus[2*cur] = plus[2*cur+1] = 0;
					propagate(2*cur);
					propagate(2*cur+1);
				}
			}else if(plus[cur] != 0){
				if(2*cur >= H){
					st[2*cur] += plus[cur];
					st[2*cur+1] += plus[cur];
				}else{
					for(int i = 2*cur;i < 2*cur+2;i++){
						if(cover[i] != I){
							cover[i] += plus[cur];
						}else{
							plus[i] += plus[cur];
						}
						propagate(i);
					}
				}
			}
			plus[cur] = 0;
			cover[cur] = I;
		}
		
		public void add(int l, int r, long v){ add(l, r, v, 0, H, 1); }
		
		private void add(int l, int r, long v, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				if(cr == cl+1){
					st[cur] += v;
				}else if(cover[cur] != I){
					cover[cur] += v;
					propagate(cur);
				}else{
					plus[cur] += v;
					propagate(cur);
				}
			}else{
				int mid = cl+cr>>>1;
				fall(cur);
				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 void update(int l, int r, long v){ update(l, r, v, 0, H, 1); }
		
		private void update(int l, int r, long v, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				if(cr == cl+1){
					st[cur] = v;
				}else{
					cover[cur] = v;
					plus[cur] = 0;
					propagate(cur);
				}
			}else{
				int mid = cl+cr>>>1;
				fall(cur);
				if(cl < r && l < mid){
					update(l, r, v, cl, mid, 2*cur);
				}
				if(mid < r && l < cr){
					update(l, r, v, mid, cr, 2*cur+1);
				}
				propagate(cur);
			}
		}
		
		public long sum(int l, int r){ return sum(l, r, 0, H, 1); }
		
		private long sum(int l, int r, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				return st[cur];
			}else{
				if(cover[cur] != I)return cover[cur]*(Math.min(r, cr) - Math.max(l, cl));
				int mid = cl+cr>>>1;
				long L = 0, R = 0;
				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);
				}
				return L + R + plus[cur] * (Math.min(r, cr) - Math.max(l, cl));
			}
		}
		
		public long[] toArray() { return toArray(1, 0, H, new long[H]); }
		
		private long[] toArray(int cur, int l, int r, long[] ret)
		{
			if(r-l == 1){
				ret[cur-H] = st[cur];
			}else if(cover[cur] != I){
				Arrays.fill(ret, l, r, cover[cur]);
			}else{
				toArray(2*cur, l, l+r>>>1, ret);
				toArray(2*cur+1, l+r>>>1, r, ret);
				for(int i = l;i < r;i++){
					ret[i] += plus[cur];
				}
			}
			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