結果

問題 No.794 チーム戦 (2)
ユーザー tutuztutuz
提出日時 2019-02-22 23:31:27
言語 Java21
(openjdk 21)
結果
AC  
実行時間 316 ms / 1,500 ms
コード長 5,411 bytes
コンパイル時間 2,863 ms
コンパイル使用メモリ 87,164 KB
実行使用メモリ 44,952 KB
最終ジャッジ日時 2024-05-04 13:36:10
合計ジャッジ時間 10,263 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
37,236 KB
testcase_01 AC 55 ms
37,100 KB
testcase_02 AC 54 ms
37,648 KB
testcase_03 AC 54 ms
37,336 KB
testcase_04 AC 52 ms
37,204 KB
testcase_05 AC 53 ms
37,260 KB
testcase_06 AC 53 ms
37,432 KB
testcase_07 AC 57 ms
37,680 KB
testcase_08 AC 55 ms
37,368 KB
testcase_09 AC 56 ms
37,320 KB
testcase_10 AC 55 ms
37,384 KB
testcase_11 AC 55 ms
37,500 KB
testcase_12 AC 55 ms
37,384 KB
testcase_13 AC 56 ms
37,500 KB
testcase_14 AC 304 ms
43,628 KB
testcase_15 AC 315 ms
44,376 KB
testcase_16 AC 307 ms
44,316 KB
testcase_17 AC 313 ms
44,652 KB
testcase_18 AC 316 ms
44,344 KB
testcase_19 AC 297 ms
44,704 KB
testcase_20 AC 307 ms
44,928 KB
testcase_21 AC 308 ms
44,528 KB
testcase_22 AC 227 ms
42,116 KB
testcase_23 AC 220 ms
42,192 KB
testcase_24 AC 193 ms
40,828 KB
testcase_25 AC 187 ms
41,664 KB
testcase_26 AC 202 ms
42,208 KB
testcase_27 AC 195 ms
44,820 KB
testcase_28 AC 196 ms
44,100 KB
testcase_29 AC 193 ms
44,664 KB
testcase_30 AC 200 ms
44,736 KB
testcase_31 AC 184 ms
44,784 KB
testcase_32 AC 159 ms
44,788 KB
testcase_33 AC 200 ms
44,256 KB
testcase_34 AC 201 ms
44,952 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;

public class Main {

	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		MyInput in = new MyInput(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		public void solve(int testNumber, MyInput in, PrintWriter out) {

			int n = in.nextInt();
			long k = in.nextLong();
			long[] a = in.nextLongArray(n);
			Arrays.sort(a);

			long[] b = new long[n];
			for (int i = n-1; i >= 0; i--) {
				int idx = upperBound(a, k - a[i], i-1);
				b[i] = idx;
			}

			long ans = 1;
			long cnt = 0;
			for (int i = 0; i < n/2; i++) {
//				int idx = upperBound(a, k - a[i], i-1);
//				ans *= Math.max(idx - cnt, 1);
//				if (idx - cnt >= 0) cnt++;
				ans *= b[n-1-i] - i;
				ans %= MOD;
			}

			out.println(ans);
		}
	}

	public static int upperBound(long[] a, long obj, int R) {
		int l = 0, r = R;
		while (r - l >= 0) {
			int c = (l + r) / 2;
			if (a[c] <= obj) {
				l = c + 1;
			} else {
				r = c - 1;
			}
		}
		return l;
	}

	static class MyInput {
		private final BufferedReader in;
		private static int pos;
		private static int readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500 * 8 * 2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static {
			for (int i = 0; i < 10; i++) {
				isDigit['0' + i] = true;
			}
			isDigit['-'] = true;
			isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
			isLineSep['\r'] = isLineSep['\n'] = true;
		}

		public MyInput(InputStream is) {
			in = new BufferedReader(new InputStreamReader(is));
		}

		public int read() {
			if (pos >= readLen) {
				pos = 0;
				try {
					readLen = in.read(buffer);
				} catch (IOException e) {
					throw new RuntimeException();
				}
				if (readLen <= 0) {
					throw new MyInput.EndOfFileRuntimeException();
				}
			}
			return buffer[pos++];
		}

		public int nextInt() {
			int len = 0;
			str[len++] = nextChar();
			len = reads(len, isSpace);
			int i = 0;
			int ret = 0;
			if (str[0] == '-') {
				i = 1;
			}
			for (; i < len; i++)
				ret = ret * 10 + str[i] - '0';
			if (str[0] == '-') {
				ret = -ret;
			}
			return ret;
		}

		public long nextLong() {
			int len = 0;
			str[len++] = nextChar();
			len = reads(len, isSpace);
			int i = 0;
			long ret = 0;
			if (str[0] == '-') {
				i = 1;
			}
			for (; i < len; i++)
				ret = ret * 10 + str[i] - '0';
			if (str[0] == '-') {
				ret = -ret;
			}
			return ret;
		}

		public char nextChar() {
			while (true) {
				final int c = read();
				if (!isSpace[c]) {
					return (char) c;
				}
			}
		}

		public String nextString() {
			return new String(nextChars());
		}

		public char[] nextChars() {
			int len = 0;
			str[len++] = nextChar();
			len = reads(len, isSpace);
			return Arrays.copyOf(str, len);
		}

		public char[][] next2DChars(int h, int w) {
			char[][] s = new char[h][w];
			for (int i = 0; i < h; i++) {
				s[i] = nextChars();
			}
			return s;
		}

		int reads(int len, boolean[] accept) {
			try {
				while (true) {
					final int c = read();
					if (accept[c]) {
						break;
					}
					if (str.length == len) {
						char[] rep = new char[str.length * 3 / 2];
						System.arraycopy(str, 0, rep, 0, str.length);
						str = rep;
					}
					str[len++] = (char) c;
				}
			} catch (MyInput.EndOfFileRuntimeException e) {
			}
			return len;
		}

		public int[] nextIntArray(final int n) {
			final int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArray1Index(final int n) {
			final int[] res = new int[n + 1];
			for (int i = 1; i < n + 1; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(final int n) {
			final int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public long[] nextLongArray(final int n) {
			final long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArray1Index(final int n) {
			final long[] res = new long[n + 1];
			for (int i = 1; i < n + 1; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(final int n) {
			final long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		static class EndOfFileRuntimeException extends RuntimeException {
		}

	}

}
0