結果

問題 No.507 ゲーム大会(チーム決め)
ユーザー hiromi_ayasehiromi_ayase
提出日時 2017-04-21 23:54:22
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,688 bytes
コンパイル時間 4,494 ms
コンパイル使用メモリ 74,500 KB
実行使用メモリ 57,004 KB
最終ジャッジ日時 2023-09-28 11:26:51
合計ジャッジ時間 6,869 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
49,656 KB
testcase_01 AC 43 ms
49,292 KB
testcase_02 AC 43 ms
49,448 KB
testcase_03 WA -
testcase_04 AC 44 ms
49,984 KB
testcase_05 AC 43 ms
49,492 KB
testcase_06 AC 44 ms
49,336 KB
testcase_07 AC 197 ms
56,608 KB
testcase_08 WA -
testcase_09 AC 158 ms
55,488 KB
testcase_10 AC 150 ms
55,624 KB
testcase_11 AC 158 ms
57,004 KB
testcase_12 AC 138 ms
55,684 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 43 ms
49,504 KB
testcase_20 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;


public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int N = sc.nextInt();
    int M = sc.nextInt();
    int K = sc.nextInt();
    N --;
    int[] a = sc.nextIntList(N);
    Arrays.sort(a);

    int left = -1;
    int right = a.length;
    while (right - left > 1) {
      int k = right + left >>> 1;
      
      int score = K + a[k] + 1;
      
      int[] arr = new int[N - 1];
      for (int i = 0, j = 0; i < N; i ++) {
        if (i != k)  arr[j ++] = a[i];
      }
      
      

      int count = count(arr, score);
      if (count < M) {
        right = k;
      } else {
        left = k;
      }
    }
    if (right < N) {
      System.out.println(a[right]);
    } else {
      System.out.println(-1);
    }
  }

  private static int count(int[] arr, int M) {
    int right = arr.length - 1;
    int left = 0;
    int count = 0;
    while (right > left) {
      while (right > left && arr[left] + arr[right] < M) {
        left ++;
      }
      if (right > left) {
        count ++;
      }
      right --;
    }
    
    return count;
  }
}


class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else 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 void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		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() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0