結果
問題 | No.1739 Princess vs. Dragoness (& AoE) |
ユーザー |
![]() |
提出日時 | 2021-11-12 23:13:37 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 2,503 ms / 3,000 ms |
コード長 | 5,479 bytes |
コンパイル時間 | 2,574 ms |
コンパイル使用メモリ | 82,256 KB |
実行使用メモリ | 88,636 KB |
最終ジャッジ日時 | 2024-11-25 21:25:22 |
合計ジャッジ時間 | 50,766 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 40 |
ソースコード
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; } } //メソッド追加エリア ここまで }