結果
問題 | No.9 モンスターのレベル上げ |
ユーザー | ぴろず |
提出日時 | 2014-12-20 23:56:55 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,053 ms / 5,000 ms |
コード長 | 5,182 bytes |
コンパイル時間 | 3,083 ms |
コンパイル使用メモリ | 88,496 KB |
実行使用メモリ | 58,284 KB |
最終ジャッジ日時 | 2024-06-23 22:07:51 |
合計ジャッジ時間 | 13,907 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
50,344 KB |
testcase_01 | AC | 56 ms
50,212 KB |
testcase_02 | AC | 1,053 ms
57,740 KB |
testcase_03 | AC | 749 ms
57,984 KB |
testcase_04 | AC | 494 ms
58,152 KB |
testcase_05 | AC | 410 ms
57,896 KB |
testcase_06 | AC | 277 ms
57,572 KB |
testcase_07 | AC | 83 ms
50,800 KB |
testcase_08 | AC | 287 ms
58,032 KB |
testcase_09 | AC | 1,046 ms
57,928 KB |
testcase_10 | AC | 58 ms
50,480 KB |
testcase_11 | AC | 1,017 ms
58,040 KB |
testcase_12 | AC | 965 ms
57,980 KB |
testcase_13 | AC | 551 ms
57,904 KB |
testcase_14 | AC | 1,042 ms
57,752 KB |
testcase_15 | AC | 917 ms
58,284 KB |
testcase_16 | AC | 111 ms
52,060 KB |
testcase_17 | AC | 646 ms
58,196 KB |
testcase_18 | AC | 625 ms
57,984 KB |
testcase_19 | AC | 104 ms
51,828 KB |
ソースコード
package no009; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.InputMismatchException; import java.util.NoSuchElementException; import java.util.PriorityQueue; public class Main { public static void main(String[] args) { IO io = new IO(); int n = io.nextInt(); int[] a = io.arrayInt(n); int[] b = io.arrayInt(n); PriorityQueue<Monster> pq = new PriorityQueue<>(); int ans = 1<<29; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { pq.add(new Monster(a[j],0)); } for(int j=0;j<n;j++) { Monster use = pq.poll(); use.level += b[(i+j)%n] / 2; use.battlecount++; pq.offer(use); } int max = 0; for(int j=0;j<n;j++) { max = Math.max(max, pq.poll().battlecount); } ans = Math.min(ans,max); } System.out.println(ans); } static class Monster implements Comparable<Monster>{ int level,battlecount; public Monster(int level,int battlecount) { this.level = level; this.battlecount = battlecount; } public int compareTo(Monster o) { if (level != o.level) { return Integer.compare(level, o.level); } return Integer.compare(battlecount, o.battlecount); } public String toString() { return "(" + level + "," + battlecount + ")"; } } } class IO { private final InputStream in; private final PrintWriter out = new PrintWriter(System.out); private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public IO() { this(System.in);} public IO(InputStream source) { this.in = source;} private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private static boolean isNewLine(int c) { return c == '\n' || c == '\r';} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public boolean hasNextLine() { skipNewLine(); return hasNextByte();} public String next() { if (!hasNext()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public char[] nextCharArray(int len) { char[] s = new char[len]; if (!hasNext()) { throw new NoSuchElementException(); } int i = 0; int b = readByte(); while(isPrintableChar(b)) { if (i == len) { throw new InputMismatchException(); } s[i++] = (char) b; b = readByte(); } return s; } public String nextLine() { if (!hasNextLine()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(!isNewLine(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) { throw new NoSuchElementException(); } long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) { throw new NumberFormatException(); } return (int) nl; } public char nextChar() { if (!hasNext()) { throw new NoSuchElementException(); } return (char) readByte(); } public double nextDouble() { return Double.parseDouble(next());} public int[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;} public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;} public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;} public void arrayInt(int[]... a) {for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();} public int[][] matrixInt(int n,int m) { int[][] a = new int[n][m]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;} public char[][] charMap(int n,int m) { char[][] a = new char[n][m]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;} public void println(long x) { out.println(x);} public void println(double x) { out.println(x);} public void println(String s) { out.println(s);} public void println() { out.println(); } public void print(long x) { out.print(x); } public void print(double x) { out.print(x); } public void print(String s) { out.print(s); } public void print(char c) {out.print(c);} public void flush() {out.flush(); } }