結果
問題 | No.794 チーム戦 (2) |
ユーザー | uwi |
提出日時 | 2019-02-22 21:28:07 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 284 ms / 1,500 ms |
コード長 | 3,795 bytes |
コンパイル時間 | 3,786 ms |
コンパイル使用メモリ | 81,440 KB |
実行使用メモリ | 55,724 KB |
最終ジャッジ日時 | 2023-08-16 15:29:59 |
合計ジャッジ時間 | 11,297 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
49,432 KB |
testcase_01 | AC | 41 ms
49,364 KB |
testcase_02 | AC | 42 ms
49,472 KB |
testcase_03 | AC | 43 ms
49,372 KB |
testcase_04 | AC | 43 ms
49,468 KB |
testcase_05 | AC | 43 ms
49,756 KB |
testcase_06 | AC | 42 ms
49,632 KB |
testcase_07 | AC | 42 ms
49,444 KB |
testcase_08 | AC | 44 ms
49,488 KB |
testcase_09 | AC | 42 ms
49,528 KB |
testcase_10 | AC | 42 ms
49,500 KB |
testcase_11 | AC | 42 ms
49,540 KB |
testcase_12 | AC | 43 ms
49,252 KB |
testcase_13 | AC | 42 ms
49,520 KB |
testcase_14 | AC | 277 ms
54,732 KB |
testcase_15 | AC | 273 ms
55,368 KB |
testcase_16 | AC | 283 ms
55,456 KB |
testcase_17 | AC | 274 ms
55,056 KB |
testcase_18 | AC | 270 ms
55,296 KB |
testcase_19 | AC | 276 ms
55,128 KB |
testcase_20 | AC | 275 ms
55,724 KB |
testcase_21 | AC | 284 ms
55,308 KB |
testcase_22 | AC | 205 ms
54,788 KB |
testcase_23 | AC | 191 ms
54,440 KB |
testcase_24 | AC | 163 ms
54,356 KB |
testcase_25 | AC | 154 ms
54,300 KB |
testcase_26 | AC | 158 ms
54,316 KB |
testcase_27 | AC | 110 ms
53,264 KB |
testcase_28 | AC | 107 ms
53,264 KB |
testcase_29 | AC | 107 ms
53,400 KB |
testcase_30 | AC | 111 ms
53,572 KB |
testcase_31 | AC | 115 ms
53,068 KB |
testcase_32 | AC | 113 ms
53,480 KB |
testcase_33 | AC | 109 ms
53,196 KB |
testcase_34 | AC | 111 ms
53,112 KB |
ソースコード
package contest190222; 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(), K = ni(); int[] a = na(n); Arrays.sort(a); int mod = 1000000007; int p = 0; long ret = 1; int done = 0; for(int i = n-1;i >= 0;i--) { int v = K-a[i]; while(p < n && a[p] <= v)p++; if(p < i) { ret = ret * (p-(n-1-i)) % mod; done++; }else { break; } } long rem = n-done*2; long u = rem/2; while(rem > 0) { ret = ret * (rem*(rem-1)/2%mod) % mod; rem -= 2; } long f = 1; for(int i = 1;i <= u;i++)f = f * i % mod; ret = ret * invl(f, mod) % mod; out.println(ret); } public static long invl(long a, long mod) { long b = mod; long p = 1, q = 0; while (b > 0) { long c = a / b; long d; d = a; a = b; b = d % b; d = p; p = q; q = d - c * q; } return p < 0 ? p + mod : p; } 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)); } }