#303005 (Java21) No.761 平均値ゲーム

提出ソース

結果

問題	No.761 平均値ゲーム
ユーザー	uwi
提出日時	2018-12-10 00:31:27
言語	Java21 (openjdk 21)
結果	AC
実行時間	102 ms / 2,000 ms
コード長	3,570 bytes
コンパイル時間	3,812 ms
コンパイル使用メモリ	80,520 KB
実行使用メモリ	40,036 KB
最終ジャッジ日時	2024-09-16 15:41:34
合計ジャッジ時間	14,764 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	48 ms 36,764 KB
testcase_01	AC	47 ms 37,028 KB
testcase_02	AC	48 ms 36,916 KB
testcase_03	AC	47 ms 36,916 KB
testcase_04	AC	47 ms 36,508 KB
testcase_05	AC	45 ms 36,504 KB
testcase_06	AC	45 ms 36,840 KB
testcase_07	AC	45 ms 36,948 KB
testcase_08	AC	46 ms 36,840 KB
testcase_09	AC	47 ms 36,672 KB
testcase_10	AC	45 ms 36,520 KB
testcase_11	AC	46 ms 36,532 KB
testcase_12	AC	47 ms 36,884 KB
testcase_13	AC	46 ms 36,540 KB
testcase_14	AC	46 ms 36,884 KB
testcase_15	AC	50 ms 37,044 KB
testcase_16	AC	50 ms 36,960 KB
testcase_17	AC	51 ms 36,524 KB
testcase_18	AC	49 ms 36,496 KB
testcase_19	AC	48 ms 36,824 KB
testcase_20	AC	45 ms 36,864 KB
testcase_21	AC	47 ms 36,980 KB
testcase_22	AC	46 ms 36,648 KB
testcase_23	AC	46 ms 36,504 KB
testcase_24	AC	47 ms 36,472 KB
testcase_25	AC	46 ms 36,840 KB
testcase_26	AC	44 ms 36,780 KB
testcase_27	AC	45 ms 36,636 KB
testcase_28	AC	43 ms 36,544 KB
testcase_29	AC	49 ms 36,544 KB
testcase_30	AC	45 ms 36,476 KB
testcase_31	AC	45 ms 36,884 KB
testcase_32	AC	44 ms 36,508 KB
testcase_33	AC	80 ms 39,280 KB
testcase_34	AC	81 ms 39,476 KB
testcase_35	AC	53 ms 37,000 KB
testcase_36	AC	83 ms 38,708 KB
testcase_37	AC	87 ms 39,304 KB
testcase_38	AC	87 ms 39,056 KB
testcase_39	AC	91 ms 39,720 KB
testcase_40	AC	92 ms 39,476 KB
testcase_41	AC	92 ms 39,564 KB
testcase_42	AC	91 ms 39,700 KB
testcase_43	AC	63 ms 37,600 KB
testcase_44	AC	84 ms 38,928 KB
testcase_45	AC	80 ms 39,488 KB
testcase_46	AC	83 ms 38,500 KB
testcase_47	AC	83 ms 38,556 KB
testcase_48	AC	50 ms 36,960 KB
testcase_49	AC	95 ms 39,732 KB
testcase_50	AC	62 ms 36,864 KB
testcase_51	AC	57 ms 36,564 KB
testcase_52	AC	59 ms 36,988 KB
testcase_53	AC	101 ms 39,716 KB
testcase_54	AC	80 ms 38,964 KB
testcase_55	AC	95 ms 39,528 KB
testcase_56	AC	75 ms 38,364 KB
testcase_57	AC	99 ms 39,896 KB
testcase_58	AC	57 ms 37,216 KB
testcase_59	AC	89 ms 39,500 KB
testcase_60	AC	73 ms 37,904 KB
testcase_61	AC	91 ms 39,580 KB
testcase_62	AC	93 ms 39,544 KB
testcase_63	AC	70 ms 37,312 KB
testcase_64	AC	90 ms 39,508 KB
testcase_65	AC	79 ms 38,332 KB
testcase_66	AC	51 ms 37,104 KB
testcase_67	AC	63 ms 37,940 KB
testcase_68	AC	55 ms 37,144 KB
testcase_69	AC	87 ms 39,300 KB
testcase_70	AC	83 ms 38,668 KB
testcase_71	AC	70 ms 37,520 KB
testcase_72	AC	52 ms 36,936 KB
testcase_73	AC	64 ms 38,476 KB
testcase_74	AC	70 ms 37,384 KB
testcase_75	AC	72 ms 38,536 KB
testcase_76	AC	72 ms 37,696 KB
testcase_77	AC	86 ms 39,008 KB
testcase_78	AC	81 ms 38,720 KB
testcase_79	AC	67 ms 37,524 KB
testcase_80	AC	68 ms 37,652 KB
testcase_81	AC	57 ms 37,228 KB
testcase_82	AC	86 ms 38,940 KB
testcase_83	AC	87 ms 39,720 KB
testcase_84	AC	90 ms 39,724 KB
testcase_85	AC	88 ms 39,944 KB
testcase_86	AC	102 ms 39,724 KB
testcase_87	AC	98 ms 39,920 KB
testcase_88	AC	95 ms 39,804 KB
testcase_89	AC	96 ms 39,996 KB
testcase_90	AC	95 ms 39,764 KB
testcase_91	AC	94 ms 39,892 KB
testcase_92	AC	84 ms 39,764 KB
testcase_93	AC	47 ms 36,960 KB
testcase_94	AC	45 ms 36,844 KB
testcase_95	AC	92 ms 39,756 KB
testcase_96	AC	91 ms 40,036 KB
testcase_97	AC	100 ms 39,792 KB
testcase_98	AC	91 ms 39,532 KB
testcase_99	AC	92 ms 39,660 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package adv2018;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Day8 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	long[] cum;
	long[] a;
	
	void solve()
	{
		int n = ni();
		a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		cum = new long[n+1];
		for(int i = 0;i < n;i++)cum[i+1] = cum[i] + a[i];
		out.println(dfs(0, n) ? "First" : "Second");
	}
	
	boolean dfs(int l, int r)
	{
		if(r-l == 0)return true;
		if(a[l] == a[r-1])return true;
		
		long num = cum[r] - cum[l];
		long den = r-l;
		int low = l, high = r;
		while(high - low > 1){
			int h = high+low>>1;
			if(a[h] * den >= num){
				high = h;
			}else{
				low = h;
			}
		}
		return !dfs(l, high) || !dfs(high, r);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new Day8().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード