#715899 (Java21) No.1736 Princess vs. Dragoness

• 問題: No.1736 Princess vs. Dragoness
• ユーザー: watarimaycry2
• 提出日時: 2021-11-12 22:52:58
• 言語: Java21 (openjdk 21)
• 結果: RE
• 実行時間: -
• コード長: 5,296 bytes
• コンパイル時間: 3,024 ms
• コンパイル使用メモリ: 96,192 KB
• 実行使用メモリ: 52,468 KB
• 最終ジャッジ日時: 2024-05-04 10:29:00
• 合計ジャッジ時間: 6,415 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	49 ms; 50,628 KB
testcase_01	AC	49 ms; 50,644 KB
testcase_02	AC	50 ms; 50,336 KB
testcase_03	AC	73 ms; 51,148 KB
testcase_04	AC	85 ms; 51,680 KB
testcase_05	RE	-
testcase_06	AC	91 ms; 51,892 KB
testcase_07	AC	103 ms; 52,176 KB
testcase_08	AC	94 ms; 51,820 KB
testcase_09	AC	101 ms; 52,468 KB
testcase_10	RE	-
testcase_11	AC	116 ms; 52,296 KB
testcase_12	AC	83 ms; 51,884 KB
testcase_13	AC	94 ms; 52,028 KB
testcase_14	AC	120 ms; 52,216 KB
testcase_15	AC	89 ms; 51,804 KB
testcase_16	AC	75 ms; 51,684 KB
testcase_17	AC	115 ms; 52,332 KB
testcase_18	AC	101 ms; 51,912 KB
testcase_19	AC	96 ms; 51,724 KB
testcase_20	AC	68 ms; 51,600 KB
testcase_21	AC	85 ms; 51,792 KB
testcase_22	AC	97 ms; 52,148 KB
testcase_23	AC	93 ms; 51,784 KB
testcase_24	AC	68 ms; 51,484 KB
testcase_25	RE	-
testcase_26	AC	91 ms; 51,988 KB
testcase_27	AC	89 ms; 51,976 KB
testcase_28	AC	88 ms; 51,932 KB
testcase_29	AC	92 ms; 52,164 KB
testcase_30	AC	92 ms; 51,944 KB
testcase_31	AC	89 ms; 51,652 KB
testcase_32	AC	92 ms; 51,852 KB
testcase_33	AC	54 ms; 50,528 KB
testcase_34	AC	54 ms; 50,424 KB
testcase_35	AC	54 ms; 50,388 KB

ソースコード

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();
		PriorityQueue<Node> pq = new PriorityQueue<>(new MyComparator());
		for(int i = 0; i < N; i++){
			pq.add(new Node(i, nextInt()));
		}
		while(A > 0){
			Node now = pq.poll();
			if(now.A > 0){
				now.A -= X;
				A--;
				pq.add(now);
			}else{
				break;
			}
		}
		ArrayList<Node> tmp = new ArrayList<>(pq);
		Collections.sort(tmp, new MyComparator2());
		Node[] list = new Node[N];
		for(int i = 0; i < N; i++){
			list[i] = tmp.get(i);
		}
		for(int i = 0; i < B; i++){
			int V = Y;
			for(int j = 0; j < N; j++){
				if(list[j].A > 0 && V > 0){
					int diff = Math.min(list[j].A, V);
					list[j].A -= diff;
					V -= diff;
				}
			}
		}
		for(int i = 0; i < N; i++){
			if(list[i].A > 0){
				myout("No");
				return;
			}
		}
		myout("Yes");
	}
	//メソッド追加エリア　ここから

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;
	}
}

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