結果

問題 No.704 ゴミ拾い Medium
ユーザー uwiuwi
提出日時 2018-06-15 22:50:45
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,857 bytes
コンパイル時間 4,218 ms
コンパイル使用メモリ 80,740 KB
実行使用メモリ 54,892 KB
最終ジャッジ日時 2024-06-30 15:13:17
合計ジャッジ時間 11,092 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
36,860 KB
testcase_01 AC 45 ms
36,804 KB
testcase_02 AC 45 ms
36,872 KB
testcase_03 AC 48 ms
36,492 KB
testcase_04 AC 47 ms
36,644 KB
testcase_05 AC 47 ms
36,992 KB
testcase_06 WA -
testcase_07 AC 49 ms
36,804 KB
testcase_08 AC 47 ms
37,116 KB
testcase_09 AC 49 ms
36,868 KB
testcase_10 AC 45 ms
36,736 KB
testcase_11 AC 48 ms
37,140 KB
testcase_12 AC 46 ms
37,140 KB
testcase_13 AC 45 ms
36,788 KB
testcase_14 AC 46 ms
36,984 KB
testcase_15 AC 49 ms
37,128 KB
testcase_16 AC 49 ms
37,100 KB
testcase_17 AC 48 ms
36,860 KB
testcase_18 AC 50 ms
36,900 KB
testcase_19 AC 48 ms
37,104 KB
testcase_20 AC 47 ms
36,492 KB
testcase_21 AC 46 ms
36,720 KB
testcase_22 AC 47 ms
37,116 KB
testcase_23 AC 49 ms
37,112 KB
testcase_24 AC 183 ms
54,112 KB
testcase_25 AC 197 ms
54,172 KB
testcase_26 AC 185 ms
54,416 KB
testcase_27 AC 194 ms
54,084 KB
testcase_28 AC 185 ms
54,408 KB
testcase_29 AC 193 ms
54,268 KB
testcase_30 AC 190 ms
54,024 KB
testcase_31 AC 196 ms
54,136 KB
testcase_32 AC 185 ms
54,148 KB
testcase_33 AC 189 ms
54,324 KB
testcase_34 AC 191 ms
53,920 KB
testcase_35 AC 174 ms
53,908 KB
testcase_36 AC 186 ms
54,892 KB
testcase_37 AC 187 ms
54,656 KB
testcase_38 AC 183 ms
54,416 KB
testcase_39 AC 179 ms
54,000 KB
testcase_40 AC 176 ms
54,484 KB
testcase_41 AC 185 ms
53,888 KB
testcase_42 AC 188 ms
54,536 KB
testcase_43 AC 186 ms
54,244 KB
testcase_44 AC 47 ms
36,796 KB
testcase_45 AC 49 ms
36,800 KB
testcase_46 AC 191 ms
54,308 KB
testcase_47 AC 182 ms
54,156 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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], 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)); }
}
0