結果

問題 No.1251 絶対に間違ってはいけない最小化問題
コンテスト
ユーザー watarimaycry2
提出日時 2020-10-09 22:13:24
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,550 bytes
コンパイル時間 3,251 ms
コンパイル使用メモリ 80,468 KB
実行使用メモリ 78,944 KB
最終ジャッジ日時 2024-07-20 12:05:33
合計ジャッジ時間 30,363 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2 WA * 1
other AC * 2 WA * 40
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	static int N;
	static ArrayList<Integer> alist;
	static ArrayList<Integer> blist;
	static void solve(){//Here is the main function
		N = nextInt();
		alist = nextIntArray();
		blist = nextIntArray();
		double ng = 0;
		double ok = 100000000;
		while(Math.abs(ok - ng) >= 0.0000001){
			double c1 = (ng * 2 + ok) / 3;
			double c2 = (ng + ok * 2) / 3;
			if(F(c1) <= F(c2)){
				ok = c2;
			}else{
				ng = c1;
			}
		}
		String[] output = new String[2];
		output[0] = String.valueOf(String.format("%.10f", ok));
		output[1] = String.valueOf((long)F(ok));
		myout(myconv(output, 8));
	}
	//Method addition frame start

static double F(double X){
	double sum = 0;
	for(int i = 0; i < N; i++){
		sum += ((double)blist.get(i) * Math.abs(X - alist.get(i)));
	}
	return sum;
}

	//Method addition frame end

	//Don't have to see. start------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<String>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.add(read);
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	static HashMap<Integer, String> CONVSTR = new HashMap<Integer, String>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static double nextDouble(){return Double.parseDouble(next());}
	static ArrayList<String> nextStrArray(){return myconv(next(), 8);}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<Integer> nextIntArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Integer> ret = new ArrayList<Integer>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Integer.parseInt(input.get(i)));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Long> ret = new ArrayList<Long>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Long.parseLong(input.get(i)));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof ArrayList){
			return String.join(joinString, (ArrayList)list);
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//Don't have to see. end------------------------------------------
}
0