#266026 (Java21) No.704 ゴミ拾い Medium

提出ソース

結果

問題	No.704 ゴミ拾い Medium
ユーザー	uwi
提出日時	2018-06-15 22:56:19
言語	Java21 (openjdk 21)
結果	AC
実行時間	191 ms / 1,500 ms
コード長	4,859 bytes
コンパイル時間	3,824 ms
コンパイル使用メモリ	82,184 KB
実行使用メモリ	65,424 KB
最終ジャッジ日時	2023-09-13 05:04:26
合計ジャッジ時間	11,956 ms
ジャッジサーバーID （参考情報）	judge11 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	39 ms 49,396 KB
testcase_01	AC	40 ms 49,372 KB
testcase_02	AC	40 ms 49,500 KB
testcase_03	AC	40 ms 49,412 KB
testcase_04	AC	40 ms 49,424 KB
testcase_05	AC	40 ms 49,552 KB
testcase_06	AC	41 ms 49,236 KB
testcase_07	AC	38 ms 49,624 KB
testcase_08	AC	39 ms 49,420 KB
testcase_09	AC	40 ms 49,420 KB
testcase_10	AC	39 ms 49,388 KB
testcase_11	AC	40 ms 49,492 KB
testcase_12	AC	41 ms 49,388 KB
testcase_13	AC	40 ms 49,440 KB
testcase_14	AC	45 ms 49,552 KB
testcase_15	AC	45 ms 49,552 KB
testcase_16	AC	45 ms 49,424 KB
testcase_17	AC	45 ms 49,436 KB
testcase_18	AC	45 ms 49,564 KB
testcase_19	AC	44 ms 49,228 KB
testcase_20	AC	45 ms 49,552 KB
testcase_21	AC	44 ms 49,512 KB
testcase_22	AC	49 ms 49,428 KB
testcase_23	AC	46 ms 49,764 KB
testcase_24	AC	168 ms 65,180 KB
testcase_25	AC	178 ms 65,020 KB
testcase_26	AC	191 ms 64,904 KB
testcase_27	AC	166 ms 64,844 KB
testcase_28	AC	165 ms 65,236 KB
testcase_29	AC	174 ms 65,020 KB
testcase_30	AC	179 ms 64,928 KB
testcase_31	AC	166 ms 64,880 KB
testcase_32	AC	173 ms 65,152 KB
testcase_33	AC	184 ms 65,148 KB
testcase_34	AC	175 ms 65,012 KB
testcase_35	AC	176 ms 64,792 KB
testcase_36	AC	172 ms 64,912 KB
testcase_37	AC	180 ms 65,144 KB
testcase_38	AC	181 ms 64,992 KB
testcase_39	AC	179 ms 65,220 KB
testcase_40	AC	179 ms 65,012 KB
testcase_41	AC	181 ms 64,996 KB
testcase_42	AC	183 ms 65,188 KB
testcase_43	AC	185 ms 65,304 KB
testcase_44	AC	40 ms 49,228 KB
testcase_45	AC	40 ms 49,404 KB
testcase_46	AC	170 ms 65,172 KB
testcase_47	AC	171 ms 65,424 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest180615;
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 = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] x = na(n);
		int[] y = na(n);
		for(int i = 0;i < n;i++){
			y[i] = Math.abs(y[i]);
		}
		
		// dp[i] = dp[j] + d(j+1,i+1)
		// dp[i] = min(dp[j] + |a[i]-x[j+1]|+|y[j+1]|)
		long[] dp = new long[n+1];
		Arrays.fill(dp, Long.MAX_VALUE);
		dp[0] = 0;
		EnvelopeManhattan el = new EnvelopeManhattan(n);
		for(int i = 0;i < n;i++){
			el.add(x[i], y[i]+dp[i]);
			dp[i+1] = el.min(a[i]);
		}
		out.println(dp[n]);
	}
	
	public class EnvelopeManhattan {
		public static final long INF = Long.MIN_VALUE;
		
		public long[] xs;
		public long[] centers, heights;
		public int p;
		
		public EnvelopeManhattan(int n)
		{
			xs = new long[n];
			centers = new long[n];
			heights = new long[n];
			p = 0;
		}
		
		public void clear()
		{
			p = 0;
		}
		
		public void add(long center, long height)
		{
			assert p == 0 || centers[p-1] <= center;
			if(p > 0 && heights[p-1] + (center - centers[p-1]) <= height)return;
			while(p > 0){
				int i = p-1;
				if(p > 1 && height + (center - centers[p-1]) <= heights[p-1]){
					p--;
					continue;
				}
				// (x-c[i])+h[i] = -(x-C)+H
				// 2x = H-h[i]+C+c[i]
				long nx = floor(height-heights[i]+center+centers[i]+1, 2);
				xs[p] = nx;
				heights[p] = height;
				centers[p] = center;
				p++;
				return;
			}
			
			xs[p] = INF;
			heights[p] = height;
			centers[p] = center;
			p++;
		}
		
		public long floor(long a, long b)
		{
			if(b < 0){ a = -a; b = -b; }
			return a >= 0 ? a/b : (a-b+1)/b;
		}

		
		public int argmin(int x)
		{
			if(p <= 0)return -1;
			int ind = Arrays.binarySearch(xs, 0, p, x);
			if(ind < 0)ind = -ind-2;
			return ind;
		}
		
		public long min(long x)
		{
			if(p <= 0)return Long.MIN_VALUE;
			int ind = Arrays.binarySearch(xs, 0, p, x);
			if(ind < 0)ind = -ind-2;
			return Math.abs(centers[ind]-x) + heights[ind];
		}
	}
	
	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)); }
}

yukicoder

結果

テストケース

ソースコード