結果
問題 | No.1554 array_and_me |
ユーザー | 37zigen |
提出日時 | 2021-06-19 02:30:28 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 360 ms / 2,000 ms |
コード長 | 3,252 bytes |
コンパイル時間 | 3,161 ms |
コンパイル使用メモリ | 75,388 KB |
実行使用メモリ | 67,756 KB |
最終ジャッジ日時 | 2023-09-05 00:39:18 |
合計ジャッジ時間 | 17,312 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 80 ms
56,984 KB |
testcase_01 | AC | 277 ms
64,824 KB |
testcase_02 | AC | 267 ms
64,892 KB |
testcase_03 | AC | 261 ms
63,824 KB |
testcase_04 | AC | 266 ms
64,724 KB |
testcase_05 | AC | 262 ms
64,492 KB |
testcase_06 | AC | 316 ms
67,624 KB |
testcase_07 | AC | 318 ms
67,572 KB |
testcase_08 | AC | 318 ms
67,488 KB |
testcase_09 | AC | 317 ms
67,556 KB |
testcase_10 | AC | 315 ms
67,756 KB |
testcase_11 | AC | 157 ms
64,356 KB |
testcase_12 | AC | 154 ms
64,204 KB |
testcase_13 | AC | 154 ms
64,464 KB |
testcase_14 | AC | 156 ms
64,536 KB |
testcase_15 | AC | 156 ms
64,488 KB |
testcase_16 | AC | 256 ms
64,080 KB |
testcase_17 | AC | 275 ms
63,780 KB |
testcase_18 | AC | 278 ms
64,100 KB |
testcase_19 | AC | 274 ms
63,596 KB |
testcase_20 | AC | 254 ms
64,084 KB |
testcase_21 | AC | 335 ms
65,308 KB |
testcase_22 | AC | 334 ms
65,376 KB |
testcase_23 | AC | 332 ms
65,484 KB |
testcase_24 | AC | 331 ms
65,636 KB |
testcase_25 | AC | 335 ms
65,408 KB |
testcase_26 | AC | 356 ms
64,832 KB |
testcase_27 | AC | 355 ms
64,808 KB |
testcase_28 | AC | 359 ms
64,952 KB |
testcase_29 | AC | 350 ms
64,500 KB |
testcase_30 | AC | 349 ms
65,132 KB |
testcase_31 | AC | 356 ms
64,616 KB |
testcase_32 | AC | 349 ms
64,732 KB |
testcase_33 | AC | 350 ms
64,924 KB |
testcase_34 | AC | 360 ms
64,860 KB |
testcase_35 | AC | 355 ms
64,184 KB |
testcase_36 | AC | 339 ms
65,184 KB |
testcase_37 | AC | 343 ms
65,672 KB |
testcase_38 | AC | 346 ms
65,128 KB |
testcase_39 | AC | 346 ms
65,008 KB |
testcase_40 | AC | 346 ms
65,328 KB |
testcase_41 | AC | 311 ms
65,248 KB |
ソースコード
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(); } long gcd(long a, long b) { return b==0?a:gcd(b,a%b); } class Q implements Comparable<Q>{ long n; long d; public Q(long n, long d) { this.n=n; this.d=d; } @Override public int compareTo(Main.Q o) { return Long.compare(-(n*o.d-o.n*d), 0); } } final long p=998244353; long[] inv=new long[1000000]; { inv[0]=inv[1]=1; for (int i=2;i<inv.length;++i) inv[i]=p-(p/i)*inv[(int)(p%i)]%p; } long pow(long a, long n) { return n==0?1:pow(a*a%p,n/2)*(n%2==1?a:1)%p; } long inv(long a) { return pow(a, p-2); } void run() { Scanner sc = new Scanner(); int T=sc.nextInt(); while (T-->0) { int N=sc.nextInt(); int K=sc.nextInt(); long[] A=new long[N]; for (int i=0;i<N;++i) { A[i]=sc.nextLong(); } long sumA=0; for (long a:A) sumA=(sumA+a)%p; PriorityQueue<Q> pq=new PriorityQueue<>(); for (long a:A) { pq.add(new Q(a,1)); } long ans=1; for (int i=0;i<K;++i) { Q q=pq.poll(); ans=ans*q.n%p*inv(q.d)%p*inv(sumA)%p; pq.add(new Q(q.n,q.d+1)); } for (long i=1;i<=K;++i) ans=ans*i%p; System.out.println(ans); } } class Scanner { 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 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()); } } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }