結果
問題 | No.2008 Super Worker |
ユーザー | tenten |
提出日時 | 2023-04-26 16:41:19 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 705 ms / 2,000 ms |
コード長 | 2,480 bytes |
コンパイル時間 | 2,930 ms |
コンパイル使用メモリ | 91,684 KB |
実行使用メモリ | 73,136 KB |
最終ジャッジ日時 | 2024-04-27 18:57:47 |
合計ジャッジ時間 | 14,338 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
50,284 KB |
testcase_01 | AC | 46 ms
50,468 KB |
testcase_02 | AC | 46 ms
50,396 KB |
testcase_03 | AC | 47 ms
50,432 KB |
testcase_04 | AC | 46 ms
50,464 KB |
testcase_05 | AC | 48 ms
50,280 KB |
testcase_06 | AC | 47 ms
50,460 KB |
testcase_07 | AC | 47 ms
50,232 KB |
testcase_08 | AC | 47 ms
50,124 KB |
testcase_09 | AC | 48 ms
50,480 KB |
testcase_10 | AC | 49 ms
50,544 KB |
testcase_11 | AC | 48 ms
50,516 KB |
testcase_12 | AC | 49 ms
50,124 KB |
testcase_13 | AC | 65 ms
51,572 KB |
testcase_14 | AC | 75 ms
51,540 KB |
testcase_15 | AC | 63 ms
51,260 KB |
testcase_16 | AC | 66 ms
51,404 KB |
testcase_17 | AC | 79 ms
51,540 KB |
testcase_18 | AC | 91 ms
52,044 KB |
testcase_19 | AC | 84 ms
51,044 KB |
testcase_20 | AC | 75 ms
51,552 KB |
testcase_21 | AC | 84 ms
51,592 KB |
testcase_22 | AC | 83 ms
51,900 KB |
testcase_23 | AC | 622 ms
71,280 KB |
testcase_24 | AC | 606 ms
69,884 KB |
testcase_25 | AC | 512 ms
69,604 KB |
testcase_26 | AC | 630 ms
69,820 KB |
testcase_27 | AC | 542 ms
69,476 KB |
testcase_28 | AC | 705 ms
71,052 KB |
testcase_29 | AC | 643 ms
70,456 KB |
testcase_30 | AC | 694 ms
71,176 KB |
testcase_31 | AC | 664 ms
71,564 KB |
testcase_32 | AC | 621 ms
70,352 KB |
testcase_33 | AC | 440 ms
70,876 KB |
testcase_34 | AC | 693 ms
73,136 KB |
testcase_35 | AC | 367 ms
66,868 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static final int MOD = 1000000007; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); Work[] works = new Work[n]; for (int i = 0; i < n; i++) { works[i] = new Work(sc.nextInt(), 0); } for (int i = 0; i < n; i++) { works[i].b = sc.nextInt(); } Arrays.sort(works); long current = 1; long ans = 0; for (Work x : works) { ans += current * x.a; ans %= MOD; current *= x.b; current %= MOD; } System.out.println(ans); } static class Work implements Comparable<Work> { long a; long b; public Work(long a, long b) { this.a = a; this.b = b; } public int compareTo(Work another) { long value = a * (another.b - 1) - another.a * (b - 1); if (value == 0) { return 0; } else if (value > 0) { return 1; } else { return -1; } } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }