結果

問題 No.983 Convolution
ユーザー hiromi_ayase
提出日時 2020-02-11 15:11:35
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,632 bytes
コンパイル時間 2,583 ms
コンパイル使用メモリ 89,740 KB
実行使用メモリ 60,240 KB
最終ジャッジ日時 2024-10-01 07:51:42
合計ジャッジ時間 8,864 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 3 WA * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

public class Main {
  private static void solve() {
    int n = ni();
    long[] a = nal(n);
    int m = 3;
    long[] b = new long[1 << m];
    for (int i = 0; i < n; i++) {
      b[i] = a[i];
    }
    for (int j = 0; j < m; j++) {
      for (int i = 0; i < (1 << m); i++) {
        if (b[i] < 0)
          continue;
        if (((i >> j) & 1) == 0) {
          if (b[i ^ (1 << j)] < 0) {
            b[i] = -1;
            break;
          }
          b[i] += b[i ^ (1 << j)];
        }
      }
    }
    for (int i = 0; i < (1 << m); i++) {
      if (b[i] < 0)
        continue;
      b[i] = b[i] * b[i];
    }
    for (int j = 0; j < m; j++) {
      for (int i = 0; i < (1 << m); i++) {
        if (b[i] < 0)
          continue;
        if (((i >> j) & 1) == 0) {
          if (b[i ^ (1 << j)] < 0) {
            b[i] = -1;
            break;
          }
          b[i] -= b[i ^ (1 << j)];
        }
      }
    }
    long ret = -1;
    for (int i = 0; i < n; i++) {
      if (b[i] < 0)
        continue;
      if (ret < 0) {
        ret = b[i];
      } else {
        ret = gcd(ret, 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));
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0