結果
問題 | No.733 分身並列コーディング |
ユーザー | 37zigen |
提出日時 | 2020-04-08 18:32:25 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,080 bytes |
コンパイル時間 | 3,272 ms |
コンパイル使用メモリ | 78,868 KB |
実行使用メモリ | 37,064 KB |
最終ジャッジ日時 | 2024-07-19 03:04:22 |
合計ジャッジ時間 | 6,998 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
36,488 KB |
testcase_01 | AC | 45 ms
36,716 KB |
testcase_02 | AC | 45 ms
36,628 KB |
testcase_03 | AC | 45 ms
36,716 KB |
testcase_04 | AC | 45 ms
36,712 KB |
testcase_05 | AC | 46 ms
36,628 KB |
testcase_06 | AC | 48 ms
36,280 KB |
testcase_07 | AC | 48 ms
36,664 KB |
testcase_08 | AC | 46 ms
36,468 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 45 ms
36,384 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 47 ms
36,608 KB |
testcase_16 | AC | 47 ms
36,576 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.PriorityQueue; public class Main { public static void main(String[] args) { new Main().run(); } boolean check(int[] t, int T, int num) { int n=t.length; PriorityQueue<Integer> in=new PriorityQueue<>(); for (int i=0;i<num;++i) in.add(0); int p=n-1; while (p>=0) { int time=in.poll(); if (t[p]+time > T) { return false; } else { if (p >= 0) in.add(t[p]+time); --p; } } return true; } void run() { FastScanner sc=new FastScanner(); int T=sc.nextInt(); int N=sc.nextInt(); int[] t=new int[N]; for (int i=0;i<N;++i) t[i]=sc.nextInt(); int ok=N; int ng=0; while(ok-ng>1) { int middle=(ok+ng)/2; if (check(t,T,middle)) { ok=middle; } else { ng=middle; } } System.out.println(ok); } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; 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;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(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 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 double nextDouble() { return Double.parseDouble(next());} }