#265934 (Java21) No.703 ゴミ拾い Easy

提出ソース

結果

問題	No.703 ゴミ拾い Easy
ユーザー	uwi
提出日時	2018-06-15 22:35:56
言語	Java21 (openjdk 21)
結果	AC
実行時間	208 ms / 1,500 ms
コード長	4,935 bytes
コンパイル時間	4,630 ms
コンパイル使用メモリ	86,316 KB
実行使用メモリ	66,956 KB
最終ジャッジ日時	2023-08-30 18:56:04
合計ジャッジ時間	12,488 ms
ジャッジサーバーID （参考情報）	judge15 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	41 ms 49,608 KB
testcase_01	AC	44 ms 49,160 KB
testcase_02	AC	42 ms 49,448 KB
testcase_03	AC	42 ms 49,328 KB
testcase_04	AC	41 ms 49,380 KB
testcase_05	AC	40 ms 49,216 KB
testcase_06	AC	44 ms 49,552 KB
testcase_07	AC	44 ms 49,332 KB
testcase_08	AC	45 ms 47,148 KB
testcase_09	AC	44 ms 49,492 KB
testcase_10	AC	45 ms 47,724 KB
testcase_11	AC	44 ms 49,284 KB
testcase_12	AC	41 ms 49,496 KB
testcase_13	AC	40 ms 49,368 KB
testcase_14	AC	44 ms 47,300 KB
testcase_15	AC	45 ms 49,240 KB
testcase_16	AC	45 ms 49,220 KB
testcase_17	AC	45 ms 49,380 KB
testcase_18	AC	45 ms 49,260 KB
testcase_19	AC	45 ms 49,428 KB
testcase_20	AC	44 ms 49,452 KB
testcase_21	AC	45 ms 49,236 KB
testcase_22	AC	45 ms 49,376 KB
testcase_23	AC	49 ms 49,336 KB
testcase_24	AC	176 ms 64,892 KB
testcase_25	AC	182 ms 65,268 KB
testcase_26	AC	179 ms 65,400 KB
testcase_27	AC	181 ms 65,116 KB
testcase_28	AC	176 ms 65,164 KB
testcase_29	AC	186 ms 65,184 KB
testcase_30	AC	175 ms 65,260 KB
testcase_31	AC	178 ms 65,368 KB
testcase_32	AC	198 ms 64,852 KB
testcase_33	AC	177 ms 64,984 KB
testcase_34	AC	182 ms 64,968 KB
testcase_35	AC	177 ms 65,012 KB
testcase_36	AC	191 ms 64,684 KB
testcase_37	AC	182 ms 64,744 KB
testcase_38	AC	186 ms 64,948 KB
testcase_39	AC	188 ms 65,364 KB
testcase_40	AC	183 ms 66,956 KB
testcase_41	AC	200 ms 64,612 KB
testcase_42	AC	183 ms 65,292 KB
testcase_43	AC	190 ms 64,912 KB
testcase_44	AC	44 ms 49,272 KB
testcase_45	AC	43 ms 49,324 KB
testcase_46	AC	165 ms 64,848 KB
testcase_47	AC	208 ms 65,000 KB
testcase_48	AC	46 ms 49,316 KB
testcase_49	AC	46 ms 49,452 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 D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] x = na(n);
		int[] y = na(n);
		
		// dp[i] = dp[j] + d(j+1,i+1)
		// dp[i] = min(dp[j] + (a[i]-x[j+1])^2+y[j+1]^2)
		// dp[i] = min(dp[j] + a[i]^2-2x[j+1]a[i]+x[j+1]^2+y[j+1]^2)
		
		long[] dp = new long[n+1];
		Arrays.fill(dp, Long.MAX_VALUE);
		dp[0] = 0;
		EnvelopeLinear el = new EnvelopeLinear(n);
		for(int i = 0;i < n;i++){
			el.add(-2*x[i], (long)x[i]*x[i]+(long)y[i]*y[i]+dp[i]);
			dp[i+1] = el.min(a[i])+(long)a[i]*a[i];
		}
		out.println(dp[n]);
	}
	
	public class EnvelopeLinear {
		public static final long INF = Long.MIN_VALUE;
		
		public long[] xs;
		public long[] intercepts, slopes;
		public int p;
		
		public EnvelopeLinear(int n)
		{
			xs = new long[n];
			intercepts = new long[n];
			slopes = new long[n];
			p = 0;
		}
		
		public void clear()
		{
			p = 0;
		}
		
		public void add(long slope, long intercept)
		{
			assert p == 0 || slopes[p-1] >= slope;
			while(p > 0){
				int i = p-1;
				if(p > 1 && intercept+xs[i]*slope <= intercepts[i]+xs[i]*slopes[i]){ // x=xs[i]
					p--;
					continue;
				}
				if(slope == slopes[i]){
					if(intercept >= intercepts[i]){
						return;
					}else{
						p--;
						continue;
					}
				}
				// y=sx+i vs y=Sx+I
				// sx+i=Sx+I
				// x=(i-I)/(S-s)
				long num = intercept-intercepts[i];
				long den = slopes[i]-slope;
				long nx = num < 0 ? num/den : (num+den-1)/den;
				xs[p] = nx;
				intercepts[p] = intercept;
				slopes[p] = slope;
				p++;
				return;
			}
			
			xs[p] = INF;
			intercepts[p] = intercept;
			slopes[p] = slope;
			p++;
		}
		
		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 slopes[ind]*x + intercepts[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 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)); }
}

yukicoder

結果

テストケース

ソースコード