結果
問題 | No.1183 コイン遊び |
ユーザー | hiromi_ayase |
提出日時 | 2020-08-22 13:13:15 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 597 ms / 2,000 ms |
コード長 | 2,742 bytes |
コンパイル時間 | 3,007 ms |
コンパイル使用メモリ | 89,152 KB |
実行使用メモリ | 66,976 KB |
最終ジャッジ日時 | 2024-04-23 07:34:41 |
合計ジャッジ時間 | 15,365 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
51,228 KB |
testcase_01 | AC | 70 ms
51,320 KB |
testcase_02 | AC | 69 ms
51,304 KB |
testcase_03 | AC | 68 ms
51,076 KB |
testcase_04 | AC | 66 ms
51,436 KB |
testcase_05 | AC | 79 ms
51,300 KB |
testcase_06 | AC | 67 ms
51,404 KB |
testcase_07 | AC | 70 ms
51,384 KB |
testcase_08 | AC | 82 ms
51,796 KB |
testcase_09 | AC | 79 ms
51,892 KB |
testcase_10 | AC | 147 ms
55,044 KB |
testcase_11 | AC | 204 ms
57,144 KB |
testcase_12 | AC | 385 ms
66,976 KB |
testcase_13 | AC | 370 ms
56,160 KB |
testcase_14 | AC | 415 ms
64,124 KB |
testcase_15 | AC | 443 ms
65,072 KB |
testcase_16 | AC | 465 ms
64,816 KB |
testcase_17 | AC | 597 ms
64,680 KB |
testcase_18 | AC | 444 ms
64,500 KB |
testcase_19 | AC | 462 ms
65,096 KB |
testcase_20 | AC | 432 ms
65,556 KB |
testcase_21 | AC | 454 ms
65,056 KB |
testcase_22 | AC | 429 ms
65,400 KB |
testcase_23 | AC | 423 ms
64,452 KB |
testcase_24 | AC | 425 ms
65,376 KB |
testcase_25 | AC | 436 ms
65,240 KB |
testcase_26 | AC | 424 ms
64,400 KB |
testcase_27 | AC | 446 ms
64,880 KB |
testcase_28 | AC | 432 ms
64,896 KB |
testcase_29 | AC | 450 ms
64,656 KB |
testcase_30 | AC | 443 ms
64,948 KB |
testcase_31 | AC | 463 ms
65,584 KB |
testcase_32 | AC | 472 ms
65,484 KB |
testcase_33 | AC | 469 ms
64,828 KB |
testcase_34 | AC | 423 ms
65,020 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); int[] a = na(n); int[] b = na(n); int ret = 0; boolean flg = false; for (int i = 0; i < n; i++) { if (a[i] != b[i]) { flg = true; } else { if (flg) { flg = false; ret++; } } } if (flg) { ret++; } System.out.println(ret); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }