結果
問題 | No.1139 Slime Race |
ユーザー | shojin_pro |
提出日時 | 2020-07-31 21:27:45 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 296 ms / 2,000 ms |
コード長 | 2,195 bytes |
コンパイル時間 | 2,215 ms |
コンパイル使用メモリ | 78,100 KB |
実行使用メモリ | 62,624 KB |
最終ジャッジ日時 | 2024-07-02 08:16:33 |
合計ジャッジ時間 | 7,186 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
50,496 KB |
testcase_01 | AC | 52 ms
50,468 KB |
testcase_02 | AC | 53 ms
50,404 KB |
testcase_03 | AC | 53 ms
50,244 KB |
testcase_04 | AC | 52 ms
50,424 KB |
testcase_05 | AC | 51 ms
50,452 KB |
testcase_06 | AC | 95 ms
51,724 KB |
testcase_07 | AC | 53 ms
50,204 KB |
testcase_08 | AC | 52 ms
50,248 KB |
testcase_09 | AC | 51 ms
50,456 KB |
testcase_10 | AC | 250 ms
58,240 KB |
testcase_11 | AC | 227 ms
58,420 KB |
testcase_12 | AC | 276 ms
60,208 KB |
testcase_13 | AC | 51 ms
50,240 KB |
testcase_14 | AC | 257 ms
58,120 KB |
testcase_15 | AC | 268 ms
58,344 KB |
testcase_16 | AC | 295 ms
60,508 KB |
testcase_17 | AC | 272 ms
58,016 KB |
testcase_18 | AC | 246 ms
58,276 KB |
testcase_19 | AC | 218 ms
56,068 KB |
testcase_20 | AC | 204 ms
56,064 KB |
testcase_21 | AC | 237 ms
58,144 KB |
testcase_22 | AC | 276 ms
58,228 KB |
testcase_23 | AC | 296 ms
62,624 KB |
testcase_24 | AC | 52 ms
50,132 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(System.in); PrintWriter pw = new PrintWriter(System.out); int n = sc.nextInt(); long d = sc.nextLong(); long[] a = sc.nextLongArray(n); long[] b = sc.nextLongArray(n); long btotal = 0; for(long v : b){ btotal += v; } long ans = d/btotal; ans += d % btotal != 0 ? 1 : 0; pw.println(ans); pw.flush(); } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }