結果
問題 | No.939 and or |
ユーザー | hiromi_ayase |
提出日時 | 2019-12-03 22:23:40 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 77 ms / 2,000 ms |
コード長 | 2,839 bytes |
コンパイル時間 | 4,286 ms |
コンパイル使用メモリ | 82,500 KB |
実行使用メモリ | 38,540 KB |
最終ジャッジ日時 | 2024-05-05 20:31:53 |
合計ジャッジ時間 | 5,931 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
38,012 KB |
testcase_01 | AC | 77 ms
38,088 KB |
testcase_02 | AC | 75 ms
38,236 KB |
testcase_03 | AC | 74 ms
38,120 KB |
testcase_04 | AC | 75 ms
38,412 KB |
testcase_05 | AC | 74 ms
38,340 KB |
testcase_06 | AC | 76 ms
37,904 KB |
testcase_07 | AC | 75 ms
37,944 KB |
testcase_08 | AC | 75 ms
38,236 KB |
testcase_09 | AC | 76 ms
38,060 KB |
testcase_10 | AC | 75 ms
38,012 KB |
testcase_11 | AC | 75 ms
38,176 KB |
testcase_12 | AC | 76 ms
37,988 KB |
testcase_13 | AC | 76 ms
38,176 KB |
testcase_14 | AC | 75 ms
38,540 KB |
testcase_15 | AC | 75 ms
38,176 KB |
testcase_16 | AC | 76 ms
38,016 KB |
testcase_17 | AC | 76 ms
38,308 KB |
testcase_18 | AC | 77 ms
38,268 KB |
testcase_19 | AC | 76 ms
37,996 KB |
testcase_20 | AC | 75 ms
38,120 KB |
testcase_21 | AC | 74 ms
38,120 KB |
testcase_22 | AC | 75 ms
38,412 KB |
testcase_23 | AC | 77 ms
38,120 KB |
testcase_24 | AC | 74 ms
38,176 KB |
testcase_25 | AC | 74 ms
38,288 KB |
testcase_26 | AC | 75 ms
38,120 KB |
testcase_27 | AC | 74 ms
38,412 KB |
testcase_28 | AC | 75 ms
38,332 KB |
testcase_29 | AC | 75 ms
38,236 KB |
testcase_30 | AC | 77 ms
38,444 KB |
testcase_31 | AC | 75 ms
37,964 KB |
ソースコード
public class Main { private static void solve() { int a = ni(); int b = ni(); // 0:x=y 1:x<y long[] dp = new long[2]; dp[0] = 1; for (int i = 31; i >= 0; i--) { int dand = (a >> i) & 1; int dor = (b >> i) & 1; if (dand == 1 && dor == 0) { System.out.println(0); return; } else if (dand == 0 && dor == 1) { dp[1] *= 2; dp[1] += dp[0]; dp[0] = 0; } } System.out.println(dp[0] + dp[1]); } 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)); } }