結果
問題 | No.322 Geometry Dash |
ユーザー | ぴろず |
提出日時 | 2015-12-20 20:47:57 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 356 ms / 2,000 ms |
コード長 | 4,245 bytes |
コンパイル時間 | 2,480 ms |
コンパイル使用メモリ | 78,608 KB |
実行使用メモリ | 61,584 KB |
最終ジャッジ日時 | 2023-08-08 12:55:22 |
合計ジャッジ時間 | 15,310 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
50,068 KB |
testcase_01 | AC | 52 ms
49,820 KB |
testcase_02 | AC | 52 ms
49,888 KB |
testcase_03 | AC | 52 ms
49,908 KB |
testcase_04 | AC | 216 ms
58,380 KB |
testcase_05 | AC | 277 ms
59,664 KB |
testcase_06 | AC | 302 ms
61,584 KB |
testcase_07 | AC | 311 ms
59,980 KB |
testcase_08 | AC | 334 ms
59,596 KB |
testcase_09 | AC | 278 ms
61,036 KB |
testcase_10 | AC | 301 ms
58,928 KB |
testcase_11 | AC | 329 ms
60,028 KB |
testcase_12 | AC | 338 ms
59,724 KB |
testcase_13 | AC | 335 ms
60,292 KB |
testcase_14 | AC | 299 ms
59,212 KB |
testcase_15 | AC | 314 ms
59,408 KB |
testcase_16 | AC | 338 ms
59,840 KB |
testcase_17 | AC | 347 ms
60,344 KB |
testcase_18 | AC | 345 ms
60,432 KB |
testcase_19 | AC | 319 ms
59,908 KB |
testcase_20 | AC | 323 ms
59,936 KB |
testcase_21 | AC | 343 ms
60,848 KB |
testcase_22 | AC | 346 ms
60,188 KB |
testcase_23 | AC | 350 ms
60,648 KB |
testcase_24 | AC | 333 ms
60,044 KB |
testcase_25 | AC | 337 ms
59,764 KB |
testcase_26 | AC | 343 ms
60,100 KB |
testcase_27 | AC | 352 ms
59,828 KB |
testcase_28 | AC | 356 ms
60,692 KB |
testcase_29 | AC | 294 ms
59,692 KB |
testcase_30 | AC | 306 ms
60,312 KB |
ソースコード
package no322; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) { IO io = new IO(); int n = io.nextInt(); int[] t = io.nextIntArray(n); int[] d = io.nextIntArray(n); Pair[] p = new Pair[n]; for(int i=0;i<n;i++) { p[i] = new Pair(i,t[i],d[i]); } Arrays.sort(p,(x,y)->-Integer.compare(x.t*y.d, y.t*x.d)); for(int i=0;i<n;i++) { if (i > 0) { io.print(' '); } io.print(p[i].i + 1); } io.println(); io.flush(); } } class Pair { int i,t,d; public Pair(int i,int t,int d) { this.i = i; this.t = t; this.d = d; } } class IO extends PrintWriter { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public IO() { this(System.in);} public IO(InputStream source) { super(System.out); 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';} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; 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) { if (!hasNext()) { throw new NoSuchElementException(); } char[] s = new char[len]; 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[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;} public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;} public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;} public void nextIntArrays(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[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;} public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;} public void close() { super.close(); try {in.close();} catch (IOException e) {}} }