結果

問題 No.983 Convolution
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-02-11 15:19:07
言語 Java17
(openjdk 17.0.1)
結果
AC  
実行時間 1,398 ms / 2,000 ms
コード長 4,064 bytes
コンパイル時間 1,984 ms
使用メモリ 90,832 KB
最終ジャッジ日時 2022-11-24 18:05:21
合計ジャッジ時間 24,079 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 379 ms
41,672 KB
testcase_01 AC 425 ms
42,344 KB
testcase_02 AC 443 ms
42,164 KB
testcase_03 AC 427 ms
59,944 KB
testcase_04 AC 458 ms
64,316 KB
testcase_05 AC 440 ms
57,484 KB
testcase_06 AC 524 ms
64,548 KB
testcase_07 AC 530 ms
58,260 KB
testcase_08 AC 427 ms
47,464 KB
testcase_09 AC 324 ms
46,652 KB
testcase_10 AC 423 ms
47,348 KB
testcase_11 AC 404 ms
49,488 KB
testcase_12 AC 464 ms
52,740 KB
testcase_13 AC 481 ms
52,460 KB
testcase_14 AC 452 ms
52,176 KB
testcase_15 AC 447 ms
54,380 KB
testcase_16 AC 426 ms
50,464 KB
testcase_17 AC 535 ms
55,988 KB
testcase_18 AC 419 ms
47,624 KB
testcase_19 AC 547 ms
55,800 KB
testcase_20 AC 499 ms
57,544 KB
testcase_21 AC 576 ms
67,916 KB
testcase_22 AC 422 ms
48,200 KB
testcase_23 AC 571 ms
47,816 KB
testcase_24 AC 472 ms
44,204 KB
testcase_25 AC 467 ms
44,344 KB
testcase_26 AC 493 ms
46,856 KB
testcase_27 AC 503 ms
46,664 KB
testcase_28 AC 1,065 ms
71,424 KB
testcase_29 AC 1,398 ms
90,832 KB
testcase_30 AC 1,054 ms
71,680 KB
testcase_31 AC 893 ms
62,308 KB
testcase_32 AC 1,097 ms
73,588 KB
testcase_33 AC 379 ms
41,532 KB
testcase_34 AC 359 ms
41,628 KB
testcase_35 AC 361 ms
41,564 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.math.BigInteger;

public class Main {

  private static void solve() {
    int n = ni();
    long[] a = nal(n);

    int m = 20;
    BigInteger[] b = new BigInteger[1 << m];
    for (int i = 0; i < (1 << m); i++) {
      if (i < n) {
        b[i] = BigInteger.valueOf(a[i]);
      } else {
        b[i] = BigInteger.ZERO;
      }
    }

    for (int j = 0; j < m; j++) {
      for (int i = 0; i < (1 << m); i++) {
        if (b[i].compareTo(BigInteger.ZERO) < 0)
          continue;

        if (((i >> j) & 1) == 0) {

          if (b[i ^ (1 << j)].compareTo(BigInteger.ZERO) < 0) {
            b[i] = BigInteger.valueOf(-1);
            break;
          }
          b[i] = b[i].add(b[i ^ (1 << j)]);
        }
      }
    }

    for (int i = 0; i < (1 << m); i++) {
      if (b[i].compareTo(BigInteger.ZERO) < 0)
        continue;
      b[i] = b[i].multiply(b[i]);
    }

    for (int j = 0; j < m; j++) {
      for (int i = 0; i < (1 << m); i++) {
        if (b[i].compareTo(BigInteger.ZERO) < 0)
          continue;
        if (((i >> j) & 1) == 0) {
          if (b[i ^ (1 << j)].compareTo(BigInteger.ZERO) < 0) {
            b[i] = BigInteger.valueOf(-1);
            break;
          }

          b[i] = b[i].subtract(b[i ^ (1 << j)]);
        }
      }
    }

    BigInteger ret = BigInteger.valueOf(-1);
    for (int i = 0; i < n; i++) {
      if (b[i].compareTo(BigInteger.ZERO) <= 0)
        continue;
      if (ret.compareTo(BigInteger.ZERO) < 0) {
        ret = b[i];
      } else {
        ret = ret.gcd(b[i]);
      }
    }

    System.out.println(ret);
  }

  public static long gcd(long a, long b) {
    while (b > 0) {
      long c = a;
      a = b;
      b = c % b;
    }
    return a;
  }


  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