結果

問題 No.1084 積の積
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-06-20 05:20:38
言語 Java19
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,391 bytes
コンパイル時間 5,445 ms
コンパイル使用メモリ 83,632 KB
実行使用メモリ 60,108 KB
最終ジャッジ日時 2023-09-16 16:43:48
合計ジャッジ時間 10,422 ms
ジャッジサーバーID
(参考情報)
judge12 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 69 ms
50,652 KB
testcase_01 AC 70 ms
50,880 KB
testcase_02 AC 71 ms
50,604 KB
testcase_03 AC 71 ms
50,916 KB
testcase_04 WA -
testcase_05 AC 204 ms
57,112 KB
testcase_06 AC 320 ms
59,424 KB
testcase_07 AC 70 ms
50,780 KB
testcase_08 AC 69 ms
50,940 KB
testcase_09 AC 240 ms
58,484 KB
testcase_10 AC 69 ms
50,496 KB
testcase_11 AC 98 ms
52,720 KB
testcase_12 AC 223 ms
57,500 KB
testcase_13 AC 261 ms
58,376 KB
testcase_14 AC 208 ms
56,884 KB
testcase_15 AC 194 ms
56,912 KB
testcase_16 AC 273 ms
58,084 KB
testcase_17 AC 224 ms
57,164 KB
testcase_18 AC 257 ms
56,480 KB
testcase_19 AC 267 ms
58,140 KB
testcase_20 AC 186 ms
56,812 KB
testcase_21 AC 209 ms
56,868 KB
testcase_22 AC 182 ms
56,292 KB
testcase_23 AC 234 ms
57,168 KB
testcase_24 AC 227 ms
56,908 KB
testcase_25 AC 264 ms
58,668 KB
testcase_26 AC 256 ms
57,268 KB
testcase_27 AC 252 ms
59,896 KB
testcase_28 AC 257 ms
57,444 KB
testcase_29 AC 260 ms
57,404 KB
testcase_30 AC 258 ms
57,636 KB
testcase_31 AC 262 ms
57,412 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

public class Main {

  private static void solve() {
    int n = ni();
    long[] a = nal(n);
    for (long v : a) {
      if (v == 0) {
        System.out.println(0);
        return;
      }
    }

    long x = 1;
    int right = 0;
    long[] b = new long[n + 1];
    long[] c = new long[n + 1];
    for (int left = 0; left < n; left++) {
      while (right < n && x * a[right] <= (int) 1e9) {
        x *= a[right++];
      }
      int v = right - left;
      b[left] = v;
      c[right]++;

      x /= a[left];
    }

    long s = 0;
    long t = 0;
    long ret = 1;
    int mod = (int) 1e9 + 7;
    for (int i = 0; i < n; i++) {
      s += b[i];
      t += 1 - c[i];
      ret *= pow(a[i], s, mod);
      s -= t;
      ret %= mod;
    }
    System.out.println(ret);
  }

  private static long pow(long a, long n, long mod) {
    // a %= mod;
    long ret = 1;
    int x = 63 - Long.numberOfLeadingZeros(n);
    for (; x >= 0; x--) {
      ret = ret * ret % mod;
      if (n << 63 - x < 0)
        ret = ret * a % mod;
    }
    return 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));
  }
}
0