結果
問題 | No.507 ゲーム大会(チーム決め) |
ユーザー | uwi |
提出日時 | 2017-04-21 22:35:48 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,585 bytes |
コンパイル時間 | 4,887 ms |
コンパイル使用メモリ | 80,704 KB |
実行使用メモリ | 53,980 KB |
最終ジャッジ日時 | 2024-07-20 05:28:22 |
合計ジャッジ時間 | 7,984 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
50,052 KB |
testcase_01 | AC | 54 ms
49,948 KB |
testcase_02 | AC | 62 ms
50,392 KB |
testcase_03 | AC | 56 ms
50,092 KB |
testcase_04 | AC | 55 ms
50,340 KB |
testcase_05 | AC | 56 ms
50,448 KB |
testcase_06 | AC | 58 ms
50,204 KB |
testcase_07 | AC | 220 ms
53,168 KB |
testcase_08 | AC | 168 ms
53,036 KB |
testcase_09 | AC | 119 ms
51,956 KB |
testcase_10 | AC | 106 ms
51,860 KB |
testcase_11 | AC | 120 ms
52,000 KB |
testcase_12 | AC | 105 ms
51,864 KB |
testcase_13 | AC | 168 ms
53,204 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 54 ms
50,184 KB |
testcase_18 | AC | 56 ms
50,448 KB |
testcase_19 | WA | - |
testcase_20 | AC | 57 ms
50,532 KB |
ソースコード
package contest170421; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class D { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); int v = ni(); int[] a = na(n-1); Arrays.sort(a); int low = -1, high = n-1; while(high - low > 1){ int h = high+low>>1; if(ok(h, a, v, m)){ high = h; }else{ low = h; } } if(high == n-1){ out.println(-1); }else{ out.println(a[high]); } } boolean ok(int h, int[] a, int v, int m) { int n = a.length; int s = v + a[h]; int p = 0; int up = 0; for(int i = n-1;i >= 0;i--){ while(p < i && (a[p] + a[i] <= s || p == h)){ p++; } if(p >= i)break; up++; p++; } return up < m; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }