結果
問題 | No.1183 コイン遊び |
ユーザー | hiromi_ayase |
提出日時 | 2020-08-22 13:13:15 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 522 ms / 2,000 ms |
コード長 | 2,742 bytes |
コンパイル時間 | 3,429 ms |
コンパイル使用メモリ | 82,828 KB |
実行使用メモリ | 78,224 KB |
最終ジャッジ日時 | 2023-08-05 10:02:23 |
合計ジャッジ時間 | 18,459 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
50,684 KB |
testcase_01 | AC | 72 ms
51,200 KB |
testcase_02 | AC | 72 ms
51,008 KB |
testcase_03 | AC | 71 ms
51,000 KB |
testcase_04 | AC | 72 ms
50,784 KB |
testcase_05 | AC | 70 ms
50,760 KB |
testcase_06 | AC | 70 ms
48,860 KB |
testcase_07 | AC | 70 ms
51,168 KB |
testcase_08 | AC | 81 ms
51,636 KB |
testcase_09 | AC | 82 ms
51,500 KB |
testcase_10 | AC | 156 ms
56,252 KB |
testcase_11 | AC | 214 ms
57,224 KB |
testcase_12 | AC | 411 ms
67,856 KB |
testcase_13 | AC | 433 ms
67,052 KB |
testcase_14 | AC | 507 ms
77,788 KB |
testcase_15 | AC | 510 ms
78,224 KB |
testcase_16 | AC | 508 ms
77,344 KB |
testcase_17 | AC | 518 ms
77,852 KB |
testcase_18 | AC | 516 ms
77,800 KB |
testcase_19 | AC | 513 ms
77,820 KB |
testcase_20 | AC | 515 ms
77,396 KB |
testcase_21 | AC | 511 ms
75,896 KB |
testcase_22 | AC | 507 ms
77,624 KB |
testcase_23 | AC | 509 ms
77,632 KB |
testcase_24 | AC | 504 ms
77,596 KB |
testcase_25 | AC | 504 ms
77,576 KB |
testcase_26 | AC | 513 ms
77,584 KB |
testcase_27 | AC | 510 ms
77,844 KB |
testcase_28 | AC | 508 ms
77,660 KB |
testcase_29 | AC | 509 ms
77,516 KB |
testcase_30 | AC | 507 ms
77,720 KB |
testcase_31 | AC | 516 ms
77,744 KB |
testcase_32 | AC | 473 ms
76,736 KB |
testcase_33 | AC | 522 ms
77,596 KB |
testcase_34 | AC | 512 ms
77,556 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)); } }