結果

問題 No.761 平均値ゲーム
ユーザー tenten
提出日時 2023-06-16 13:13:09
言語 Java
(openjdk 23)
結果
AC  
実行時間 259 ms / 2,000 ms
コード長 2,452 bytes
コンパイル時間 2,749 ms
コンパイル使用メモリ 91,200 KB
実行使用メモリ 49,956 KB
最終ジャッジ日時 2024-06-24 07:01:53
合計ジャッジ時間 20,971 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 100
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
static long[] values;
static long[] sums;
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
values = new long[n + 1];
sums = new long[n + 1];
for (int i = 1; i <= n; i++) {
values[i] = sc.nextLong();
sums[i] = sums[i - 1] + values[i];
}
if (getTF(0, n)) {
System.out.println("First");
} else {
System.out.println("Second");
}
}
static boolean getTF(int start, int end) {
if (end - start == 1) {
return true;
}
if (values[end] * (end - start) == sums[end] - sums[start]) {
return true;
}
double avg = (double)(sums[end] - sums[start]) / (end - start);
int left = start;
int right = end;
while (right - left > 1) {
int m = (left + right) / 2;
if (values[m] >= avg) {
right = m;
} else {
left = m;
}
}
return !(getTF(start, left) && getTF(left, end));
}
}
class Utilities {
static String arrayToLineString(Object[] arr) {
return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
}
static String arrayToLineString(int[] arr) {
return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
}
}
class Scanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
StringBuilder sb = new StringBuilder();
public Scanner() throws Exception {
}
public int nextInt() throws Exception {
return Integer.parseInt(next());
}
public long nextLong() throws Exception {
return Long.parseLong(next());
}
public double nextDouble() throws Exception {
return Double.parseDouble(next());
}
public int[] nextIntArray() throws Exception {
return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
}
public String next() throws Exception {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0