結果

問題 No.728 ギブ and テイク
ユーザー uwiuwi
提出日時 2018-08-24 22:36:19
言語 Java21
(openjdk 21)
結果
AC  
実行時間 522 ms / 3,000 ms
コード長 4,605 bytes
コンパイル時間 4,206 ms
コンパイル使用メモリ 82,676 KB
実行使用メモリ 68,612 KB
最終ジャッジ日時 2023-09-05 12:36:28
合計ジャッジ時間 11,523 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,192 KB
testcase_01 AC 53 ms
50,296 KB
testcase_02 AC 53 ms
50,292 KB
testcase_03 AC 53 ms
50,100 KB
testcase_04 AC 52 ms
50,092 KB
testcase_05 AC 53 ms
48,180 KB
testcase_06 AC 53 ms
50,068 KB
testcase_07 AC 53 ms
50,176 KB
testcase_08 AC 56 ms
50,280 KB
testcase_09 AC 53 ms
50,012 KB
testcase_10 AC 54 ms
50,024 KB
testcase_11 AC 56 ms
50,012 KB
testcase_12 AC 58 ms
50,032 KB
testcase_13 AC 115 ms
53,028 KB
testcase_14 AC 151 ms
53,076 KB
testcase_15 AC 117 ms
52,856 KB
testcase_16 AC 147 ms
53,088 KB
testcase_17 AC 141 ms
52,984 KB
testcase_18 AC 342 ms
61,820 KB
testcase_19 AC 377 ms
64,708 KB
testcase_20 AC 393 ms
65,004 KB
testcase_21 AC 398 ms
64,764 KB
testcase_22 AC 208 ms
57,820 KB
testcase_23 AC 186 ms
55,380 KB
testcase_24 AC 335 ms
61,988 KB
testcase_25 AC 337 ms
61,428 KB
testcase_26 AC 207 ms
57,768 KB
testcase_27 AC 522 ms
68,612 KB
testcase_28 AC 243 ms
67,112 KB
testcase_29 AC 54 ms
50,176 KB
testcase_30 AC 54 ms
50,040 KB
testcase_31 AC 53 ms
50,440 KB
testcase_32 AC 53 ms
50,428 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] ls = new int[n];
		int[] rs = new int[n];
		for(int i = 0;i < n;i++) {
			ls[i] = ni();
			rs[i] = ni();
		}
		
		PriorityQueue<int[]> pq = new PriorityQueue<>((x, y) -> x[0] - y[0]);
		int[] ft = new int[n+3];
		long ret = 0;
		int all = 0;
		for(int i = 0;i < n;i++) {
			while(!pq.isEmpty()) {
				int[] cur = pq.peek();
				if(cur[0] < a[i]) {
					pq.poll();
					addFenwick(ft, cur[1], -1); 
					all--;
				}else {
					break;
				}
			}
			
			int l = lowerBound(a, a[i] - ls[i]);
			ret += all - sumFenwick(ft, l-1);
			
			addFenwick(ft, i, 1);
			pq.add(new int[] {a[i]+rs[i], i});
			all++;
		}
		out.println(ret);
	}
	
	public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); }
	public static int lowerBound(int[] a, int l, int r, int v)
	{
		if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException();
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	
	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 int firstGEFenwick(int[] ft, int v)
	{
		int i = 0, n = ft.length;
		for(int b = Integer.highestOneBit(n);b != 0;b >>= 1){
			if((i|b) < n && ft[i|b] < v){
				i |= b;
				v -= ft[i];
			}
		}
		return i;
	}
	
	
	
	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 D().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