結果

問題 No.1905 PURE PHRASE
ユーザー hiromi_ayasehiromi_ayase
提出日時 2022-04-15 22:16:17
言語 Java21
(openjdk 21)
結果
AC  
実行時間 208 ms / 2,000 ms
コード長 3,103 bytes
コンパイル時間 2,460 ms
コンパイル使用メモリ 86,784 KB
実行使用メモリ 44,104 KB
最終ジャッジ日時 2024-06-07 03:20:28
合計ジャッジ時間 12,094 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 190 ms
43,592 KB
testcase_01 AC 199 ms
43,892 KB
testcase_02 AC 198 ms
43,832 KB
testcase_03 AC 197 ms
43,844 KB
testcase_04 AC 198 ms
44,016 KB
testcase_05 AC 203 ms
44,088 KB
testcase_06 AC 196 ms
43,860 KB
testcase_07 AC 205 ms
43,768 KB
testcase_08 AC 202 ms
43,848 KB
testcase_09 AC 202 ms
43,888 KB
testcase_10 AC 205 ms
43,912 KB
testcase_11 AC 199 ms
43,944 KB
testcase_12 AC 198 ms
43,844 KB
testcase_13 AC 203 ms
43,920 KB
testcase_14 AC 187 ms
43,812 KB
testcase_15 AC 194 ms
43,868 KB
testcase_16 AC 189 ms
43,872 KB
testcase_17 AC 188 ms
43,928 KB
testcase_18 AC 197 ms
43,868 KB
testcase_19 AC 199 ms
43,768 KB
testcase_20 AC 197 ms
43,964 KB
testcase_21 AC 195 ms
43,884 KB
testcase_22 AC 200 ms
43,696 KB
testcase_23 AC 191 ms
44,000 KB
testcase_24 AC 194 ms
43,928 KB
testcase_25 AC 197 ms
43,808 KB
testcase_26 AC 183 ms
43,876 KB
testcase_27 AC 193 ms
43,908 KB
testcase_28 AC 192 ms
43,840 KB
testcase_29 AC 195 ms
43,792 KB
testcase_30 AC 198 ms
43,684 KB
testcase_31 AC 190 ms
43,408 KB
testcase_32 AC 202 ms
44,104 KB
testcase_33 AC 208 ms
43,684 KB
testcase_34 AC 197 ms
43,876 KB
testcase_35 AC 195 ms
43,832 KB
testcase_36 AC 195 ms
43,832 KB
testcase_37 AC 198 ms
43,840 KB
testcase_38 AC 197 ms
43,796 KB
testcase_39 AC 201 ms
43,928 KB
testcase_40 AC 197 ms
43,720 KB
権限があれば一括ダウンロードができます

ソースコード

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