結果
問題 | No.1739 Princess vs. Dragoness (& AoE) |
ユーザー | watarimaycry2 |
提出日時 | 2021-11-12 23:13:37 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 5,479 bytes |
コンパイル時間 | 4,720 ms |
コンパイル使用メモリ | 87,972 KB |
実行使用メモリ | 91,648 KB |
最終ジャッジ日時 | 2023-08-17 03:47:32 |
合計ジャッジ時間 | 63,321 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
48,020 KB |
testcase_01 | AC | 47 ms
49,964 KB |
testcase_02 | AC | 48 ms
49,756 KB |
testcase_03 | AC | 47 ms
49,832 KB |
testcase_04 | AC | 2,690 ms
87,580 KB |
testcase_05 | AC | 2,695 ms
87,240 KB |
testcase_06 | AC | 1,468 ms
87,108 KB |
testcase_07 | AC | 45 ms
49,848 KB |
testcase_08 | AC | 998 ms
72,840 KB |
testcase_09 | AC | 1,261 ms
82,668 KB |
testcase_10 | AC | 1,517 ms
68,624 KB |
testcase_11 | AC | 1,173 ms
68,320 KB |
testcase_12 | AC | 189 ms
56,964 KB |
testcase_13 | AC | 1,958 ms
77,140 KB |
testcase_14 | AC | 2,071 ms
77,944 KB |
testcase_15 | AC | 2,259 ms
88,564 KB |
testcase_16 | AC | 1,739 ms
66,996 KB |
testcase_17 | AC | 1,290 ms
70,988 KB |
testcase_18 | AC | 1,695 ms
70,728 KB |
testcase_19 | AC | 950 ms
70,800 KB |
testcase_20 | AC | 647 ms
62,836 KB |
testcase_21 | AC | 1,698 ms
83,060 KB |
testcase_22 | AC | 2,355 ms
83,464 KB |
testcase_23 | TLE | - |
testcase_24 | AC | 2,923 ms
87,308 KB |
testcase_25 | AC | 2,398 ms
88,412 KB |
testcase_26 | TLE | - |
testcase_27 | AC | 2,523 ms
87,036 KB |
testcase_28 | AC | 2,769 ms
88,120 KB |
testcase_29 | AC | 2,739 ms
86,980 KB |
testcase_30 | TLE | - |
testcase_31 | TLE | - |
testcase_32 | AC | 2,650 ms
87,028 KB |
testcase_33 | AC | 59 ms
51,968 KB |
testcase_34 | AC | 46 ms
49,908 KB |
testcase_35 | AC | 77 ms
52,504 KB |
testcase_36 | AC | 65 ms
51,856 KB |
testcase_37 | AC | 52 ms
50,580 KB |
testcase_38 | AC | 91 ms
53,176 KB |
testcase_39 | AC | 133 ms
56,268 KB |
testcase_40 | AC | 89 ms
53,528 KB |
testcase_41 | AC | 97 ms
53,188 KB |
testcase_42 | AC | 76 ms
52,180 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(); 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; } } //メソッド追加エリア ここまで }