結果

問題 No.1251 絶対に間違ってはいけない最小化問題
ユーザー uwiuwi
提出日時 2020-10-09 21:28:01
言語 Java21
(openjdk 21)
結果
AC  
実行時間 591 ms / 2,000 ms
コード長 3,971 bytes
コンパイル時間 6,042 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 65,552 KB
最終ジャッジ日時 2024-07-20 08:43:21
合計ジャッジ時間 29,390 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 90 ms
51,308 KB
testcase_01 AC 91 ms
51,148 KB
testcase_02 AC 94 ms
50,884 KB
testcase_03 AC 90 ms
51,112 KB
testcase_04 AC 91 ms
50,944 KB
testcase_05 AC 90 ms
51,000 KB
testcase_06 AC 91 ms
51,320 KB
testcase_07 AC 92 ms
51,256 KB
testcase_08 AC 91 ms
51,176 KB
testcase_09 AC 90 ms
51,344 KB
testcase_10 AC 89 ms
51,384 KB
testcase_11 AC 89 ms
51,020 KB
testcase_12 AC 92 ms
51,264 KB
testcase_13 AC 90 ms
51,164 KB
testcase_14 AC 93 ms
50,872 KB
testcase_15 AC 90 ms
51,348 KB
testcase_16 AC 92 ms
50,940 KB
testcase_17 AC 91 ms
50,884 KB
testcase_18 AC 511 ms
65,180 KB
testcase_19 AC 458 ms
64,952 KB
testcase_20 AC 330 ms
60,072 KB
testcase_21 AC 185 ms
54,708 KB
testcase_22 AC 366 ms
60,692 KB
testcase_23 AC 150 ms
53,620 KB
testcase_24 AC 415 ms
63,068 KB
testcase_25 AC 340 ms
60,492 KB
testcase_26 AC 232 ms
57,736 KB
testcase_27 AC 151 ms
53,536 KB
testcase_28 AC 501 ms
64,900 KB
testcase_29 AC 492 ms
65,552 KB
testcase_30 AC 503 ms
64,996 KB
testcase_31 AC 495 ms
65,072 KB
testcase_32 AC 591 ms
64,884 KB
testcase_33 AC 515 ms
64,860 KB
testcase_34 AC 512 ms
64,816 KB
testcase_35 AC 581 ms
64,988 KB
testcase_36 AC 526 ms
65,032 KB
testcase_37 AC 499 ms
65,212 KB
testcase_38 AC 536 ms
65,180 KB
testcase_39 AC 523 ms
64,844 KB
testcase_40 AC 494 ms
64,680 KB
testcase_41 AC 511 ms
64,684 KB
testcase_42 AC 538 ms
65,248 KB
testcase_43 AC 92 ms
51,216 KB
testcase_44 AC 91 ms
51,084 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest201009;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] b = na(n);
		int[][] ab = new int[n][];
		for(int i = 0;i < n;i++){
			ab[i] = new int[]{a[i], b[i]};
		}
		Arrays.sort(ab, (x, y) -> {
			if (x[0] != y[0]) return x[0] - y[0];
			return (x[1] - y[1]);
		});


		long[] bc = new long[n+1];
		for(int i = 0;i < n;i++){
			bc[i+1] = bc[i] + ab[i][1];
		}
		for(int i = 0;i <= n;i++){
			if(bc[i] >= bc[n] - bc[i]){
				// [0,i), [i,n)
				long ans = Long.MAX_VALUE;
				int arg = -1;
				{
					long can = go(i - 1, ab);
					if (can < ans) {
						ans = can;
						arg = ab[i - 1][0];
					}
				}
				{
					long can = go(i, ab);
					if (can < ans) {
						ans = can;
						arg = ab[i - 1][0];
					}
				}
				out.println(arg + " " + ans);
				return;
			}
		}
	}

	long go(int p, int[][] ab)
	{
		int n = ab.length;
		if(p < 0 || p >= n)return Long.MAX_VALUE;
		long ret = 0;
		for(int[] v : ab){
			ret += (long)Math.abs(v[0]-ab[p][0])*v[1];
		}
		return ret;
	}
	
	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 C().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