結果

問題 No.1739 Princess vs. Dragoness (& AoE)
ユーザー watarimaycry2watarimaycry2
提出日時 2021-11-12 23:13:37
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,459 ms / 3,000 ms
コード長 5,479 bytes
コンパイル時間 2,310 ms
コンパイル使用メモリ 84,340 KB
実行使用メモリ 85,720 KB
最終ジャッジ日時 2024-05-04 10:57:31
合計ジャッジ時間 49,268 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
37,360 KB
testcase_01 AC 45 ms
37,056 KB
testcase_02 AC 47 ms
37,552 KB
testcase_03 AC 45 ms
37,316 KB
testcase_04 AC 2,138 ms
77,816 KB
testcase_05 AC 2,259 ms
77,664 KB
testcase_06 AC 1,357 ms
78,384 KB
testcase_07 AC 50 ms
37,744 KB
testcase_08 AC 739 ms
61,584 KB
testcase_09 AC 1,019 ms
72,812 KB
testcase_10 AC 1,151 ms
58,976 KB
testcase_11 AC 876 ms
55,080 KB
testcase_12 AC 169 ms
45,392 KB
testcase_13 AC 1,486 ms
63,812 KB
testcase_14 AC 1,619 ms
66,684 KB
testcase_15 AC 1,671 ms
75,956 KB
testcase_16 AC 1,279 ms
54,048 KB
testcase_17 AC 1,033 ms
59,484 KB
testcase_18 AC 1,350 ms
60,688 KB
testcase_19 AC 757 ms
59,388 KB
testcase_20 AC 541 ms
51,668 KB
testcase_21 AC 1,267 ms
69,632 KB
testcase_22 AC 1,726 ms
79,808 KB
testcase_23 AC 2,355 ms
77,716 KB
testcase_24 AC 2,358 ms
85,400 KB
testcase_25 AC 1,975 ms
82,288 KB
testcase_26 AC 2,284 ms
85,720 KB
testcase_27 AC 2,003 ms
83,436 KB
testcase_28 AC 2,186 ms
83,404 KB
testcase_29 AC 2,166 ms
76,756 KB
testcase_30 AC 2,238 ms
77,452 KB
testcase_31 AC 2,459 ms
76,572 KB
testcase_32 AC 2,096 ms
77,100 KB
testcase_33 AC 60 ms
37,868 KB
testcase_34 AC 53 ms
37,272 KB
testcase_35 AC 78 ms
38,248 KB
testcase_36 AC 63 ms
37,888 KB
testcase_37 AC 56 ms
37,656 KB
testcase_38 AC 100 ms
39,948 KB
testcase_39 AC 118 ms
41,832 KB
testcase_40 AC 87 ms
39,568 KB
testcase_41 AC 99 ms
40,020 KB
testcase_42 AC 84 ms
39,680 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	//見なくていいよ ここから------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(buf);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.addAll(Arrays.asList(read.split(" ")));
				}
			}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");
			}
		}
	}
	//入力バッファサイズのつもり。入力点数(スペース区切りでの要素数)が100万を超える場合はバッファサイズを100万にすること
	static int buf = 1024;
	static HashMap<Integer, String> CONVSTR = new HashMap<>();
	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> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<String> nextStrArray(int size){
		ArrayList<String> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(next());
		}
		return ret;
	}
	static ArrayList<Integer> nextIntArray(int size){
		ArrayList<Integer> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Integer.parseInt(next()));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(int size){
		ArrayList<Long> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Long.parseLong(next()));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		StringBuilder sb = new StringBuilder("");
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof long[]){
			long[] tmp = (long[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof int[]){
			int[] tmp = (int[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof ArrayList){
			ArrayList tmp = (ArrayList)list;
			if(tmp.size() == 0){
				return "";
			}
			sb.append(tmp.get(0));
			for(int i = 1; i < tmp.size(); i++){
				sb.append(joinString).append(tmp.get(i));
			}
			return sb.toString();
		}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)));
	}
	static ArrayList<String> myconv(String str, String no){
		return new ArrayList<String>(Arrays.asList(str.split(no)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//見なくていいよ ここまで------------------------------------------
	//このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
	static void solve(){//ここがメイン関数
		int N = nextInt();
		int A = nextInt();
		int B = nextInt();
		int X = nextInt();
		int Y = nextInt();
		Node[] list = new Node[N];
		for(int i = 0; i < N; i++){
			list[i] = new Node(i, nextInt());
		}
		int L = -1;
		int R = 1000000000;
		while(R - L > 1){
			int C = (R + L) / 2;
			
			Node[] newlist = new Node[N];
			for(int i = 0; i < N; i++){
				newlist[i] = new Node(i, Math.max(list[i].A - C, 0));
			}
			PriorityQueue<Node> pq = new PriorityQueue<>(new MyComparator());
			for(int i = 0; i < N; i++){
				pq.add(newlist[i]);
			}
			int AA = A;
			while(AA > 0){
				Node now = pq.poll();
				if(now.A > 0){
					now.A = Math.max(0, now.A - X);
					AA--;
					pq.add(now);
				}else{
					pq.add(now);
					break;
				}
			}
			ArrayList<Node> tmp = new ArrayList<>(pq);
			Collections.sort(tmp, new MyComparator2());
			long nokori = 0;
			for(int i = 0; i < N; i++){
				newlist[i] = tmp.get(i);
				nokori += newlist[i].A;
			}
			
			if(nokori <= (long)B * Y){
				R = C;
			}else{
				L = C;
			}
		}
		myout(R);
		
		
		
	}
	//メソッド追加エリア ここから

static class MyComparator implements Comparator<Node>{
	public int compare(Node mae, Node ato){
		return ato.A - mae.A;
	}
}

static class MyComparator2 implements Comparator<Node>{
	public int compare(Node mae, Node ato){
		return mae.no - ato.no;
	}
}

static class Node{
	int A;
	int no;
	Node(int no, int A){
		this.no = no;
		this.A = A;
	}
}

	//メソッド追加エリア ここまで
}
0