結果

問題 No.598 オーバーフローファンタジー
ユーザー hiromi_ayase
提出日時 2017-11-24 22:29:17
言語 Java8
(openjdk 1.8.0.222)
結果
AC  
実行時間 88 ms
コード長 2,615 Byte
コンパイル時間 1,687 ms
使用メモリ 19,344 KB
最終ジャッジ日時 2019-10-15 06:09:30

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
0_0_sample_1.txt AC 81 ms
19,340 KB
0_1_sample_2.txt AC 80 ms
19,344 KB
0_2_sample_3.txt AC 78 ms
19,344 KB
1_0.txt AC 80 ms
19,344 KB
1_1.txt AC 82 ms
19,340 KB
1_2.txt AC 82 ms
19,344 KB
1_3.txt AC 82 ms
19,344 KB
1_4.txt AC 82 ms
19,344 KB
1_5.txt AC 83 ms
19,344 KB
1_8.txt AC 84 ms
19,340 KB
1_9.txt AC 85 ms
19,340 KB
1_10.txt AC 82 ms
19,340 KB
2_0.txt AC 82 ms
19,344 KB
2_1.txt AC 84 ms
19,344 KB
2_2.txt AC 86 ms
19,340 KB
2_3.txt AC 85 ms
19,340 KB
2_4.txt AC 88 ms
19,340 KB
3_0.txt AC 83 ms
19,340 KB
3_1.txt AC 85 ms
19,344 KB
3_2.txt AC 88 ms
19,340 KB
3_3.txt AC 87 ms
19,340 KB
3_4.txt AC 83 ms
19,340 KB
4_1.txt AC 83 ms
19,340 KB
4_2.txt AC 83 ms
19,340 KB
4_3.txt AC 80 ms
19,340 KB
5_0.txt AC 83 ms
19,344 KB
5_1.txt AC 81 ms
19,340 KB
99_system_test1.txt AC 87 ms
19,340 KB
99_system_test2.txt AC 84 ms
19,340 KB
99_system_test3.txt AC 84 ms
19,340 KB
99_system_test4.txt AC 82 ms
19,340 KB
テストケース一括ダウンロード

ソースコード

diff #
public class Main {
  private static void solve() {
    long n = ni();
    long x = ni();
    long a = ni();
    long b = ni();
    
    
    long ret1 = (x + a - 1) / a;
    long ret2 = ((1L << (n - 1)) - x + b - 1) / b;
    System.out.println(Math.min(ret1, ret2));
  }

  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));
  }
}


0