結果

問題 No.448 ゆきこーだーの雨と雪 (3)
ユーザー uwiuwi
提出日時 2016-11-18 22:47:53
言語 Java19
(openjdk 21)
結果
AC  
実行時間 229 ms / 2,000 ms
コード長 6,087 bytes
コンパイル時間 3,667 ms
コンパイル使用メモリ 81,732 KB
実行使用メモリ 57,332 KB
最終ジャッジ日時 2023-09-02 12:49:26
合計ジャッジ時間 10,797 ms
ジャッジサーバーID
(参考情報)
judge11 / judge16
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
49,224 KB
testcase_01 AC 44 ms
49,180 KB
testcase_02 AC 42 ms
49,384 KB
testcase_03 AC 43 ms
49,308 KB
testcase_04 AC 43 ms
49,220 KB
testcase_05 AC 45 ms
49,356 KB
testcase_06 AC 47 ms
49,244 KB
testcase_07 AC 44 ms
49,172 KB
testcase_08 AC 45 ms
49,124 KB
testcase_09 AC 45 ms
49,124 KB
testcase_10 AC 43 ms
49,312 KB
testcase_11 AC 46 ms
49,740 KB
testcase_12 AC 45 ms
49,320 KB
testcase_13 AC 95 ms
52,292 KB
testcase_14 AC 105 ms
52,104 KB
testcase_15 AC 150 ms
54,156 KB
testcase_16 AC 179 ms
57,328 KB
testcase_17 AC 189 ms
57,332 KB
testcase_18 AC 105 ms
51,608 KB
testcase_19 AC 222 ms
57,140 KB
testcase_20 AC 140 ms
52,296 KB
testcase_21 AC 229 ms
57,332 KB
testcase_22 AC 134 ms
54,144 KB
testcase_23 AC 202 ms
57,280 KB
testcase_24 AC 125 ms
52,176 KB
testcase_25 AC 222 ms
57,024 KB
testcase_26 AC 94 ms
51,872 KB
testcase_27 AC 176 ms
57,204 KB
testcase_28 AC 177 ms
53,300 KB
testcase_29 AC 142 ms
54,052 KB
testcase_30 AC 200 ms
57,104 KB
testcase_31 AC 106 ms
51,780 KB
testcase_32 AC 104 ms
52,232 KB
testcase_33 AC 209 ms
57,008 KB
testcase_34 AC 216 ms
57,320 KB
testcase_35 AC 209 ms
57,104 KB
testcase_36 AC 193 ms
57,016 KB
testcase_37 AC 212 ms
57,208 KB
testcase_38 AC 202 ms
57,328 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package contest161118;
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 D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		int[] ts = new int[n];
		int[] ds = new int[n];
		for(int i = 0;i < n;i++){
			ts[i] = ni();
			ds[i] = ni();
		}
		int low = -1, high = 1000000007;
		while(high - low > 1){
			int h = high+low>>1;
			if(ok(h, ts, ds, K)){
				high = h;
			}else{
				low = h;
			}
		}
		out.println(high);
		
		SegmentTreeRMQL st = new SegmentTreeRMQL(n+3);
		st.update(0, 0L);
		int last = 0;
		for(int i = 0;i < n;i++){
			int prev = Arrays.binarySearch(ts, ts[i]-K);
			if(prev < 0){
				prev = -prev-2;
			}
			long cost = -st.minx(last, prev+2) + ds[i];
			st.update(i+1, -cost);
			if(ds[i] > high){
				last = i+1;
			}
		}
		long dsum = 0;
		for(int v : ds)dsum += v;
		out.println(dsum + st.st[1]);
	}
	
	public static class SegmentTreeRMQL {
		public int M, H, N;
		public long[] st;
		
		public SegmentTreeRMQL(int n)
		{
			N = n;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new long[M];
			Arrays.fill(st, 0, M, Long.MAX_VALUE);
		}
		
		public SegmentTreeRMQL(long[] a)
		{
			N = a.length;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new long[M];
			for(int i = 0;i < N;i++){
				st[H+i] = a[i];
			}
			Arrays.fill(st, H+N, M, Long.MAX_VALUE);
			for(int i = H-1;i >= 1;i--)propagate(i);
		}
		
		public void update(int pos, long x)
		{
			st[H+pos] = x;
			for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);
		}
		
		private void propagate(int i)
		{
			st[i] = Math.min(st[2*i], st[2*i+1]);
		}
		
		public long minx(int l, int r){
			if(l >= r)return Long.MAX_VALUE;
			long min = Long.MAX_VALUE;
			while(l != 0){
				int f = l&-l;
				if(l+f > r)break;
				long v = st[(H+l)/f];
				if(v < min)min = v;
				l += f;
			}
			
			while(l < r){
				int f = r&-r;
				long v = st[(H+r)/f-1];
				if(v < min)min = v;
				r -= f;
			}
			return min;
		}
		
		public long min(int l, int r){ return l >= r ? 0 : min(l, r, 0, H, 1);}
		
		private long min(int l, int r, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				return st[cur];
			}else{
				int mid = cl+cr>>>1;
				long ret = Long.MAX_VALUE;
				if(cl < r && l < mid){
					ret = Math.min(ret, min(l, r, cl, mid, 2*cur));
				}
				if(mid < r && l < cr){
					ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1));
				}
				return ret;
			}
		}
		
		public int firstle(int l, long v) {
			int cur = H+l;
			while(true){
				if(st[cur] <= v){
					if(cur < H){
						cur = 2*cur;
					}else{
						return cur-H;
					}
				}else{
					cur++;
					if((cur&cur-1) == 0)return -1;
					if((cur&1)==0)cur>>>=1;
				}
			}
		}
		
		public int lastle(int l, long v) {
			int cur = H+l;
			while(true){
				if(st[cur] <= v){
					if(cur < H){
						cur = 2*cur+1;
					}else{
						return cur-H;
					}
				}else{
					if((cur&cur-1) == 0)return -1;
					cur--;
					if((cur&1)==1)cur>>>=1;
				}
			}
		}
	}

	
	boolean ok(int h, int[] ts, int[] ds, int K)
	{
		long last = Long.MIN_VALUE / 10;
		for(int i = 0;i < ts.length;i++){
			if(ds[i] > h){
				if(ts[i] - last < K)return false;
				last = ts[i];
			}
		}
		return true;
	}
	
	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