結果

問題 No.1905 PURE PHRASE
ユーザー hiromi_ayase
提出日時 2022-04-15 22:16:17
言語 Java
(openjdk 23)
結果
AC  
実行時間 245 ms / 2,000 ms
コード長 3,103 bytes
コンパイル時間 4,427 ms
コンパイル使用メモリ 89,252 KB
実行使用メモリ 44,416 KB
最終ジャッジ日時 2024-12-25 00:59:54
合計ジャッジ時間 15,732 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;

@SuppressWarnings("unused")
public class Main {

  private static void solve() {
    int n = ni();
    double[] freq = {261.6, 294.3, 327.0, 348.8, 392.4, 436.0, 490.5};
    String[] ret = { "C4", "D4", "E4", "F4", "G4", "A4", "B4"};

    int[] a = na(n);
    double min = Double.MAX_VALUE;
    int minArg = -1;
    for (int i = 0; i < freq.length; i ++) {
      double cur = score(a, freq[i]);
      if (cur < min) {
        min = cur;
        minArg = i;
      }
    }
    System.out.println(ret[minArg]);
  }

  private static double score(int[] a, double h) {
    double ret = 0;
    int n = a.length;
    for (int i = 0; i < a.length; i++) {
      double v = a[i] - a[(int)(i + n / h) % n];
      ret += v * v;
    }
    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